Spinal codes
Spinal codes
复制标题
DOI：
10.1145/2342356.2342363
复制
发表时间：
2012-08
期刊：
影响因子：
--
通讯作者：
Jonathan Perry;Peter A. Iannucci;Kermin Fleming;H. Balakrishnan;Devavrat Shah
中科院分区：
文献类型：
--
作者：
Jonathan Perry;Peter A. Iannucci;Kermin Fleming;H. Balakrishnan;Devavrat Shah
脊码是一类新的无速率码，它使无线网络能够以自然的方式科普时变信道条件，而不需要任何显式的比特率选择。该代码的关键思想是将伪随机散列函数顺序应用于消息位，以产生用于传输的编码符号序列。这种编码确保了即使在一个比特上不同的两个输入消息在它们不同的点之后也会导致非常不同的编码序列，从而提供了对噪声和比特错误的良好弹性。为了解码脊髓码，本文开发了一种近似的最大似然解码器，称为气泡解码器，它运行在时间多项式的消息大小，并实现了香农容量在加性白色高斯噪声（AWGN）和二进制对称信道（BSC）模型。从线性时间解码器的软件实现获得的实验结果表明，脊柱码实现更高的吞吐量比固定速率LDPC码，无速率Raptor码，和分层无速率编码方法的Strider，在一系列的信道条件和消息大小。一个早期的硬件原型，可以解码在10 Mbits/s的FPGA证明，脊髓码是一个实用的结构。
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.