On Rateless Coding over Fading Channels with Delay Constraints
- 1 July 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1124-1128
Abstract
We explore the use of rateless coding for communication over fading channels with delay constraints. Both quasi-static fading and block-fading channels are considered. When only the receiver has channel information, we show there exist rateless codes that are both reliable and efficient for every channel realization of such channels. We then apply these codes to a wireless streaming application with a sequence of playback deadlines. Rateless strategies demonstrate benefits in terms of throughput and outage probability compared to fixed-rate schemesKeywords
This publication has 20 references indexed in Scilit:
- Rateless coding over fading channelsIEEE Communications Letters, 2006
- LDPC code ensembles for incremental redundancy hybrid ARQ2005
- Efficient variable length channel coding for unknown DMCs2004
- Optimal feedback schemes over unknown channels2004
- Incremental Redundancy Hybrid ARQ Schemes Based on Low-Density Parity-Check CodesIEEE Transactions on Communications, 2004
- Effective capacity: A wireless link model for support of quality of serviceIEEE Transactions on Wireless Communications, 2003
- Elements of Information Theory2001
- The throughput of hybrid-ARQ protocols for the Gaussian collision channelIEEE Transactions on Information Theory, 2001
- Fast iterative coding techniques for feedback channelsIEEE Transactions on Information Theory, 1998
- Reliable communication under channel uncertaintyIEEE Transactions on Information Theory, 1998