基于极性的Turbo产品码的近最优解码

Meng Ruan, Ming Jiang, Tao Zou, Yi Sun, Chunming Zhao
{"title":"基于极性的Turbo产品码的近最优解码","authors":"Meng Ruan, Ming Jiang, Tao Zou, Yi Sun, Chunming Zhao","doi":"10.1109/WCSP.2019.8927852","DOIUrl":null,"url":null,"abstract":"In this paper, an efficient decoding algorithm for the turbo product code (TPC) with short-block constituent polar codes (polar-TPC) is proposed. We show that the constituent codes can be either systematic or non-systematic, and they can be decoded in parallel. A flipping-based successive cancellation list (SCL) decoder is employed to decode each constituent code and provide a larger code set, from which extrinsic information can be obtained to update the soft input in the next decoding iteration. Simulation results show that the polar-TPC employing our decoding scheme can outperform the BCH-TPC. This decoding scheme, which is compatible with any SCL decoding based acceleration algorithm, offers an effective solution to decrease the decoding latency of long codes while similar decoding performance can be guaranteed.","PeriodicalId":108635,"journal":{"name":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Near Optimal Decoding of Polar-based Turbo Product Codes\",\"authors\":\"Meng Ruan, Ming Jiang, Tao Zou, Yi Sun, Chunming Zhao\",\"doi\":\"10.1109/WCSP.2019.8927852\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an efficient decoding algorithm for the turbo product code (TPC) with short-block constituent polar codes (polar-TPC) is proposed. We show that the constituent codes can be either systematic or non-systematic, and they can be decoded in parallel. A flipping-based successive cancellation list (SCL) decoder is employed to decode each constituent code and provide a larger code set, from which extrinsic information can be obtained to update the soft input in the next decoding iteration. Simulation results show that the polar-TPC employing our decoding scheme can outperform the BCH-TPC. This decoding scheme, which is compatible with any SCL decoding based acceleration algorithm, offers an effective solution to decrease the decoding latency of long codes while similar decoding performance can be guaranteed.\",\"PeriodicalId\":108635,\"journal\":{\"name\":\"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCSP.2019.8927852\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 11th International Conference on Wireless Communications and Signal Processing (WCSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCSP.2019.8927852","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

提出了一种短块组成极性码(polar-TPC)的高效turbo积码(TPC)译码算法。我们证明了组成码可以是系统码或非系统码,并且它们可以并行解码。采用基于翻转的逐次抵消表(SCL)解码器对各组成码进行译码,并提供更大的码集,从中获取外部信息,以便在下一译码迭代中更新软输入。仿真结果表明,采用该译码方案的polar-TPC优于BCH-TPC。该译码方案兼容任何基于SCL译码的加速算法,在保证译码性能的同时,有效地降低了长码的译码延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Near Optimal Decoding of Polar-based Turbo Product Codes
In this paper, an efficient decoding algorithm for the turbo product code (TPC) with short-block constituent polar codes (polar-TPC) is proposed. We show that the constituent codes can be either systematic or non-systematic, and they can be decoded in parallel. A flipping-based successive cancellation list (SCL) decoder is employed to decode each constituent code and provide a larger code set, from which extrinsic information can be obtained to update the soft input in the next decoding iteration. Simulation results show that the polar-TPC employing our decoding scheme can outperform the BCH-TPC. This decoding scheme, which is compatible with any SCL decoding based acceleration algorithm, offers an effective solution to decrease the decoding latency of long codes while similar decoding performance can be guaranteed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信