Rateless spinal codes
Name
hotnetsX-final32.pdf
Size
257.46 KB
Format
Adobe PDF
Checksum (MD5)
c209ef3deb49787abfdbf66f7925856b
Author(s)
Perry, Jonathan
Balakrishnan, Hari
Shah, Devavrat
Date Issued
2011
Journal
Proceedings of the 10th ACM Workshop on Hot Topics in Networks (HotNets-X)
Publisher
Association for Computing Machinery (ACM)
Citation
Jonathan Perry, Hari Balakrishnan, and Devavrat Shah. 2011. Rateless spinal codes. In Proceedings of the 10th ACM Workshop on Hot Topics in Networks (HotNets-X). ACM, New York, NY, USA, , Article 6 , 6 pages.
Version
Author's final manuscript
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
http://dx.doi.org/10.1145/2070562.2070568
