Construction of Quasi-Cyclic LDPC Codes From Prime Fields
Lin Guo-qing①②; Chen Ru-wei③; Wang Xin-mei②; Xiao Guo-zhen②
①School of Automobile, Chang,an University, Xi’an 710064, China; ②State Key Lab of Integrated Services Networks, Xidian University, Xi’an 710071, China; ③School of Mathematics and Computational Science, Guilin University of Electronic Technology, Guilin 541004, China
Abstract：This paper presents a method to construct quasi-cyclic LDPC codes from prime fields. This method is a generalization of a method proposed by Lan et al to construct quasi-cyclic LDPC codes based on finite fields, and gives a much larger class of quasi-cyclic LDPC codes based on prime fields. Simulations show that quasi-cyclic LDPC codes constructed by the proposed method perform well over AWGN channels with iterative decoding.
2010, Vol. 32 
