Design and Performance of Rate-Compatible Non-binary LDPC Convolutional Codes

In this paper, we present a construction method of non-binary low-density parity-check (LDPC) convolutional codes. Our construction method is an extension of Felstroem and Zigangirov construction for non-binary LDPC convolutional codes. The rate-compatibility of the non-binary convolutional code is also discussed. The proposed rate-compatible code is designed from one single mother (2,4)-regular non-binary LDPC convolutional code of rate 1/2. Higher-rate codes are produced by puncturing the mother code and lower-rate codes are produced by multiplicatively repeating the mother code. Simulation results show that non-binary LDPC convolutional codes of rate 1/2 outperform state-of-the-art binary LDPC convolutional codes with comparable constraint bit length. Also the derived low-rate and high-rate non-binary LDPC convolutional codes exhibit good decoding performance without loss of large gap to the Shannon limits.

[1]  Rüdiger L. Urbanke,et al.  Density Evolution, Thresholds and the Stability Condition for Non-binary LDPC Codes , 2005, ArXiv.

[2]  Valentin Savin,et al.  Non binary LDPC codes over the binary erasure channel: Density evolution analysis , 2008, 2008 First International Symposium on Applied Sciences on Biomedical and Communication Technologies.

[3]  Michael Lentmaier,et al.  Iterative Decoding Threshold Analysis for LDPC Convolutional Codes , 2010, IEEE Transactions on Information Theory.

[4]  Rudiger Urbanke,et al.  Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC , 2010, ISIT.

[5]  Gerhard Fettweis,et al.  Asymptotically good LDPC convolutional codes with AWGN channel thresholds close to the Shannon limit , 2010, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing.

[6]  David Declercq,et al.  Multiplicatively Repeated Nonbinary LDPC Codes , 2011, IEEE Transactions on Information Theory.

[7]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[8]  Aravind R. Iyengar,et al.  Windowed erasure decoding of LDPC Convolutional Codes , 2010, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[9]  David Declercq,et al.  Multiplicatively Repeated Non-Binary LDPC Codes , 2010, ArXiv.

[10]  David Declercq,et al.  Design of regular (2,d/sub c/)-LDPC codes over GF(q) using their binary images , 2008, IEEE Transactions on Communications.

[11]  Ali Emre Pusane,et al.  A Comparison Between LDPC Block and Convolutional Codes , 2006 .

[12]  Rüdiger L. Urbanke,et al.  Threshold saturation on BMS channels via spatial coupling , 2010, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing.

[13]  Ali Emre Pusane,et al.  Construction of Irregular LDPC Convolutional Codes with Fast Encoding , 2006, 2006 IEEE International Conference on Communications.

[14]  David J. C. MacKay,et al.  Low-density parity check codes over GF(q) , 1998, IEEE Communications Letters.

[15]  D. Mackay,et al.  Low density parity check codes over GF(q) , 1998, 1998 Information Theory Workshop (Cat. No.98EX131).

[16]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[17]  Rüdiger L. Urbanke,et al.  Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC , 2010, IEEE Transactions on Information Theory.

[18]  Kamil Sh. Zigangirov,et al.  Time-varying periodic convolutional codes with low-density parity-check matrix , 1999, IEEE Trans. Inf. Theory.