首页 | 本学科首页   官方微博 | 高级检索  
     

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
基金项目: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.

关 键 词:低密度奇偶校验码  LDPC  随机结构  SPA算法  奇偶校验矩阵
收稿时间:2005-04-13
修稿时间:2005-05-12

A class of LDPC code’s construction based on an iterative random method
Huang Zhonghu Shen Lianfeng.A class of LDPC code’s construction based on an iterative random method[J].Journal of Electronics,2006,23(1):124-127.
Authors:Zhonghu Huang  Lianfeng Shen
Affiliation:(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
Abstract: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. Supported by the National Natural Science Foundation of China (No.60472053)
Keywords:Low Density Parity Check (LDPC) codes  Sum Product Algorithm(SPA)  Random construction  Algebraic construction  Parity check matrix  Generator matrix
本文献已被 维普 SpringerLink 等数据库收录!
点击此处可从《电子科学学刊(英文版)》浏览原始摘要信息
点击此处可从《电子科学学刊(英文版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号