Time-invariant rateless codes for MIMO channels

Maryam Modir Shanechi, Uri Erez, Gregory W. Wornell, Kevin P. Boyle

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Two time-invariant rateless code constructions are developed for efficient communication over multi-input multioutput (MIMO) Gaussian channels. Both architectures employ layering, dithering, and repetition as key ingredients, and convert the MIMO channel into a scalar channel to which classical Gaussian base codes can be applied. Both constructions are convolutionally structured-one is based on faster-than-Nyquist (ftN) signaling, while the other on a diagonal layering (DL) structure. Moreover, both employ successive cancellation decoding. We show that ftN rateless codes are asymptotically capacity achieving at any signal-to-noise ratio (SNR) and induce a time-invariant scalar channel. We also show that DL codes are capacity achieving at any SNR, and induce a particular time-varying scalar channel to which standard LDPC base codes can be applied without significantly sacrificing performance.

Original languageEnglish
Title of host publicationProceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Number of pages5
StatePublished - 2008
Event2008 IEEE International Symposium on Information Theory, ISIT 2008 - Toronto, ON, Canada
Duration: 6 Jul 200811 Jul 2008

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101


Conference2008 IEEE International Symposium on Information Theory, ISIT 2008
CityToronto, ON


Dive into the research topics of 'Time-invariant rateless codes for MIMO channels'. Together they form a unique fingerprint.

Cite this