Select a calendar:
Filter February Events by Event Type:
SUNMONTUEWEDTHUFRISAT
Events for February 24, 2012
-
Unique Word Prefix OFDM: An Overview
Fri, Feb 24, 2012 @ 10:30 AM - 11:30 AM
Ming Hsieh Department of Electrical and Computer Engineering
Conferences, Lectures, & Seminars
Speaker: Prof. Dr.-Ing. habil. Johannes Huber, University of Erlangen-Nuremberg
Talk Title: Unique Word Prefix OFDM: An Overview
Abstract: In unique word OFDM (UW-OFDM), cyclic prefixes (CP) of usual OFDM are replaced by a deterministic sequence, the unique word (UW), for conversion of linear convolution due to a dispersive channel into cyclic convolution. This fixed UW may be employed for synchronization and/or channel estimation purposes etc. at the receiver side. In order to generate space for the UW, a block of zeros is created in time domain by means of appropriately loading of redundant subcarriers. By this, a systematic complex number Reed Solomon (RS) code construction is inherently introduced along the subcarriers which additionally can be exploited at the receiver by means of Bayesian linear data estimation (LMMSE) or decision-directed methods (SIC, Noise Prediction). A remaining problem in the UW-OFDM concept is the fact that the energy on the redundant subcarrier symbols contributes disproportionately to average symbol energy. Two methods for a reduction of this redundant energy are proposed, i.e. allowing some small systematic noise in the guard interval and spreading of redundant energy over all subcarrier symbols by which a nonsystematic complex number RS code construction is introduced. Numerical results and comparisons to usual CP-OFDM are presented for the example 802.11a WLAN standard which illustrate benefits of UW-OFDM.
Biography: Johannes Huber received the Dipl.-Ing. degree in electrical engineering from the Technische Universität München, Munich, Germany in 1977. From 1977 to 1982 he was research assistant at the Lehrstuhl für Nachrichtentechnik of the Universität der Bundeswehr München, Munich, from which he received the Dr.-Ing. degree with a thesis on coding for channels with memory. From 1982 to 1990, he was an Akademischer Oberrat at the Universität der Bundeswehr München, Munich and received the Dr.-Ing. habil. degree with a thesis on trellis coded modulation. In 1991 he joined the IBM Research Laboratory, Zurich, Switzerland. He is currently a Professor at the Friedrich-Alexander-University Erlangen-Nuremberg, Germany. He is a former: dean for student affairs, chairman of the department of electrical, electronic, and communication engineering and dean of the Technical Faculty. Dr. Huber is a Fellow of the IEEE, has served two terms on the Board of Governors for the IEEE Information Theory Society (1999-2001,2004-2006. In 2008, he was appointed a corresponding fellow of the Royal Society of Edinburgh. Since 2009, Dr. Huber is an ordinary fellow of the Bavarian Academy of Sciences and Humanities. Dr. Huber has held editorial positions for the IEEE Transactions on Communications and the International Journal on Electronics and Communications for which he has also served as editor-in-chief. Johannes Huber is author and co-author of textbooks on trellis coding and information combining. He has published more than 220 papers in international journals or conference records. Papers authored or co-authored by Johannes Huber were awarded the best paper award of the German Society of Information Technology (ITG) in 1988, 2000, and 2006. He received the Vodafone award for innovations in mobile communications 2004.
Host: Prof. Urbashi Mitra, ubli@usc.edu, x04667
Location: Henry Salvatori Computer Science Center (SAL) - 222
Audiences: Everyone Is Invited
Contact: Gerrielyn Ramos
-
Advances in Clouds and Their Application to Data Intensive Problems
Fri, Feb 24, 2012 @ 10:30 AM - 12:00 PM
Ming Hsieh Department of Electrical and Computer Engineering
Conferences, Lectures, & Seminars
Speaker: Geoffrey Fox, Distinguished Chair Professor, School of Informatics and Computing Indiana University, Bloomington, IN
Talk Title: Advances in Clouds and Their Application to Data Intensive Problems
Abstract: We introduce clouds and discuss the characteristics of problems that run well on them. We try to answer when you need your own cluster; when you need a Grid; when a national supercomputer; and when a cloud. We compare "academic" and commercial clouds and the experience on FutureGrid with Nimbus, Eucalyptus, OpenStack and OpenNebula. We look at programming models especially MapReduce and Iterative Mapreduce and their use on data analytics. We compare with an Internet of Things application with a Sensor Grid controlled by a cloud infrastructure.
Biography: Fox received a Ph.D. in Theoretical Physics from Cambridge University and is now distinguished professor of Informatics and Computing, and Physics at Indiana University where he is director of the Digital Science Center and Associate Dean for Research and Graduate Studies at the School of Informatics and Computing. He previously held positions at Caltech, Syracuse University and Florida State University. He has supervised the PhD of 62 students and published over 600 papers in physics and computer science with a hindex of 61 and over 18700 citations. He currently works in applying computer science to Bioinformatics, Defense, Earthquake and Ice-sheet Science, Particle Physics and Chemical Informatics. He is principal investigator of FutureGrid â a facility to enable development of new approaches to computing. He is involved in several projects to enhance the capabilities of Minority Serving Institutions.
Host: Professor Kai Hwang
Location: Hedco Petroleum and Chemical Engineering Building (HED) - 116
Audiences: Everyone Is Invited
Contact: Janice Thompson
-
Integrated Systems Seminar Series
Fri, Feb 24, 2012 @ 02:00 PM - 03:50 PM
Ming Hsieh Department of Electrical and Computer Engineering
Conferences, Lectures, & Seminars
Speaker: Ramesh Harjani, University of Minnesota
Talk Title: Analog Circuits for Digital Systems
Host: Hossein Hashemi
Location: Mark Taper Hall Of Humanities (THH) - 112
Audiences: Everyone Is Invited
Contact: Hossein Hashemi
