Reconfigurable Rateless Codes
Authors:
- 20 November 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 8 (11) , 5592-5600
Abstract
We propose novel reconfigurable rateless codes, that are capable of not only varying the block length but also adaptively modify their encoding strategy by incrementally adjusting their degree distribution according to the prevalent channel conditions without the availability of the channel state information at the transmitter. In particular, we characterize a reconfigurable rateless code designed for the transmission of 9,500 information bits that achieves a performance, which is approximately 1 dB away from the discrete-input continuous-output memoryless channel's (DCMC) capacity over a diverse range of channel signal-to-noise (SNR) ratios.Keywords
This publication has 18 references indexed in Scilit:
- Incremental Redundancy Cooperative Coding for Wireless Networks: Cooperative Diversity, Coding, and Transmission Energy GainsIEEE Transactions on Information Theory, 2008
- Efficient Puncturing Method for Rate-Compatible Low-Density Parity-Check CodesIEEE Transactions on Wireless Communications, 2007
- Rateless Coding and Relay NetworksIEEE Signal Processing Magazine, 2007
- Distributed joint source-channel coding of video using raptor codesIEEE Journal on Selected Areas in Communications, 2007
- Rateless coding over fading channelsIEEE Communications Letters, 2006
- Raptor codesIEEE Transactions on Information Theory, 2006
- The turbo‐fountainEuropean Transactions on Telecommunications, 2006
- Performance of the turbo hybrid automatic repeat request system type II2003
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999