Computer Science – Information Theory
Scientific paper
2007-08-20
Computer Science
Information Theory
18 pages
Scientific paper
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.
Erez Uri
Trott Mitchell D.
Wornell Gregory W.
No associations
LandOfFree
Rateless Coding for Gaussian Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Rateless Coding for Gaussian Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rateless Coding for Gaussian Channels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-532704