Near-Capacity Adaptive Analog Fountain Codes for Wireless Channels
- 25 October 2013
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 17 (12) , 2241-2244
Abstract
In this paper, we propose a capacity-approaching analog fountain code (AFC) for wireless channels. In AFC, the number of generated coded symbols is potentially limitless. In contrast to the conventional binary rateless codes, each coded symbol in AFC is a real-valued symbol, generated as a weighted sum of d randomly selected information bits, where d and the weight coefficients are randomly selected from predefined probability mass functions. The coded symbols are then directly transmitted through wireless channels. We analyze the error probability of AFC and design the weight set to minimize the error probability. Simulation results show that AFC achieves the capacity of the Gaussian channel in a wide range of signal to noise ratio (SNR).Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Adaptive analog fountain for wireless channels2013
- Fast Decoding and Hardware Design for Binary-Input Compressive SensingIEEE Journal on Emerging and Selected Topics in Circuits and Systems, 2012
- Rateless Coding for Gaussian ChannelsIEEE Transactions on Information Theory, 2012
- Rateless spinal codes2011
- Seamless rate adaptation for wireless networking2011
- APSK Constellation with Gray MappingIEEE Communications Letters, 2011
- StriderACM SIGCOMM Computer Communication Review, 2011
- Bayesian Compressive Sensing Via Belief PropagationIEEE Transactions on Signal Processing, 2009
- A rateless coding and modulation scheme for unknown Gaussian channels2007
- Raptor codesIEEE Transactions on Information Theory, 2006