| 一种具有最小距离下界的正则LDPC码的构造 |
| |
| 引用本文： | 王娟,王中训,朱方强,刘丽.一种具有最小距离下界的正则LDPC码的构造[J].电视技术,2012,36(1):86-88. |
| |
| 作者姓名： | 王娟 王中训 朱方强 刘丽 |
| |
| 作者单位： | 烟台大学,光电信息科学技术学院,山东烟台264005 |
| |
| 基金项目： | 山东省自然科学基金项目 |
| |
| 摘 要： | 主要提出一种新的计算规则LDPC(low-density parity-check)码的最小距离下界的方法。该方法是基于LDPC码的每个变量节点的独立树进行构造LDPC码。与随机构造的LDPC码和用PEG方法构造的方法比较,这个新的构造方法得到了更大的围长和最小距离下界。在AWGN信道中,在码长N=1 008和N=1 512时进行Matlab仿真,仿真结果表明随着信噪比的增加此方法构造的LDPC码有优异的误码率性能。
|
| 关 键 词： | 低密度校验码(LDPC码) 最小距离 PEG算法 独立树 迭代译码算法 |
Construction of Regular LDPC Codes with Lower Bounds on the Minimum Distance |
| |
| WANG Juan,WANG Zhongxun,ZHU Fangqiang,LIU Li.Construction of Regular LDPC Codes with Lower Bounds on the Minimum Distance[J].Tv Engineering,2012,36(1):86-88. |
| |
| Authors: | WANG Juan WANG Zhongxun ZHU Fangqiang LIU Li |
| |
| Affiliation: | (Institute of Science and Technology for Opto-electronics Information,Yantai University,Shandong Yantai 264005,China) |
| |
| Abstract: | A new method to get lower bound on the minimum distance of regular LDPC codes is presented in this paper.This method,LDPC code is constructed based on indenpendent tree of each variable node in LDPC code.Compared with the random LDPC codes and PEG codes,the LDPC codes constructed in this method result in greater girth and lower bound on the minimum distance.Using the Matlab to simulate,in the AWGN channel,when the length of the codes is 1 008 and 1 512.Simulation results show that new independent tree-based LDPC codes perform the best as the signal-to-noise ration increases. |
| |
| Keywords: | LDPC codes minimum distance PEG algorithm independent tree iterative decoder |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
