一种改进的准循环LDPC码环消除算法

doi:10.3969/j.issn.1001-2400.2010.04.021

J4 ›› 2010, Vol. 37 ›› Issue (4): 700-704.doi: 10.3969/j.issn.1001-2400.2010.04.021

一种改进的准循环LDPC码环消除算法

崔俊云;白宝明;郭旭东

(西安电子科技大学综合业务网理论及关键技术国家重点实验室，陕西西安 710071)

收稿日期:2009-06-24 出版日期:2010-08-20 发布日期:2010-10-11
作者简介:崔俊云(1984-)，女，西安电子科技大学博士研究生，E-mail: 02044027@163.com．
基金资助:
国家自然科学基金资助项目(U0635003, 60532060);长江学者和创新团队发展计划资助项目(IRT0852)

Improved cycle elimination algorithm for construction of QC-LDPC codes

CUI Jun-yun;BAI Bao-ming;GUO Xu-dong

(State Key Lab. of Integrated Service Networks, Xidian Univ., Xi'an 710071， China)

Received:2009-06-24 Online:2010-08-20 Published:2010-10-11

摘要/Abstract

摘要：

通过推广Yang， Liu 和Shi给出的从基矩阵到校验矩阵的环扩展约束条件，提出了一种大围长准循环LDPC码的构造算法．该算法改善了环消除算法的局部围长分布，获得了更好的纠错性能．仿真结果表明，在80次迭代置信传播译码下，采用本算法构造的1/2码率非规则LDPC码在E_b/N₀为1.5dB时，误码率为2×10^-6．

关键词: 围长, 准循环LDPC码, 环消除

Abstract:

A novel construction algorithm for quasi-cyclic low-density parity-check codes is proposed, with which we can obtain the improved girth of the corresponding Tanner graph by generalizing Yang et al.'s constraint for any cycle detected in the base matrix to detect and break the cycles in the parity check matrix. Compared with the existing cycle elimination (CE) algorithm, a better error performance can be achieved and cycle-8 free. Simulation results show that the proposed algorithm for constructing the irregular LDPC code of rate 1/2 achieves the performance of codeword error rate of 2×10^-6 at E_b/N₀=1.5dB with 80 iterations by the belief-propagation decoding algorithm.

Key words: girth, quasi-cyclic low-density parity-check (QC-LDPC) codes, cycle elimination

崔俊云;白宝明;郭旭东. 一种改进的准循环LDPC码环消除算法[J]. J4, 2010, 37(4): 700-704.

CUI Jun-yun;BAI Bao-ming;GUO Xu-dong. Improved cycle elimination algorithm for construction of QC-LDPC codes[J]. J4, 2010, 37(4): 700-704.

参考文献

[1] MacKay D J C, Neal R M. Near Shannon Limit Performance of Low Density Parity Check Codes [J]. IEE Electron Lett, 1996, 32(18): 1645-1646.
[2] 童胜, 王鹏, 王单, 等. LDPC 码量化和积译码的高效实现 [J]. 西安电子科技大学学报, 2004, 31(5): 709-713.
Tong Sheng, Wang Peng, Wang Dan, et al. Efficient Implementation of the Sum-product Algorithm for Quantized Decoding of LDPC Codes [J]. Journal of Xidian University, 2004, 31(5): 709-713.
[3] Chung S Y, Forney G D Jr, Richardson T J, et al. On the Design of Low-density Parity Check Codes Within 0.0045dB of the Shannon Limit [J]. IEEE Communications Letters, 2001, 5(2): 58-60.
[4] 刘原华, 王新梅, 胡树楷, 等. 一种改进的卷积LDPC 码置信传播译码算法 [J]. 西安电子科技大学学报, 2009, 36(3): 424-427.
Liu Yuanhua, Wang Xinmei, Hu Shukai et al. An Improved Belief Propagation Algorithm for Decoding of Convolutional LDPC Codes [J]. Journal of Xidian University, 2009, 36(3): 424-427.
[5] Liu Y, Wang X, Chen R, et al. Generalized Combing Method for Design of Quasi-cyclic LDPC Codes [J]. IEEE Commun Lett, 2008, 12(5): 1-3.
[6] LAN/MAN Standards Committee of the IEEE Computer Society. IEEE Std 802.16eTM-2005 and IEEE Std 802.16TM-2004/Cor1-2005 Part 16: Air Interface for Fixed and Mobile Broadband Wireless Access Systems [S]. USA: Institute of Electrical and Electronics Engineers, Inc, 2006.
[7] European Telecommunications Standards Institute (ETSI). Draft ETSI EN 302 307 V 1.1.1. Digital Video Broadcasting (DVB) [S]. 650 Route Des Lucioles F-06921 Sophia Antipolis Cedex-France: ETIS, 2004.
[8] Bangerter B, Jacobsen E, Ho M, et al. High-throughput Wireless LAN Air Interface [J]. Intel Technol, 2003(7): 47-57.
[9] Kou Y, Lin S, Fossorier M. Low-density Parity-check Codes Based on Finite Geometries: a Rediscovery and New Results [J]. IEEE Trans on Info Th, 2001, 47(7): 2711-2736.
[10] Yang L, Liu H, Shi C J. Code Construction and FPGA Implementation of a Low-density Parity-check Code Decoder [J]. IEEE Trans on Circuits and Systems, 2006, 53(4): 892-904.
[11] Zhang H, Zhang T. Design of VLSI Implementation-oriented LDPC Codes [C/OL]. [2009-01-12]. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=＆arnumber=1285102＆isnumber=28568.
[12] Myung S, Yang K. A Combining Method of Quasi-cyclic LDPC Codes By the Chinese Remainder Theorem [J]. IEEE Commun Lett, 2005, 9(9): 823-825.
[13] Hu X Y, Eleftheriou E, Arnold D M. Regular and Irregular Progressive Edge-growth Tanner Graphs [J]. IEEE Trans on Inform Theory, 2005, 51(1): 386-398.
[14] Campello J, Modha D S. Extended Bit-filling and LDPC Code Design [C/OL]. [2009-01-12]. http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=00965565.

一种改进的准循环LDPC码环消除算法

Improved cycle elimination algorithm for construction of QC-LDPC codes

PDF (PC)

赞

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 4

Metrics

本文评价

推荐阅读 0

[1]	孙成;徐恒舟;冯丹;白宝明;张玉龙. 可分解的可分组设计构造的LDPC码[J]. 西安电子科技大学学报, 2017, 44(3): 31-35+42.
[2]	徐恒舟;孙成;白宝明. 循环差族构造的多元LDPC码[J]. 西安电子科技大学学报, 2017, 44(1): 6-11+28.
[3]	张国华；王新梅. 一类围长至少为6的QC-LDPC码的存在性[J]. J4, 2011, 38(3): 136-139+149.
[4]	胡家义;王文博. 基于加权图的准循环低密度奇偶校验码构造算法 [J]. J4, 2008, 35(5): 938-941.