Lecture
Spatially coupled LDPC codes: from theory to practice
Daniel J. Costello, Jr.Ìý(University of Notre Dame)
Daniel J. Costello, Jr.Ìý(University of Notre Dame)
Ìý
Abstract
Following a review of the basic concepts of low-density parity-check (LDPC) block codes, we examine spatially coupled LDPC codes from several different perspectives. First, asymptotic ensemble average properties are presented, including both iterative decoding thresholds and minimum distance growth rates. Protograph-based code ensembles form the basis for this discussion. Next, finite-length code properties, such as bit-error-rate (BER) performance, decoding latency, and decoding complexity are reviewed. With sliding window decoding, we see that spatially coupled codes achieve a BER performance advantage compared to block codes for fixed decoding latency and practical block (window) lengths, and decoding complexity results are presented for both binary and non-binary codes. Finally, the BER performance advantages of spatially coupled codes are shown to also hold when puncturing is employed to achieve higher code rates.
Biography
Daniel J. Costello, Jr. was born in Seattle, WA, on August 9, 1942. He received the B.S.E.E. degree from Seattle University, Seattle, WA, in 1964, and the M.S. and Ph.D. degrees in Electrical Engineering from the University of Notre Dame, Notre Dame, IN, in 1966 and 1969, respectively. Dr. Costello joined the faculty of the Illinois Institute of Technology, Chicago, IL, in 1969. In 1985 he became Professor of Electrical Engineering at the University of Notre Dame, Notre Dame, IN, and from 1989 to 1998 served as Chair of the Department of Electrical Engineering. In 1991, he was selected as one of 100 Seattle University alumni to receive the Centennial Alumni Award in recognition of alumni who have displayed outstanding service to others, exceptional leadership, or uncommon achievement. In 1999, he received a Humboldt Research Prize from the Alexander von Humboldt Foundation in Germany. In 2000, he was named the Leonard Bettex Professor of Electrical Engineering at Notre Dame, and in 2009 he became Bettex Professor Emeritus. Dr. Costello has been a member of Â鶹´«Ã½AV since 1969 and was elected Fellow in 1985. He served 18 years as a member of the Information Theory Society Board of Governors, and in 1986 he was President of the BOG. In 2000, the Â鶹´«Ã½AV Information Theory Society selected him as a recipient of a Third-Millennium Medal. In 2009, he was co-recipient of the Â鶹´«Ã½AV Donald G. Fink Prize Paper Award, which recognizes an outstanding survey, review, or tutorial paper in any Â鶹´«Ã½AV publication issued during the previous calendar year. In 2012, he was a co-recipient of the joint Â鶹´«Ã½AV Information Theory Society/Communications Society Prize Paper Award, which recognizes an outstanding research paper in the IT or COM Transactions during the previous two calendar years. In 2013, he received the Aaron D. Wyner Distinguished Service Award from the Â鶹´«Ã½AV Information Theory Society, which recognizes outstanding leadership in and long standing exceptional service to the Information Theory community. In 2015 he received the Â鶹´«Ã½AV Leon K. Kirchner Graduate Teaching Award, which recognizes inspirational teaching of graduate students in the Â鶹´«Ã½AV fields of interest. Dr. Costello's research interests are in digital communications, with special emphasis on error control coding and coded modulation. He has numerous technical publications in his field, and in 1983 he co-authored a textbook entitled "Error Control Coding: Fundamentals and Applications", the 2nd edition of which was published in 2004.
Ìý
Ìý
Lecture
Channel reliability: from ordinary to zero-error capacity
Marco DalaiÌý(University of Brescia)
Ìý
Abstract
Bounds on the probability of error of optimal fixed length coding schemes have a long history in information theory. In their simplest form, such bounds allow one to determine the capacity C of a channel, the highest rate at which such probability of error vanishes for increasing block-length. At fixed rates below channel capacity, the probability of error is known to decrease exponentially in the block-length, and a central question is understanding precisely how fast, that is determining the so called error exponent.
While we have good understanding of error exponents near capacity, the region of low rates remains mysterious, even for such a simple case as the binary symmetric channel. The situation is even more baffling when the channel has a positive zero-error capacity C_0, that is, it allows communication at positive rates with probability of error precisely equal to zero.ÌýDetermining the zero-error capacity is in itself perhaps one of the hardest open problems in information theory; whenever C_0 is positive then, even in those cases where it is easy to compute, we have very little understanding of error exponents at slightly higher rates.ÌýOur knowledge becomes even more incomplete when we come to consider variations on the problem such as list decoding schemes or so called classical-quantum channels.
In this lecture, we will review some of the most important classical results on error exponents and zero-error capacity, we will present some recent advances, and finally discuss some fundamental open problems.
Biography
Marco Dalai is an assistant professor in the Department of Information Engineering at the University of Brescia, Italy. He received his Laurea degree in Electronics Engineering and his PhD in Information Engineering both from University of Brescia in 2003 and 2007, respectively.ÌýHis research interests include information theory, signal processing and statistical inference.ÌýHe received the 2014 Â鶹´«Ã½AV Information Theory Society Paper Award.
Ìý
Ìý
Lecture
Fundamental limits in asynchronous communication
Aslan TchamkertenÌý(Telecom ParisTech)
Ìý
Abstract
The traditional information theory approach to reliable communication ignores issues related to synchronization and assumes that the receiver is cognizant of the message transmission period. This is justified when messages are long and sent continuously as synchronization overhead is amortized over many information bits. By contrast when messages are relatively short, synchronization can no longer be ignored. What are the fundamental limitations due to the lack of a priori synchrony between the transmitter and the receiver? In this tutorial we will develop a theory of asynchronous communication and will address basic questions such as "Is it always possible to communicate asynchronously?", "Does asynchronism always impact communication?", or "What is the energy needed to convey 1 bit asynchronously?".
Biography
Dr. Tchamkerten got his physics diploma and Ph.D. degree in information theory at EPFL in 2000 and 2005, respectively. ÌýOver 2005-2008 he was a postdoc at MIT. Since 2008, Dr. Tchamkerten has been on the faculty at Telecom ParisTech, Communications and Electronics department, where where he is currently Associate Professor. In 2009 he was awarded a junior excellence chair grant from the French National Research Agency (ANR), in 2011 he got his habilitation, and during the 2014-2015 academic year he was on sabbatical at Stanford. In 2016 he was the general chair of the thematic program "Nexus of Information and Computation Theories'' held at the Institut Henri Poincaré. Dr. Tchamkerten currently serves as a Shannon Theory AE for the Â鶹´«Ã½AV Transactions on Information Theory.
Ìý
Ìý
Ìý
Lecture
Information-theoretic signal processing
Ram ZamirÌý(Tel Aviv University)
Ìý
Abstract
Information and spectrum are parallel concepts inÌýinformation theory and signal processing. Entropy and spectral bandwidth play similar roles in measuring the richnessÌýof a signal, while compression and sampling aim at reducing a signalÌýto its minimal representation. On the practical level, signalÌýprocessing techniques can simplify the structure of informationÌýtheoretic solutions. For example, Wiener estimation can replaceÌý"joint typicality decoding" on the AWGN channel, while linearÌýprediction can reduce the realization of the rate-distortionÌýfunction of a colored Gaussian process to a scalar mutual information.ÌýA key element in these paradigms is "dithering" (codebookÌýrandomization), which elegantly smooths the transition betweenÌýthe analog regime (of signal processing) and digital regimeÌý(of information theory).
After surveying these basic ideas in the first part of my lecture,ÌýI will turn to describe the problem of multiple description source coding.ÌýThis problem suggests interesting challenges both in the informationÌýtheoretic side, as well as in applying signal processingÌýtechniques toward a simple solution. We shall explore various elements,Ìýsuch as oversampling and interpolation, noise shaping, reconstructionÌýfrom non-uniform sampling, analog coding, good frames, and more.
Slides - Part 1Ìý›
Slides - Part 2 ›
Biography
Ram Zamir was born in Ramat-Gan, Israel in 1961. He received the B.Sc.,ÌýM.Sc. (summa cum laude) and D.Sc. (with distinction)Ìýdegrees from Tel-Aviv University, Israel, in 1983, 1991, and 1994,Ìýrespectively, all in electrical engineering.ÌýIn the years 1994 - 1996 he spent a post-doctoral period at Cornell University, Ithaca, NY, and at the University of California, Santa Barbara.ÌýIn 2002 he spent a Sabbatical year at MIT, and in 2008 and 2009 shortÌýSabbaticals at ETH and MIT. Since 1996 he has been with the department ofÌýElect. Eng. - Systems at Tel Aviv University.
Ram Zamir has been consulting in the areas of radar andÌýcommunications (DSL and WiFi), where he was involved with companies like Orckit and Actelis.ÌýDuring the period 2005-2014 he was the Chief Scientist of Celeno Communications.ÌýHe has been teaching information theory, data compression, random processes, communications systems and communications circuits at Tel Aviv University. He is an Â鶹´«Ã½AV fellow since 2010. He served as an Associate Editor for Source Coding in the Â鶹´«Ã½AV transactions on Information Theory (2001-2003), headed the Information Theory Chapter of the Israeli Â鶹´«Ã½AVÌýsociety (2000-2005), and was a member of the BOG of the societyÌý(2013-2015). His research interests include information theory (in particular: lattice codes for multi-terminal problems), source coding, communications and statistical signal processing. His book "Lattice coding for signals and networks" was published in 2014.
Ìý
Ìý
Ìý
Mini-plenary
Degrees-of-freedom robust transmission for the K-user distributed broadcast channel
Paul de KerretÌý(Eurecom)
Ìý
Abstract
Decentralized joint transmission from multiple transmitters is now becoming considered for the future wireless networks as a cost-efficient alternative to the so-called Cloud-RAN architecture, in particular thanks to the development of caching (data prefetching) which makes the user's data available at the transmitters. Yet, this decentralized approach gives rise to a new source of error as the Channel State Information at the non-colocated Transmitters (CSIT) is then likely to be not only imperfect, but also imperfectly shared between the cooperating transmitters.
In this talk, we start by introducing the Degrees-of-Freedom (DoF) as an insightful figure-of-merit. Considering the decentralized joint transmission from multiple transmitters described above, we then explain why conventional transmission schemes suffer from severe losses in terms of DoF when confronted to the imperfectly shared CSIT. We then provide possible remedies to improved the efficiency of the transmission and discuss the main insights coming from the DoF analysis.
Biography
Paul de Kerret graduated in 2009 from TELECOM Bretagne in France, andÌýobtained a diploma degree in Electrical Engineering and InformationÌýtechnology from the TU Munich in Germany with a specialization inÌýinformation technology and signal processing. In December 2013, heÌýobtained his doctorate under the supervision of David Gesbert. From December 2015 to August 2015, he was an assistant professor at TELECOM Bretagne. In September 2015, he joined EURECOM where he is now a researcher.ÌýHe has published more than 30 papers in Â鶹´«Ã½AV international conferences and journals and participated in several collaborative FP7 European projects.
Ìý
Ìý
Ìý
Mini-plenary
Asymptotics of the error probability in quasi-static channels
Josep Font–SeguraÌý(Universitat Pompeu Fabra)
Ìý
Abstract
In this talk, we derive asymptotic expansions of the random coding union bound to the error probability, as the codeword length goes to infinity, in quasi-static channels. We approximate the pairwise error probability using the saddlepoint method, write the union bound as a tail probability, and then find a Taylor series in inverse powers of the codeword length. After the leading term in the expansion, namely the outage probability, the next two terms are found to be proportional to (log n)/n and 1/n, respectively, where n is the codeword length. Explicit characterizations of the respective coefficients are given for the quasi-static binary erasure channel, the quasi-static binary symmetric channel, and the quasi-static fading channel.
Biography
Josep Font-Segura received the MSc and the PhD degrees in telecommunication engineering from Universitat Politècnica de Catalunya (UPC), Barcelona, in 2008 and 2014, respectively. He was Research Assistant within the Electrical Engineering Department, Columbia University, New York, from 2008 to 2009; and within the Signal Theory and Communications Department, UPC, from 2009 to 2014. Since October 2014, he is Research Associate at the Information and Communication Technologies Department, Universitat Pompeu Fabra.
Dr Font-Segura is a recipient of the Best Paper Award at the 2013 Â鶹´«Ã½AV International Conference on Communications, and of a 2014 Juan de la Cierva Fellowship from the Spanish Ministry of Economy and Competitiveness. He was member of the Organizing Committee of the 2016 Â鶹´«Ã½AV International Symposium on Information Theory held in Barcelona, and he is currently the Vice-Chair of the Spanish Chapter of the Â鶹´«Ã½AV Information Theory Society. His research interests include signal processing, digital communications, and information theory.
Ìý
Ìý
Ìý
Mini-plenary
Coded random access: using coding theory to build random access protocols
Enrico PaoliniÌý(University of Bologna)
Ìý
Abstract
Recent communication applications rekindled some interest in random access protocols and their use to support transmissions from uncoordinated devices. We present coded random access, in which the structure of the access protocol can be mapped to that of codes defined on graphs. This opens the possibility to use coding theory and tools for designing efficient random access protocols, offering markedly better performance.
Biography
Enrico Paolini is an Associate Professor at the Department of Electrical, Electronic, and Information Engineering "Guglielmo Marconi" (DEI) of the University of Bologna. His research interests include error-correcting codes, wireless access protocols, tracking algorithms in radar systems. In the field of error correcting codes, has been involved since 2004 in several activities within the Consultative Committe for Space Data Systems (CCSDS). He was Visiting Scientist at the Institute of Communications and Navigation of the German Aerospace Center in 2012 and 2014 under DLR-DAAD fellowships. He is Editor (for Communication Theory) for the Â鶹´«Ã½AV Transactions on Communications and past Editor (2012-2015) for the Â鶹´«Ã½AV Communications Letters. He served on the organizing committee (as co-chair) of the ICC'14, ICC'15, and ICC'16 Workshop on Massive Uncoordinated Access Protocols.
Ìý