计算机工程2011，Vol.37Issue(13)：83-85,88,4.DOI:10.3969/j.issn.1000-3428.2011.13.026
一种低复杂度的准循环LDPC码构造
Construction of Quasi-cycle Low-density Parity-check Codes with Low Complexity Degree
摘要
Abstract
Based on the structure of parity-check matrix of RU algorithm, a class of Quasi-cycle Low-density Parity-check (QC-LDPC) codes with complexity O(n) is constructed by selecting sub-matrices reasonably to restrict φ-1 and T-1 consisting of lower dual diagonal matrices.Simulation results show that not only the proposed codes have lower complexity, but also the error-correcting performance is better than QC-LDPC codes randomly constructed and practical BIock-LDPC codes in the additive white Gaussion noise channel.It can get 0.3 dB Signal to Noise Ratio(SNR) gain at a Bit Error Pate(BRE) of 10-6.关键词
循环置换矩阵/高效编码/准循环低密度奇偶校验码/信噪比增益Key words
circulant permutation matrix/ efficient encoding/ Quasi-cycle Low-density Parity-check(QC-LDPC) codes/ Signal to Noise Ratio (SNR) gain分类
信息技术与安全科学引用本文复制引用
彭世章,赵泽茂,包建荣,曹海燕..一种低复杂度的准循环LDPC码构造[J].计算机工程,2011,37(13):83-85,88,4.基金项目
国家自然科学基金委员会与中国工程物理研究院联合基金资助项目(10776007) （10776007）
国家自然科学基金资助项目(61001133) （61001133）
