Raptor codes on binary memoryless symmetric channels
Etesami, O.
Shokrollahi, A.
Comput. Sci. Div., Univ. of California, Berkeley, CA, USA;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: May 2006
Volume: 52,
Issue: 5
On page(s): 2033- 2051
ISSN: 0018-9448
INSPEC Accession Number: 8888621
Digital Object Identifier: 10.1109/TIT.2006.872855
Current Version Published: 2006-04-24
Abstract
In this paper, we will investigate the performance of Raptor codes on arbitrary binary input memoryless symmetric channels (BIMSCs). In doing so, we generalize some of the results that were proved before for the erasure channel. We will generalize the stability condition to the class of Raptor codes. This generalization gives a lower bound on the fraction of output nodes of degree 2 of a Raptor code if the error probability of the belief-propagation decoder converges to zero. Using information-theoretic arguments, we will show that if a sequence of output degree distributions is to achieve the capacity of the underlying channel, then the fraction of nodes of degree 2 in these degree distributions has to converge to a certain quantity depending on the channel. For the class of erasure channels this quantity is independent of the erasure probability of the channel, but for many other classes of BIMSCs, this fraction depends on the particular channel chosen. This result has implications on the "universality" of Raptor codes for classes other than the class of erasure channels, in a sense that will be made more precise in the paper. We will also investigate the performance of specific Raptor codes which are optimized using a more exact version of the Gaussian approximation technique.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
