Circulant search algorithm for the construction of QC-LDPC codes
Xiongfei Tao, Xiaofeng Zhou, Deyu Feng, Lixin Zheng · 2011 4th IEEE International Conference on Broadband Network and Multimedia Technology · 2011
A circulant permutation search algorithm is present in this paper, which can be employed to search appopriate circulant permutation to construct QC-LDPC codes with desired girth. The algorithm is based on a tree expansion mechanism and a select-and-discard procedure. By proposed method, a practical (3, 4) code with code length n=37368 and girth g=18 is constructed. The experiment shows that the codes construct in this paper have large girth and minimum distance, and the bit error rate performance over AWGN channels is excellent.