(3, L) quasi-cyclic LDPC codes: Simplified exhaustive search and designs
Cheng Sun, Hengzhou Xu, Dan Feng, Baoming Bai · 2016
There exist lots of (3, L)-regular quasi-cyclic (QC) LDPC codes constructed from finite fields, protographs, array codes, and computer search under some design rules. For a given code length and rate, how to select the best one from these codes is considerable. In this paper, we study (3, L)-regular QC LDPC codes from the perspective of graph isomorphism, and non-isomorphic (3, L)-regular QC LDPC codes are determined. By analyzing the cycle structures of the resulting non-isomorphic codes, an efficient algorithm for counting cycles is presented. Also proposed is a simplified exhaustive search of non-isomorphic (3, L)-regular QC LDPC codes free of cycles of length less than g0, where g0is the estimated optimal girth value for a given code length. Based on these two algorithms, we can easily construct a (3, L)-regular QC LDPC code with optimized cycle distribution for a given L and code length. Numerical results show that the constructed codes have better performance under the iterative decoding algorithms.