Analysis of error correcting capability of LDPC code over fading and non-fading channel under various parameters

The growing demand for voice and multimedia services on wireless communication spur the advancement of efficient error detection and correction coding techniques. The error correcting capability of any encoding technique depends on the number of parity bits added and position, where the parity bits are placed. Low density parity check code having sparse parity check matrix provides the ability to reach near the Shannon limit over the fading and non-fading channel. In this paper, the impact of LDPC Code on the performance of communication system over various channel are analyzed by considering different modulation scheme, Eb/No value, size of signal constellation and code rate. The value of code rate less than or equal to 2/3, LDPC Code acquires the negligible bit error rate regarding the minimum value of Eb/No (8.5 dB) and maximum value of size of signal constellation (16) with PSK modulation scheme. The obtained results are useful to improve the performance and proper utilization of power and bandwidth in wireless communication application.

[1]  Peter Hoeher,et al.  Joint Map Equalization and Channel Estimation for Frequency-selective Fast-fading Channels , 1998 .

[2]  Daniel A. Spielman,et al.  Improved low-density parity-check codes using irregular graphs and belief propagation , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[3]  Aria Nosratinia,et al.  The design of rate-compatible protograph LDPC codes , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[4]  Guoan Bi,et al.  A Survey on Protograph LDPC Codes and Their Applications , 2015, IEEE Communications Surveys & Tutorials.

[5]  Norman C. Beaulieu,et al.  Novel Sum-of-Sinusoids Simulation Models for Rayleigh and Rician Fading Channels , 2006, IEEE Transactions on Wireless Communications.

[6]  Daniel A. Spielman,et al.  Analysis of low density codes and improved designs using irregular graphs , 1998, STOC '98.

[7]  Samuel Dolinar.  A rate-compatible family of protograph-based LDPC codes built by expurgation and lengthening , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

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

[9]  Lajos Hanzo,et al.  EXIT Charts for System Design and Analysis , 2014, IEEE Communications Surveys & Tutorials.

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

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

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

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

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

[15]  Giuseppe Caire,et al.  Variable-rate coding for slowly fading Gaussian multiple-access channels , 2004, IEEE Transactions on Information Theory.

[16]  Gerard Battail.  A Conceptual Framework for Understanding Turbo Codes , 1998, IEEE J. Sel. Areas Commun..

[17]  Aria Nosratinia,et al.  Rate-Compatible Protograph-Based LDPC Codes for Inter-Symbol Interference Channels , 2013, IEEE Communications Letters.

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