| 基于循环迭代的LDPC码环长扩展算法 |
| |
| 引用本文： | 沈良,陈其先,程云鹏,马绪.基于循环迭代的LDPC码环长扩展算法[J].解放军理工大学学报,2010,11(1):1-6. |
| |
| 作者姓名： | 沈良 陈其先 程云鹏 马绪 |
| |
| 作者单位： | 解放军理工大学通信工程学院; |
| |
| 基金项目： | 国家863计划资助项目(2007AA01Z267) |
| |
| 摘 要： | 为了易于DSP的硬件实现,提出了一种简单的较高码率的无4-环准规则LDPC(low-density parity-check)码的母矩阵构造方法,从理论上给出了母矩阵扩展因子L的下限值,并在此基础上通过循环迭代的环长扩展算法,使母矩阵大量的短环得到了消除,并且它们的编码复杂度和码长成线性关系。仿真结果表明,经过环长扩展的LDPC码略好于M ackay的随机构造同码率的码字性能,而比一次扩展的码字有0.4 dB左右的性能增益。采用循环迭代的环长扩展算法非常有利于硬件实现。
|
| 关 键 词： | 直接下三角型LDPC码 环长 循环转置单位矩阵 重叠环 循环迭代算法 |
Girth expanding algorithm for LDPC code based on cyclic iterative |
| |
| SHEN Liang,CHEN Qi-xian,CHENG Yun-peng and MA Xu.Girth expanding algorithm for LDPC code based on cyclic iterative[J].Journal of PLA University of Science and Technology(Natural Science Edition),2010,11(1):1-6. |
| |
| Authors: | SHEN Liang CHEN Qi-xian CHENG Yun-peng and MA Xu |
| |
| Institution: | Institute of Communications Engineering;PLA Univ.of Sci.& Tech.;Nanjing 210007;China |
| |
| Abstract: | A simple method of mother matrices construction without cycle-4s for quasi-regular LDPC codes was presented based on the higher rate for easy hardware implementation by which the lower bound of expanding factor L was given for mother matrices.A large number of short cycles were removed with girth expanding algorithm of cyclic iteration and their encoding complexity was linearly scaled.Simulation results show that this LDPC code with expanded girth performs a little better than the known Mackay LDPC code,and... |
| |
| Keywords: | direct lower triangular LDPC codes girth circulant permutation matrices overlapped cycles cyclic iterative algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《解放军理工大学学报》浏览原始摘要信息 |
| 点击此处可从《解放军理工大学学报》下载免费的PDF全文 |
