ICTACT Journal on Communication Technology

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

A Review On Construction Methods For Regular And Non-Quasi Cyclic LDPC Codes


Affiliations
1 Department of Electronics and Communication Engineering, Mohamed Sathak Engineering College, India
2 Department of Electrical and Electronics Engineering, Syed Ammal Engineering College, India
     

   Subscribe/Renew Journal


Low Density Parity Check (LDPC) codes are one of the most powerful error correction codes available today. Its Shannon capability that closely matches performance and lower decoding complexity has made them the best choice for many wired and wireless applications. This Paper provides an overview of the LDPC codes and compares the Gallager method, the Reed-Solomon-based algebraic method, and the combinatorial Progressive Growth (PEG) method for constructing regular LDPC codes and also Overlapped and Modified overlapped message passing algorithm for Non-Quasi Cyclic(NQC) LDPC codes.

Keywords

Low-Density Parity-Check (LDPC) Codes, Reed-Solomon (RS) Codes, SPA, Tanner Graph, Progressive Edge Growth (PEG), Message Passing, Non-Quasi Cyclic (NQC).
Subscription Login to verify subscription
User
Notifications
Font Size

  • R. Gallager, “Low-Density Parity-Check Codes”, IRE Transactions on Information Theory, Vol. 8, No. 1, pp. 2128, 1962.

  • Shu Lin and Costello, “Error Control Coding”, Pearson Prentice Hall, 2004.

  • Othman O. Khalifa, Sheroz khan, Mohamad Zaid and Muhamad Nawawi, “Performance Evaluation of Low Density Parity Check Codes”, International Journal of Computer Science and Engineering, Vol. 1, No. 4, pp. 6770, 2013.

  • Ivana Djurdjevic, Jun Xu, Khaled Abdel-Ghaffar and Shu Lin, “A Class of Low-Density Parity-Check Codes Constructed Based on Reed-Solomon Codes with Two Information Symbols”, IEEE Communication Letters, Vol. 7, No. 7, pp. 317-319, 2003.

  • C.E. Shannon, “A Mathematical Theory of Communication”, The Bell System Technical Journal, Vol. 27, No. 3, pp. 623-656, 1948.

  • S.Y. Chung, G. D. Forney,T.J. Richardson and R. Urbanke, “On the Design of Low-Density Parity-Check Codes within 0.0045 dB of the Shannon Limit”, IEEE Communication Letters., Vol. 5, No. 3, pp. 58-60, 2001.

  • J. C. MacKay, “Good Error-Correcting Codes Based on very Sparse Matrices”, IEEE Transactions on Information Theory, Vol. 45, No. 2, pp. 399-432, 1999.

  • T. Richardson and R. Urbanke, “Modern Coding Theory”, Cambridge Press, 2003.

  • Angelos D. Liveris, Zixiang Xiong and Costas N. Georghiades, “Compression of Binary Sources with Side Information at the Decoder Using LDPC Codes”, IEEE Communications Letters, Vol. 6, No. 10, pp. 440-442, 2002.

  • Xiao Yu Hu, Evangelos Eleftheriou and Dieter M. Arnold, “Regular and Irregular Progressive Edge-Growth Tanner Graphs”, IEEE Transactions on Information Theory, Vol. 51, No. 1, pp. 386-398, 2005.

  • R.C. Baumann, “Radiation-Induced Soft Errors in Advanced Semiconductor Technologies”, IEEE Transactions on Device and Materials Reliability, Vol. 5, No. 3, pp. 301-316, 2005.

  • M.A. Bajura, Y. Boulghassoul, R. Naseer, S. DasGupta, A.F.Witulski, J. Sondeen, S.D. Stansberry, J. Draper, L.W. Massengill and J.N. Damoulakis, “Models and Algorithmic Limits for an ECC-Based Approach to Hardening Sub-100nm SRAMs”, IEEE Transactions on Nuclear Science, Vol. 54, No. 4, pp. 935-945, 2007.

  • H. Naeimi and A. Dehon, “Fault-Secure Encoder and Decoder for Memory Applications”, Proceedings of IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems, pp. 409-417, 2007.

  • T.Y. Chen, K. Vakilinia, D. Divsalar and R.D. Wesel, “Protograph based Raptor-like LDPC Codes”, IEEE Transactions on Communications, Vol. 63, No. 5, pp. 15221532, 2015.

  • S. Myung, S.I. Park, K.J. Kim, J.Y. Lee, S. Kwon and J. Kim, “Offset and Normalized Min-Sum Algorithms for ATSC 3.0 LDPC Decoder”, IEEE Transactions on Broadcasting, Vol. 63, No. 4, pp. 734-739, 2017.

  • Y. Xu, L. Szczecinski, B. Rong, F. Labeau, D. He, Y. Wu and W. Zhang, “Variable LLR Scaling in Min-Sum decoding for Irregular LDPC Codes”, IEEE Transactions on Broadcasting, Vol. 60, No. 4, pp. 606-613, 2014.

  • F. Alberge, “Min-Sum Decoding of Irregular LDPC Codes with Adaptive Scaling based on Mutual Information”, Proceedings of IEEE International Symposium on Turbo Codes and Iterative Information Processing, pp. 71-75, 2016.


Abstract Views: 193

PDF Views: 0




  • A Review On Construction Methods For Regular And Non-Quasi Cyclic LDPC Codes

Abstract Views: 193  |  PDF Views: 0

Authors

S. Vengatesh Kumar
Department of Electronics and Communication Engineering, Mohamed Sathak Engineering College, India
R. Dhanasekaran
Department of Electrical and Electronics Engineering, Syed Ammal Engineering College, India

Abstract


Low Density Parity Check (LDPC) codes are one of the most powerful error correction codes available today. Its Shannon capability that closely matches performance and lower decoding complexity has made them the best choice for many wired and wireless applications. This Paper provides an overview of the LDPC codes and compares the Gallager method, the Reed-Solomon-based algebraic method, and the combinatorial Progressive Growth (PEG) method for constructing regular LDPC codes and also Overlapped and Modified overlapped message passing algorithm for Non-Quasi Cyclic(NQC) LDPC codes.

Keywords


Low-Density Parity-Check (LDPC) Codes, Reed-Solomon (RS) Codes, SPA, Tanner Graph, Progressive Edge Growth (PEG), Message Passing, Non-Quasi Cyclic (NQC).

References