Rateless spinal codes
Authors:
Open Access
- 14 November 2011
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Abstract
A fundamental problem in wireless networks is to develop communication protocols that achieve high throughput in the face of noise, interference, and fading, all of which vary with time. An ideal solution is a rateless wireless system, in which the sender encodes data without any explicit estimation or adaptation, implicitly adapting to the level of noise or interference. In this paper, we present a novel rateless code, the spinal code, which uses a hash function over the message bits to produce pseudo-random bits that in turn can be mapped directly to a dense constellation for transmission. Results from theoretical analysis and simulations show that spinal codes essentially achieve Shannon capacity, and out-perform best-known fixed rate block codes.Keywords
This publication has 12 references indexed in Scilit:
- Strider2011
- Automatic rate adaptation2010
- Channel Coding Rate in the Finite Blocklength RegimeIEEE Transactions on Information Theory, 2010
- Efficient channel-aware rate adaptation in dynamic environments2008
- Raptor codesIEEE Transactions on Information Theory, 2006
- Rate-Compatible Puncturing of Low-Density Parity-Check CodesIEEE Transactions on Information Theory, 2004
- Incremental Redundancy Hybrid ARQ Schemes Based on Low-Density Parity-Check CodesIEEE Transactions on Communications, 2004
- A capacity-approaching hybrid ARQ scheme using turbo codes2003
- A rate-adaptive MAC protocol for multi-Hop wireless networks2001
- Channel coding with multilevel/phase signalsIEEE Transactions on Information Theory, 1982