Rateless Coding for Gaussian Channels
June 3, 2011
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2012
|
| Online Access: | http://hdl.handle.net/1721.1/73609 https://orcid.org/0000-0001-9166-4758 |
| _version_ | 1826193305672613888 |
|---|---|
| author | Erez, Uri Trott, Mitchell D. Wornell, Gregory W. |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Erez, Uri Trott, Mitchell D. Wornell, Gregory W. |
| author_sort | Erez, Uri |
| collection | MIT |
| description | June 3, 2011 |
| first_indexed | 2024-09-23T09:36:53Z |
| format | Article |
| id | mit-1721.1/73609 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T09:36:53Z |
| publishDate | 2012 |
| publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| record_format | dspace |
| spelling | mit-1721.1/736092022-09-26T12:40:00Z Rateless Coding for Gaussian Channels Erez, Uri Trott, Mitchell D. Wornell, Gregory W. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Wornell, Gregory W. June 3, 2011 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. National Science Foundation (U.S.) (Grant CCF-0515122) 2012-10-04T17:35:21Z 2012-10-04T17:35:21Z 2012-02 2010-12 Article http://purl.org/eprint/type/JournalArticle 0018-9448 1557-9654 http://hdl.handle.net/1721.1/73609 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 https://orcid.org/0000-0001-9166-4758 en_US http://dx.doi.org/10.1109/tit.2011.2173242 IEEE Transactions on Information Theory Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.0/ application/pdf Institute of Electrical and Electronics Engineers (IEEE) arXiv |
| spellingShingle | Erez, Uri Trott, Mitchell D. Wornell, Gregory W. Rateless Coding for Gaussian Channels |
| title | Rateless Coding for Gaussian Channels |
| title_full | Rateless Coding for Gaussian Channels |
| title_fullStr | Rateless Coding for Gaussian Channels |
| title_full_unstemmed | Rateless Coding for Gaussian Channels |
| title_short | Rateless Coding for Gaussian Channels |
| title_sort | rateless coding for gaussian channels |
| url | http://hdl.handle.net/1721.1/73609 https://orcid.org/0000-0001-9166-4758 |
| work_keys_str_mv | AT erezuri ratelesscodingforgaussianchannels AT trottmitchelld ratelesscodingforgaussianchannels AT wornellgregoryw ratelesscodingforgaussianchannels |