A CLASS OF LDPC CODE'S CONSTRUCTION BASED ON AN ITERATIVE RANDOM METHOD  

作　　者：Huang Zhonghu Shen Lianfeng 

机构地区：[1]National Mobile Communication Research Lab, Southeast University, Nanjing 210096, China [2]Institute of Communication Eng., University of Science and Technology of PLA, Nanjing 210007, China

出　　处：《Journal of Electronics(China)》2006年第1期124-127,共4页电子科学学刊（英文版）

基　　金：Supported by the National Natural Science Foundation of China(No.60472053)

摘　　要：This letter gives a random construction for Low Density Parity Check (LDPC) codes, which uses an iterative algorithm to avoid short cycles in the Tanner graph. The construction method has great flexible choice in LDPC code's parameters including codelength, code rate, the least girth of the graph, the weight of column and row in the parity check matrix. The method can be applied to the irregular LDPC codes and strict regular LDPC codes. Systemic codes have many applications in digital communication, so this letter proposes a construction of the generator matrix of systemic LDPC codes from the parity check matrix. Simulations show that the method performs well with iterative decoding.This letter gives a random construction for Low Density Parity Check （LDPC） codes, which uses an iterative algorithm to avoid short cycles in the Tanner graph. The construction method has great flexible choice in LDPC code＇s parameters including codelength, code rate, the least girth of the graph, the weight of column and row in the parity check matrix. The method can be applied to the irregular LDPC codes and strict regular LDPC codes. Systemic codes have many applications in digital communication, so this letter proposes a construction of the generator matrix of systemic LDPC codes from the parity check matrix. Simulations show that the method performs well with iterative decoding.

关 键 词：Low Density Parity Check （LDPC） codes Sum Product Algorithm（SPA） Random construction Algebraic construction Parity check matrix Generator matrix 

分 类 号：TN91[电子电信—通信与信息系统]