Title :
Circulant search algorithm for the construction of QC-LDPC codes
Author :
Tao, Xiongfei ; Zhou, Xiaofeng ; Feng, Deyu ; Zheng, Lixin
Author_Institution :
Dept. of Electron. Sci. & Technol., Huazhong Univ. of Sci. & Technol., Wuhan, China
Abstract :
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.
Keywords :
AWGN channels; cyclic codes; error statistics; parity check codes; search problems; trees (mathematics); AWGN channel; QC-LDPC codes; bit error rate performance; circulant permutation search algorithm; select-and-discard procedure; tree expansion mechanism; Bit error rate; Complexity theory; Iterative decoding; Simulation; Sparse matrices; Vegetation; QC-LDPC codes; search algorithm; tree expansion;
Conference_Titel :
Broadband Network and Multimedia Technology (IC-BNMT), 2011 4th IEEE International Conference on
Conference_Location :
Shenzhen
Print_ISBN :
978-1-61284-158-8
DOI :
10.1109/ICBNMT.2011.6155922
