欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
校验矩阵拥有大围长对于改善LDPC码的性能有着重要的意义.结构化是提高码实用性的关键.提出一种基于列差搜索算法（Column-Difference Search Algorithm）和步进边增长算法（Progressive Edge Growth Algorithm,PEG）的准循环LDPC码构造方法,可以设计任意围长和码率的QC-LDPC码（称为CP-LDPC码）.利用该码校验矩阵的近似下三角特性,推导出递推编码方法,使得该码编码复杂度与码长成线性关系.仿真结果表明,CP-LDPC码在BER性能上与随机码以及同属QC-LDPC码的Tanner码和Array码相比有明显提高,优于随机码、Tanner码和Array码1.35dB-3.95dB.
英文摘要：
A parity-check matrix H with large girth has important significance to improve the performance of LDPC codes.And the key to the encoder implementation is the algebraic code structure.In this paper,a novel method based on Column-Difference Search Algorithm and Progressive Edge Growth Algorithm is proposed to design Quasi-Cyclic LDPC codes with arbitrary girth and code rate.Due to its almost lower triangular form,CP-LDPC code has linear encoding complexity.The experimental results show that CP-LDPC codes perform better than Tanner codes and Array codes,which are another two classical QC-LDPC codes,and random codes.The code in this paper outperforms random code,Tanner code and Array code by 1.35dB-3.95dB.
同期刊论文项目
同项目期刊论文
期刊信息
位置：