Affiliation:
1. M.I.T., Cambridge, MA, USA
Abstract
Spinal codes are a new class of rateless codes that enable wireless networks to cope with time-varying channel conditions in a natural way, without requiring any explicit bit rate selection. The key idea in the code is the sequential application of a pseudo-random hash function to the message bits to produce a sequence of coded symbols for transmission. This encoding ensures that two input messages that differ in even one bit lead to very different coded sequences after the point at which they differ, providing good resilience to noise and bit errors. To decode spinal codes, this paper develops an approximate maximum-likelihood decoder, called the
bubble decoder
, which runs in time polynomial in the message size and achieves the Shannon capacity over both additive white Gaussian noise (AWGN) and binary symmetric channel (BSC) models. Experimental results obtained from a software implementation of a linear-time decoder show that spinal codes achieve higher throughput than fixed-rate LDPC codes, rateless Raptor codes, and the layered rateless coding approach of Strider, across a range of channel conditions and message sizes. An early hardware prototype that can decode at 10 Mbits/s in FPGA demonstrates that spinal codes are a practical construction.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Software
Reference43 articles.
1. Sequential Coding Algorithms: A Survey and Cost Analysis
2. Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
3. H. Balakrishnan P. Iannucci J. Perry and D. Shah. De-randomizing Shannon: The Design and Analysis of a Capacity-Achieving Rateless Code. arXiv:1206.0418 June 2012. H. Balakrishnan P. Iannucci J. Perry and D. Shah. De-randomizing Shannon: The Design and Analysis of a Capacity-Achieving Rateless Code. arXiv:1206.0418 June 2012.
4. The Salsa20 Family of Stream Ciphers
Cited by
97 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献