Analysis and design of low density parity check codes for non-coherent block fading channels

This paper derives an iterative receiver for noncoherent fading channels that exhibit block fading with correlation between blocks. Pilot symbols and Kalman smoothing are used in conjunction with sum-product decoding of LDPC codes to implement an iterative channel estimation and decoding structure. Density evolution is employed to analyze the performance of such a structure and to optimize the degree profile of LDPC codes. The resulting receiver performs significantly better than receivers in which channel estimation and decoding are carried out in a tandem (non-iterative) fashion

[1]  Wayne E. Stark,et al.  Channels with block interference , 1984, IEEE Trans. Inf. Theory.

[2]  H. Loeliger,et al.  Least Squares and Kalman Filtering on Forney Graphs , 2002 .

[3]  Upamanyu Madhow,et al.  Joint noncoherent demodulation and decoding for the block fading channel: a practical framework for approaching Shannon capacity , 2003, IEEE Trans. Commun..

[4]  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.

[5]  Achilleas Anastasopoulos,et al.  Analysis and design of LDPC codes for time-selective complex-fading channels , 2005, IEEE Transactions on Wireless Communications.

[6]  Yindi Jing,et al.  Design of fully diverse multiple-antenna codes based on Sp(2) , 2004, IEEE Transactions on Information Theory.

[7]  Frank R. Kschischang,et al.  Designing good LDPC codes for markov-modulated channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[8]  James A. Ritcey,et al.  Iterative Channel Estimation and LDPC Decoding over Flat-Fading Channels: A Factor Graph Approach , 2003 .

[9]  Andrew W. Eckford,et al.  Analysis of Joint Channel Estimation and LDPC Decoding on Block Fading Channels , 2004 .

[10]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

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

[12]  Frédérique E. Oggier,et al.  Perfect Space–Time Block Codes , 2006, IEEE Transactions on Information Theory.

[13]  Wayne E. Stark,et al.  Unified design of iterative receivers using factor graphs , 2001, IEEE Trans. Inf. Theory.

[14]  Babak Hassibi,et al.  Representation theory for high-rate multiple-antenna code design , 2001, IEEE Trans. Inf. Theory.

[15]  Andrew W. Eckford,et al.  Analysis of LDPC decoding for correlated and uncorrelated block fading channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[16]  B. Sundar Rajan,et al.  Full-diversity, high-rate space-time block codes from division algebras , 2003, IEEE Trans. Inf. Theory.

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

[18]  Frank R. Kschischang,et al.  Analysis of low-density parity-check codes for the Gilbert-Elliott channel , 2005, IEEE Transactions on Information Theory.

[19]  G. Forney,et al.  Codes on graphs: normal realizations , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[20]  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..

[21]  Teng Li,et al.  Capacity and coding for flat fading channels without channel state information , 2005, IEEE Wireless Communications and Networking Conference, 2005.