NEW CONSTRUCTIONS OF LDPC CODES BASED ON CIRCULANT PERMUTATION MATRICES FOR AWGN CHANNEL  

作　　者：Song Zixi Zhang Lijun 

机构地区：[1]School of Electronic and Information Engineering,Beijing Jiaotong University

出　　处：《Journal of Electronics(China)》2014年第2期85-91,共7页电子科学学刊（英文版）

基　　金：Supported by the National Natural Science Foundation of China(Nos.61271199,61172022)

摘　　要：Two new design approaches for constructing Low-Density Parity-Check(LDPC) codes are proposed.One is used to design regular Quasi-Cyclic LDPC(QC-LDPC) codes with girth at least 8.The other is used to design irregular LDPC codes.Both of their parity-check matrices are composed of Circulant Permutation Matrices(CPMs).When iteratively decoded with the Sum-Product Algorithm(SPA),these proposed codes exhibit good performances over the AWGN channel.Two new design approaches for constructing Low-Density Parity-Check （LDPC） codes are proposed. One is used to design regular Quasi-Cyclic LDPC （QC-LDPC） codes with girth at least 8. The other is used to design irregular LDPC codes. Both of their parity-check matrices are composed of Circulant Permutation Matrices （CPMs）. When iteratively decoded with the Sum-Product Algorithm （SPA）, these proposed codes exhibit good performances over the AWGN channel.

关 键 词：Circulant Permutation Matrices(CPMs) Euclidean geometry Error floor Irregular LDPC codes Quasi-cyclic 

分 类 号：TN911.22[电子电信—通信与信息系统]