Low Complexity Ldpc Decoding Techniques Based On Integer Reliability

The main object of channel coding is to design the advanced coding/decoding technologies to reach the Shannon limit, with the constraint of energy efficiency, and ultimately to guarantee reliable communications.The discovery of the Low-Density Parity-Check Codes (LDPC) has made this object become available. The LDPC codes and the Turbo codes are one of the most important and practical channel coding techniques in modern coding/decoding areas. The are both capacity-approaching codes. Compared to the turbo codes, the LDPC codes have some advantages:1) they have lower decoding complexity;2)they have faster decoding delay and3) they can obtain flexible practical code rates. The study of the low-complexity and good performance LDPC coding/decoding techniques have become one of the hot research issues in channel coding areas. This article makes a brief description of the LDPC codes in terms of code construction, decoding algorithm and their applications. In particular, we focus on the low-complexity decoding algorithm based on integer reliability. The main novelty and contributions of our work are summarized as follows.We make a brief introduction of the LDPC codes in terms of their development and current research issues. Comparisons are made between the LDPC codes and the Turbo codes;We have described the LDPC code construction, the generation matrix, the parity-check matrix, the Tanner graph and some of their properties;A full-message decoding algorithm based on integer reliability is presented. The presented algorithm has low complexity decoding and low energy consumption. Moreover, it requires a small memory load. System model for this algorithm has been established for further detailed description.