Design of F-L-QC-LDPC Decoder Based on LNMS Decoding Algorithm

Low Density Parity Check Code (LDPC) can meet the decoding requirements of a variety of code lengths and rates in different communication scenarios, but the LDPC code check matrix is irregular, which has problems with difficult storage and reading of the check matrix and high coding complexity. For the decoding requirements of multi-code length, this paper proposes a Quasi Crystal Low Density Parity Check Codes (QCLDPC) code based on Fibonacci Lucas sequence, which can obtain the codewords with different code length and code rate by changing the number of rows and columns of the exponential matrix. In terms of decoding algorithms, the Layered Non-Maximum Suppression (LNMS) decoding algorithm, which combines the minimum sum decoding algorithm with the layered algorithm, is proposed to improve the convergence speed of decoding iteration and decoder throughput. Through simulation and comparative experiments, it is proved that this design can support a variety of bit rates, block lengths and sub matrix sizes, and meet the requirements of high throughput and low complexity decoder in modern communication systems.