|
|
|
|
| LEADER |
01749 am a22002173u 4500 |
| 001 |
73609 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Erez, Uri
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
|e contributor
|
| 100 |
1 |
0 |
|a Wornell, Gregory W.
|e contributor
|
| 700 |
1 |
0 |
|a Trott, Mitchell D.
|e author
|
| 700 |
1 |
0 |
|a Wornell, Gregory W.
|e author
|
| 245 |
0 |
0 |
|a Rateless Coding for Gaussian Channels
|
| 260 |
|
|
|b Institute of Electrical and Electronics Engineers (IEEE),
|c 2012-10-04T17:35:21Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/73609
|
| 520 |
|
|
|a June 3, 2011
|
| 520 |
|
|
|a 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.
|
| 520 |
|
|
|a National Science Foundation (U.S.) (Grant CCF-0515122)
|
| 546 |
|
|
|a en_US
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t IEEE Transactions on Information Theory
|
