High-speed multi-block-row layered decoding for Quasi-cyclic LDPC codes

Xinmiao Zhang, Y. Tai
{"title":"High-speed multi-block-row layered decoding for Quasi-cyclic LDPC codes","authors":"Xinmiao Zhang, Y. Tai","doi":"10.1109/GlobalSIP.2014.7032068","DOIUrl":null,"url":null,"abstract":"Quasi-cyclic low-density parity-check (QC-LDPC) codes are used in numerous digital communication and storage systems. Layered LDPC decoding converges faster. To further increase the throughput, multiple block rows of the QC parity check matrix can be included in a layer. However, the maximum achievable clock frequency of the prior multi-block-row layered decoder is limited by the long critical path. This paper reformulates the involved equations so that the updating of the messages belonging to different block rows in a layer does not depend on any common intrinsic message. This enables the removal of one adder and one routing network from the critical path. As a result, the proposed design can reach substantially higher clock frequency than prior design, and achieves effective throughput-area tradeoff.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GlobalSIP.2014.7032068","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Quasi-cyclic low-density parity-check (QC-LDPC) codes are used in numerous digital communication and storage systems. Layered LDPC decoding converges faster. To further increase the throughput, multiple block rows of the QC parity check matrix can be included in a layer. However, the maximum achievable clock frequency of the prior multi-block-row layered decoder is limited by the long critical path. This paper reformulates the involved equations so that the updating of the messages belonging to different block rows in a layer does not depend on any common intrinsic message. This enables the removal of one adder and one routing network from the critical path. As a result, the proposed design can reach substantially higher clock frequency than prior design, and achieves effective throughput-area tradeoff.
准循环LDPC码的高速多块行分层解码
准循环低密度奇偶校验(QC-LDPC)码广泛应用于数字通信和存储系统中。分层LDPC解码收敛速度更快。为了进一步提高吞吐量,可以在一个层中包含多个QC奇偶校验矩阵的块行。然而,现有的多块行分层解码器的最大时钟频率受到长关键路径的限制。本文对所涉及的方程进行了重新表述,使得同一层中属于不同块行的消息的更新不依赖于任何共同的固有消息。这允许从关键路径中删除一个加法器和一个路由网络。因此,所提出的设计可以达到比先前设计高得多的时钟频率,并实现有效的吞吐量面积权衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信