PG-LDPCC Codes in Turbo Equalizer Systems - A Study on the Influence of Design Parameters of Terminated Convolutional Protographs

This paper deals with the study of parameter variations of protograph-based low-density parity-check convolutional codes (PG-LDPCCC) for a transmission system incorporating linear mapping and the turbo equalization approach. LDPCCCs in general raised a lot of attention recently due to their very good error correction performance. In this work the focus lies on codes derived from protographs due to the opportunity to use a tool called density evolution for the analysis. In order to produce convolutional variants two different parameters (syndrome former memory ms, termination length L) play an important role. Throughout this paper, the influence of these parameters is analyzed by means of EXIT-Charts and Monte-Carlo-Simulations and their influences on the unwrapped graph are discussed. Although both parameters have an impact on the shape of transfer curves, and therefore on the overall performance, the memory has a more dominant effect on the shape, especially at the start of the iterative process when a-prioi information is low. However in order to reduce the rate loss, which depends on both parameters, for a fixed permutation size and ms, the termination length L must be increased which in turn increases the code length.

[1]  Gerhard Fettweis,et al.  On the thresholds of generalized LDPC convolutional codes based on protographs , 2010, 2010 IEEE International Symposium on Information Theory.

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

[3]  Kamil Sh Periodic Time-Varying Convolutional Codes with Low-Density Parity-Check Matrices , 1998 .

[4]  K. Kansanen,et al.  Outage-based LDPC code design for SC/MMSE turbo-equalization , 2005, 2005 IEEE 61st Vehicular Technology Conference.

[5]  Andrew C. Singer,et al.  Turbo equalization: principles and new results , 2002, IEEE Trans. Commun..

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

[7]  Wolfgang Rave,et al.  Application of protograph-based LDPC codes for UWB short range communication , 2010, 2010 IEEE International Conference on Ultra-Wideband.

[8]  Stephan ten Brink,et al.  Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..

[9]  Evangelos Eleftheriou,et al.  Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.

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

[11]  Wolfgang Rave,,et al.  Iterative Equalization and Decoding for Short Range Communication at 60 GHz , 2009 .

[12]  Dariush Divsalar,et al.  Low-rate LDPC codes with simple protograph structure , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

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

[14]  J. Thorpe Low-Density Parity-Check (LDPC) Codes Constructed from Protographs , 2003 .

[15]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[16]  Joachim Hagenauer,et al.  Rate-compatible punctured convolutional codes (RCPC codes) and their applications , 1988, IEEE Trans. Commun..

[17]  Gianluigi Ferrari,et al.  Chart-based Design of LDPC Codes for Inter-Symbol Interference Channels , 2005 .

[18]  Richard D. Wesel,et al.  Construction of irregular LDPC codes with low error floors , 2003, IEEE International Conference on Communications, 2003. ICC '03..