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).
Near-Capacity Adaptive Analog Fountain Codes for Wireless Channels
M. Shirvanimoghaddam,Yonghui Li,B. Vucetic
Published 2013 in IEEE Communications Letters
ABSTRACT
PUBLICATION RECORD
- Publication year
2013
- Venue
IEEE Communications Letters
- Publication date
2013-10-02
- Fields of study
Mathematics, Computer Science, Engineering
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-13 of 13 references · Page 1 of 1
CITED BY
Showing 1-68 of 68 citing papers · Page 1 of 1