Novel LDPC code structures for the nonergodic block-fading channels

In this paper we study LDPC code design in block-fading (BF) channels. Our main purpose is to introduce a new Root Check (RC)-LDPC code design which obtains full diversity whilst delivering improved coding gain relative the other LDPC code designs. More specifically, we show that when our codes are combined with the check splitting method for the ARQ BF channels, we obtain the highest coding gain relative to conventional RC-LDPC codes.

[1]  Stephan ten Brink,et al.  Design of low-density parity-check codes for modulation and detection , 2004, IEEE Transactions on Communications.

[2]  J. Boutros.  Diversity and coding gain evolution in graph codes , 2009, 2009 Information Theory and Applications Workshop.

[3]  E. Biglieri,et al.  Design and Analysis of Low-Density Parity-Check Codes for Block-Fading Channels , 2007, 2007 Information Theory and Applications Workshop.

[4]  Deepak Sridhara,et al.  Pseudocodewords of Tanner Graphs , 2005, IEEE Transactions on Information Theory.

[5]  Giuseppe Caire,et al.  Coded modulation in the block-fading channel: coding theorems and code construction , 2006, IEEE Transactions on Information Theory.

[6]  Simon Litsyn,et al.  Analysis of low-density parity-check codes based on EXIT functions , 2006, IEEE Transactions on Communications.

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

[8]  Harry Leib,et al.  Evaluating the performance of convolutional codes over block fading channels , 1999, IEEE Trans. Inf. Theory.

[9]  Ezio Biglieri,et al.  Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels , 2007, IEEE Transactions on Information Theory.

[10]  Paul H. Siegel,et al.  Performance analysis and code optimization of low density parity-check codes on Rayleigh fading channels , 2001, IEEE J. Sel. Areas Commun..

[11]  Lars K. Rasmussen,et al.  Check splitting of root-check LDPC codes over ARQ block-fading channels , 2010, 2010 Australian Communications Theory Workshop (AusCTW).

[12]  F. Kschischang,et al.  Incremental Redundancy via Check Splitting , 2006, 23rd Biennial Symposium on Communications, 2006.

[13]  Richard C. Singleton,et al.  Maximum distance q -nary codes , 1964, IEEE Trans. Inf. Theory.

[14]  Shlomo Shamai,et al.  Information theoretic considerations for cellular mobile radio , 1994 .

[15]  Raymond Knopp,et al.  On coding for block fading channels , 2000, IEEE Trans. Inf. Theory.