Design and performance of spinal codes over fading channels

Spinal codes are a new kind of rateless codes designed for noisy channels. In this paper, we will explore the design and performance of spinal codes on rapidly time-varying channels, which corresponds to high mobility scenarios, and propose a parallel coding scheme to improve their performance in terms of Bit-Error-Ratio (BER) and spectral-efficiency over fading channels. Simulation results show the performance improvement of the proposed scheme in terms of the spectral-efficiency compared to conventional spinal codes over the rapidly time-varying channel.

[1]  Branka Vucetic,et al.  Near-Capacity Adaptive Analog Fountain Codes for Wireless Channels , 2013, IEEE Communications Letters.

[2]  Lajos Hanzo,et al.  Reconfigurable rateless codes , 2009 .

[3]  Xiao Ma,et al.  Precoded Kite codes for the AWGN channel , 2013, 2013 International Conference on Wireless Communications and Signal Processing.

[4]  Xiao Ma,et al.  Simple rateless error-correcting codes for fading channels , 2011, Science China Information Sciences.

[5]  Devavrat Shah,et al.  Rateless spinal codes , 2011, HotNets-X.

[6]  A. Goldsmith,et al.  Capacity of Rayleigh fading channels under different adaptive transmission and diversity-combining techniques , 1999, IEEE Transactions on Vehicular Technology.

[7]  Daniel A. Spielman,et al.  Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.

[8]  Daniel J. Bernstein,et al.  The Salsa20 Family of Stream Ciphers , 2008, The eSTREAM Finalists.

[9]  Chris Jones,et al.  Rate-compatible low-density parity-check codes , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[10]  Gregory W. Wornell,et al.  Rateless Coding for Gaussian Channels , 2007, IEEE Transactions on Information Theory.

[11]  Rui Tao,et al.  Simulation of Spinal Codes , 2013, Smart Comput. Rev..

[12]  S. S. Pietrobon,et al.  Rate compatible turbo codes , 1995 .

[13]  Devavrat Shah,et al.  De-randomizing Shannon: The Design and Analysis of a Capacity-Achieving Rateless Code , 2012, ArXiv.

[14]  Amin Shokrollahi,et al.  Raptor codes , 2011, IEEE Transactions on Information Theory.

[15]  Devavrat Shah,et al.  Spinal codes , 2012, CCRV.

[16]  Xiao Ma,et al.  A new ensemble of rate-compatible LDPC codes , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[17]  Pravin Varaiya,et al.  Capacity of fading channels with channel side information , 1997, IEEE Trans. Inf. Theory.

[18]  Omid Etesami,et al.  Raptor codes on binary memoryless symmetric channels , 2006, IEEE Transactions on Information Theory.

[19]  Richard M. Karp,et al.  Finite length analysis of LT codes , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[20]  Xiao Ma,et al.  Serial Concatenation of RS Codes with Kite Codes: Performance Analysis, Iterative Decoding and Design , 2011, ArXiv.