Implementation aspects of LDPC convolutional codes

Potentially large storage requirements and long initial decoding delays are two practical issues related to the decoding of low-density parity-check (LDPC) convolutional codes using a continuous pipeline decoder architecture. In this paper, we propose several reduced complexity decoding strategies to lessen the storage requirements and the initial decoding delay without significant loss in performance. We also provide bit error rate comparisons of LDPC block and LDPC convolutional codes under equal processor (hardware) complexity and equal decoding delay assumptions. A partial syndrome encoder realization for LDPC convolutional codes is also proposed and analyzed. We construct terminated LDPC convolutional codes that are suitable for block transmission over a wide range of frame lengths. Simulation results show that, for terminated LDPC convolutional codes of sufficiently large memory, performance can be improved by increasing the density of the syndrome former matrix.

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

[2]  Michael Lentmaier,et al.  Terminated LDPC convolutional codes with thresholds close to capacity , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[3]  Stephen Bates,et al.  A memory-based architecture for FPGA implementations of low-density parity-check convolutional decoders , 2005, 2005 IEEE International Symposium on Circuits and Systems.

[4]  Daniel J. Costello,et al.  Analog rotating ring decoder for an LDPC convolutional code , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

[5]  Rolf Johannesson,et al.  Fundamentals of Convolutional Coding , 1999 .

[6]  Arvind Sridharan,et al.  Design and Analysis of LDPC Convolutional Codes , 2005 .

[7]  Niclas Wiberg,et al.  Codes and Decoding on General Graphs , 1996 .

[8]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

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

[10]  Michael Lentmaier,et al.  Distance Bounds for an Ensemble of LDPC Convolutional Codes , 2007, IEEE Transactions on Information Theory.

[11]  A. J. Viterbi Error-correcting coding for CDMA systems , 1994, Proceedings of IEEE 3rd International Symposium on Spread Spectrum Techniques and Applications (ISSSTA'94).

[12]  Sae-Young Chung,et al.  On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit , 2001, IEEE Communications Letters.

[13]  Yu Kou,et al.  Low Density Parity Check Codes Based on Finite Geometries: A Rediscovery and More , 1999 .

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

[15]  Shu Lin,et al.  Error Control Coding , 2004 .

[16]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[17]  Shu Lin,et al.  Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.

[18]  Sae-Young Chung,et al.  Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation , 2001, IEEE Trans. Inf. Theory.

[19]  Xiaodai Dong,et al.  Low-density parity-check convolutional codes for Ethernet networks , 2005, PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005..