Design of Binary LDPC Codes With Parallel Vector Message Passing
- 14 December 2017
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 66 (4) , 1363-1375
Abstract
Many studies were carried out for the construction of low density parity-check (LDPC) codes. They usually focused on introducing the construction methods for good LDPC codes instead of a general method for code optimization. This paper proposes a method with high versatility, called the parallel vector message passing-based edge exchange (PMPE), for optimizing a type of graph-based LDPC codes, without changing the code parameters of mother codes such as the code length, code rate and degree distribution.With the approximately nearest codewords (ANC) searching approach, we find the optimization method can increase the Hamming distance of the LDPC codes. For the quasi-cyclic (QC) LDPC codes, an optimization method, called the parallel vector message passing oriented-to the QC-LDPC codes (QC-PMP), is further suggested, with which the quasi-cyclic characteristics of QC-LDPC codes can remain unchanged in the optimization. To evaluate the performance of the parity-check matrix corresponding to a Tanner graph, a very simple metric, the Cycles Metric (CM), is introduced to work with the proposed PMPE and QC-PMP algorithms. The experimental results show that the performance of the LDPC codes optimized with the proposed PMPE can be improved significantly at low BER range compared to the mother codes of the random codes, including the regular MacKay code of rate 0:5 and the regular PEG code of rate 0:9. For the case of the regular and irregular QC-LDPC codes with different code lengths and code rates, the optimized LDPC codes with the proposed QC-PMP algorithm significantly outperform the mother codes.Keywords
Funding Information
- National Natural Science Foundation of China (61572534, 61602531)
This publication has 35 references indexed in Scilit:
- Byte-Reconfigurable LDPC Codec Design With Application to High-Performance ECC of NAND Flash Memory SystemsIEEE Transactions on Circuits and Systems I: Regular Papers, 2015
- Algebraic Quasi-Cyclic LDPC Codes: Construction, Low Error-Floor, Large Girth and a Reduced-Complexity Decoding SchemeIEEE Transactions on Communications, 2014
- Selective Avoidance of Cycles in Irregular LDPC Code ConstructionIEEE Transactions on Communications, 2004
- Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation MatricesIEEE Transactions on Information Theory, 2004
- Finite-length analysis of low-density parity-check codes on the binary erasure channelIEEE Transactions on Information Theory, 2002
- Factor graphs and the sum-product algorithmIEEE Transactions on Information Theory, 2001
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- Near Shannon limit performance of low density paritycheck codesElectronics Letters, 1996
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962