Advanced Search
Volume 32 Issue 8
Sep.  2010
Turn off MathJax
Article Contents
Guo Kun, Hei Yong, Zhou Yu-Mei, Qiao Shu-Shan. A Parallel Layered Decoding Algorithm for Non-layered LDPC Codes[J]. Journal of Electronics & Information Technology, 2010, 32(8): 1956-1960. doi: 10.3724/SP.J.1146.2009.01160
Citation: Guo Kun, Hei Yong, Zhou Yu-Mei, Qiao Shu-Shan. A Parallel Layered Decoding Algorithm for Non-layered LDPC Codes[J]. Journal of Electronics & Information Technology, 2010, 32(8): 1956-1960. doi: 10.3724/SP.J.1146.2009.01160

A Parallel Layered Decoding Algorithm for Non-layered LDPC Codes

doi: 10.3724/SP.J.1146.2009.01160 cstr: 32379.14.SP.J.1146.2009.01160
  • Received Date: 2009-09-02
  • Rev Recd Date: 2009-12-25
  • Publish Date: 2010-08-19
  • As layered algorithm can not be used in the decoding of the non-layered LDPC codes, a Parallel- Layered Belief-Propagation (PLBP) algorithm is proposed in this paper. The decoding of this algorithm is quite different from the original layered algorithm, for it uses parallel updating among all layers and serial updating within each layer. With such a decoding schedule, a variable node in different layers is updated at different time, which means the message is able to be updated layer by layer for each variable node. The simulation shows the PLBP algorithm not only achieves a better error performance, but also requires almost 50% less iterations than the Flooding algorithm with the same complexity. Additionally, a merged computation of the nodes is employed by the PLBP algorithm. As a result, the decoding speed of the PLBP algorithm can reach nearly 4 times as that of the original Flooding algorithm.
  • loading
  • Gallager R G. Low-density parity-check codes[J].IRETransactions on Information Theory.1962, 8(1):21-28[2]MacKay D J C. Good error-correcting codes based on verysparse matrices[J].IEEE Transactions on Information Theory.1999, 45(3):399-431[3]Tanner R M. A recursive approach to low complexity codes.IEEE Transactions on Information Theory, 1981, IT-27(5):399-431.[4]Tehrani S S and Mannor S, et al.. Fully parallel stochasticLDPC decoders[J].IEEE Transactions on Signal Processing.2008, 56(11):5692-5703[5]Park Chang-soo, Kim Seong-woon, and Hwang Sun-young, etal.. Design of a low-area, high-throughput LDPC decoderusing shared memory banks for DVB-S2[J].IEEE Transactionson Consumer Electronics.2009, 55(2):850-854[6]Cocco M, Dielissen J, and Heijligers M, et al.. A scalablearchitecture for LDPC decoding[C]. Proceedings IEEEConference on Design Automation and Test in Europe, Paris,France, Feb. 16-20, 2004, 3: 88-93.[7]Mansour M M and Shanbhag N R. High-throughput LDPCdecoders[J].IEEE Transactions on Very Large Scale IntegrationSystems.2003, 11(6):976-996[8]Mansour M M and Shanbhag N R. A 640-Mb/s 2048-bitprogrammable LDPC decoder chip. IEEE Journal ofSolid-State Circuits, 2006, 41(3): 634-698.[9]Rovini M, Rossi F, and Ciao P, et al.. Layered decoding ofnon-layered LDPC codes[C]. The 9th Euromicro Conferenceon Digital System Design, Dubrovnik, Croatia, Aug.30-Sep.1, 2006: 537-544.[10]Shih Xin-yu.[J].Zhan Cheng-zhou, and Lin Cheng-hung, et al..An 8.29mm2 52mW multi-mode LDPC decoder design formobile WiMax system in 0.13m CMOS process. IEEEJournal of Solid-state Circuits.2008,:43-[11]Dai Yong-mei, Chen Ning, and Yan Zhi-yuan. Memoryefficient decoder architectures for quasi-cyclic LDPC codes[J].IEEE Transactions on Circuits and Systems.2008, 55(9):2898-2911[12]Chen J, Dholakia A, and Eleftheriou E, et al.. Reducedcomplexitydecoding of LDPC codes[J].IEEE Transactions onCommunication.2005, 53(8):1288-1299[13][13] 国家广播电影电视总局广播科学研究院,北京泰美科技有限公司. GY/T 220.1-2006《移动多媒体广播 第1 部分:广播信道帧结构、信道编码和调制》[S]. 北京: 国家广播电影电视总局规划院,2006.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (3764) PDF downloads(1078) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return