A reduced complexity decoding algorithm for NB-LDPC codes

2017 IEEE 17th International Conference on Communication Technology (ICCT) Pub Date : 2017-10-01 DOI:10.1109/ICCT.2017.8359617

Suwen Song, Jun Lin, Jing Tian, Zhongfeng Wang

{"title":"A reduced complexity decoding algorithm for NB-LDPC codes","authors":"Suwen Song, Jun Lin, Jing Tian, Zhongfeng Wang","doi":"10.1109/ICCT.2017.8359617","DOIUrl":null,"url":null,"abstract":"Non-binary low-density parity-check (NB-LDPC) codes perform much better than their binary counterparts, when codeword length is moderate or high-order modulation is used. However, the implementation of a NB-LDPC decoder usually suffers from excessive hardware complexity and large memory requirement. Many new algorithms and decoding schedules have been introduced in recent literatures to reduce the decoding complexity in further. However, the complexity of current decoding algorithms for NB-LDPC codes is still high. In this paper, a two-extra-column trellis min-sum algorithm (TEC-TMSA) is proposed. The TEC-TMSA combines the two-extra-column method and the trellis min-sum algorithm in an intelligent way. Since only the minimum value of a row needs to be sorted out for configuration constructions, the computational complexity of the proposed TEC-TMSA is much lower than that of the TMSA. Furthermore, we develop a novel location-fixed selection scheme, which significantly decreases the number of required comparison operations in the TEC-TMSA with negligible performance loss.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCT.2017.8359617","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

Abstract

Non-binary low-density parity-check (NB-LDPC) codes perform much better than their binary counterparts, when codeword length is moderate or high-order modulation is used. However, the implementation of a NB-LDPC decoder usually suffers from excessive hardware complexity and large memory requirement. Many new algorithms and decoding schedules have been introduced in recent literatures to reduce the decoding complexity in further. However, the complexity of current decoding algorithms for NB-LDPC codes is still high. In this paper, a two-extra-column trellis min-sum algorithm (TEC-TMSA) is proposed. The TEC-TMSA combines the two-extra-column method and the trellis min-sum algorithm in an intelligent way. Since only the minimum value of a row needs to be sorted out for configuration constructions, the computational complexity of the proposed TEC-TMSA is much lower than that of the TMSA. Furthermore, we develop a novel location-fixed selection scheme, which significantly decreases the number of required comparison operations in the TEC-TMSA with negligible performance loss.

查看原文本刊更多论文

一种降低NB-LDPC码复杂度的译码算法

当码字长度适中或使用高阶调制时，非二进制低密度奇偶校验(NB-LDPC)码的性能要比二进制码好得多。然而，NB-LDPC解码器的实现通常存在硬件复杂性和内存需求过大的问题。为了进一步降低码流的解码复杂度，近年来文献中提出了许多新的算法和译码方案。但是，目前NB-LDPC码解码算法的复杂度仍然很高。本文提出了一种两列外网格最小和算法(TEC-TMSA)。TEC-TMSA巧妙地结合了两列外法和网格最小和算法。由于构造组态只需要对一行的最小值进行排序，因此所提出的TEC-TMSA的计算复杂度远低于TMSA。此外，我们开发了一种新的位置固定选择方案，该方案显著减少了TEC-TMSA中所需的比较操作次数，而性能损失可以忽略不计。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2017 IEEE 17th International Conference on Communication Technology (ICCT)

自引率

0.00%

发文量