Rateless Coding for Gaussian Channels
Name
Wornell_Rateless Coding.pdf
Size
338.83 KB
Format
Adobe PDF
Checksum (MD5)
7110a189f330a521198c027b072c0c03
Author(s)
Erez, Uri
Trott, Mitchell D.
Wornell, Gregory W.
Date Issued
February 2012
Journal
IEEE Transactions on Information Theory
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Erez, Uri, Mitchell D. Trott, and Gregory W. Wornell. “Rateless Coding for Gaussian Channels.” IEEE Transactions on Information Theory 58.2 (2012): 530–547. © Copyright 2012 IEEE
Version
Author's final manuscript
Abstract
A rateless code-i.e., a rate-compatible family of codes-has the property that codewords of the higher rate codes are prefixes of those of the lower rate ones. A perfect family of such codes is one in which each of the codes in the family is capacity-achieving. We show by construction that perfect rateless codes with low-complexity decoding algorithms exist for additive white Gaussian noise channels. Our construction involves the use of layered encoding and successive decoding, together with repetition using time-varying layer weights. As an illustration of our framework, we design a practical three-rate code family. We further construct rich sets of near-perfect rateless codes within our architecture that require either significantly fewer layers or lower complexity than their perfect counterparts. Variations of the basic construction are also developed, including one for time-varying channels in which there is no a priori stochastic model.
Description
June 3, 2011
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/tit.2011.2173242
