一种基于QCE-PEG的LDPC码构造方法

张桂华; 姬红兵; 欧阳成

doi:10.3724/SP.J.1146.2008.01280

一种基于QCE-PEG的LDPC码构造方法

doi: 10.3724/SP.J.1146.2008.01280

张桂华^{①②;姬红兵},
姬红兵,
欧阳成

基金项目:

跨行业基金(*A24080106DZ01)资助课题

计量
- 文章访问数: 3163
- HTML全文浏览量: 81
- PDF下载量: 694
- 被引次数: 0
出版历程
- 收稿日期: 2008-10-06
- 修回日期: 2009-01-05
- 刊出日期: 2009-08-19

A QCE-PEG-Based Algorithm for LDPC Codes Construction

Zhang Gui-hua^{①②;姬红兵},
Ji Hong-bing,
Ouyang Cheng

摘要

摘要: 为提高LDPC码的实用性，该文提出了一种QCE-PEG校验矩阵构造方法，给出了实现具体步骤和设计实例。该算法将构造过程分解，结合准循环扩展技术和渐进边增长构造方法的优点，既能满足度分布对的需要，又保证了平均围长尽可能大的要求，提高了LDPC编码的速度和性能。仿真结果表明：用该方法设计的中短长度非正则LDPC码，其性能优于渐进边增长方法构造的PEG码，且设计简单，编码快速，便于工程实现，具有良好的应用前景。
- 编码;LDPC码;准循环扩展技术;渐进边增长构造
Abstract: To enable the practicability of the low density parity check codes, a QCE-PEG algorithm is presented, followed by the description of the implementation approach and a design case in detail. The algorithm divides the construction into two processes, combining the Quasi-Cyclic Extension (QCE) method and Progressive Edge-Growth (PEG) technique. It has several advantages such as good degree distribution, long average girth, rapid encoding process and good performance. Simulation result shows that the constructed irregular LDPC codes have good performance, simple and practicable, thus creating good conditions for its wider application.

HTML全文

参考文献(1)

张桂华, 桑会平, 姬红兵. 基于FPGA的Turbo 码译码算法实现 [J]. 系统工程与电子技术, 2008, 30(8): 1584-1587.Zhang Gui-hua, Sang Hui-ping, and Ji Hong-bing.Implementation of Turbo codes decoding algorithm on FPGA.Systems Engineering and Electronics, 2008, 30(8): 1584-1587.[2]张桂华, 张善旭, 李颖. 高吞吐量低存储量的LDPC 码译码器FPGA 实现[J]. 西安电子科技大学学报，2008, 35(3): 427-432.Zhang Gui-hua, Zhang Shan-xu, and Li Ying. FPGAimplementation of a high-throughput memory-efficient LDPCdecoder. Journal of Xidian University, 2008, 35(3): 427-432.[3]Chung Sae-Young, Forney G D, Richardson T J, andUrbanke R. On the design of low-density parity-check codeswithin 0.0045 dB of the Shannon limit [J]. IEEECommunications Letters, 2001, 5(2): 58-60.[4]Zhang Yi-fei and Ryan W E. Structured IRA codes:Performance analysis and construction [J].IEEE Trans. onCommunications.2007, 55(5):837-844[5]Chen Jing-hu, Tanner R M, Zhang Jun tan, and Fossorier MP C. Construction of irregular LDPC codes by quasi-cyclicextension [J].IEEE Trans. on Information Theory.2007,53(4):1479-1483[6]Hu Xiao-yu, Eleftheriou E, and Arnold D M. Regular andirregular progressive edge-growth Tanner graphs [J].IEEETrans. on Information Theory.2005, 51(1):386-398[7]Campello J and Modha D S. Extended bit-filling and LDPCcode design [C]. Proc. IEEE Globecom, San Antonio, TX,Nov. 2001: 985-989.[8]IEEE Standard 802.16 Working Group. IEEE Standard forLocal and Metro Politan Area Networks Part16: AirInterface for Fixed and Mobile Broadband Wireless AccessSystems Amendment2: Physical and Medium Access ControlLayers for Combined Fixed and Mobile Operation in LicensedBands and Corrigendum 1. 2006, Piscataway, NJ: IEEEPress.[9]Yue Guo-sen, Lu Ben, and Wang Xiao-dong. Analysis anddesign of finite-length LDPC codes [J].IEEE Trans. onVehicular Technology.2007, 56(3):1321-1332

施引文献

资源附件(0)

访问统计