灵活简化的多比特逐次消去列表极地码译码

Haojing Hu, Rongke Liu, Baoping Feng
{"title":"灵活简化的多比特逐次消去列表极地码译码","authors":"Haojing Hu, Rongke Liu, Baoping Feng","doi":"10.1109/SiPS47522.2019.9020375","DOIUrl":null,"url":null,"abstract":"Polar codes, as the first channel code that can provably achieve the channel capacity, have received increasing attention these years. However, in practical application, the decoding of polar codes still has many aspects that need improvement. One of the key bottlenecks of polar codes decoding is the high latency of SC (Successive Cancellation) -based decoding algorithms. As one of the solutions to this problem, many SCL (Successive Cancellation List) decoding algorithms with the multi-bit decision are proposed. Despite of the reduction of decoding latency, the complexity spent for computation and sort of path candidates of these algorithms has significantly increased in contrast with the conventional SCL algorithm. In this paper, we propose a novel SCL decoding algorithm with multi-bit decision for polar codes, named as Flexible and Simplified Multi-bit Successive Cancellation List (FSMSCL) decoding. The proposed algorithm further reduces the latency compared to other existing multi-bit decoding algorithms. On the other hand, we provide different path-splitting schemes for different code blocks to control the complexity of computation and sort of path metrics. In the analysis, the experiment results show that the proposed algorithm has similar FER performance compared to the conventional SCL algorithm but its decoding latency outperforms other peer decoding algorithms with multi-bit decision.","PeriodicalId":256971,"journal":{"name":"2019 IEEE International Workshop on Signal Processing Systems (SiPS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Flexible and Simplified Multi-bit Successive-Cancellation List Decoding for Polar Codes\",\"authors\":\"Haojing Hu, Rongke Liu, Baoping Feng\",\"doi\":\"10.1109/SiPS47522.2019.9020375\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Polar codes, as the first channel code that can provably achieve the channel capacity, have received increasing attention these years. However, in practical application, the decoding of polar codes still has many aspects that need improvement. One of the key bottlenecks of polar codes decoding is the high latency of SC (Successive Cancellation) -based decoding algorithms. As one of the solutions to this problem, many SCL (Successive Cancellation List) decoding algorithms with the multi-bit decision are proposed. Despite of the reduction of decoding latency, the complexity spent for computation and sort of path candidates of these algorithms has significantly increased in contrast with the conventional SCL algorithm. In this paper, we propose a novel SCL decoding algorithm with multi-bit decision for polar codes, named as Flexible and Simplified Multi-bit Successive Cancellation List (FSMSCL) decoding. The proposed algorithm further reduces the latency compared to other existing multi-bit decoding algorithms. On the other hand, we provide different path-splitting schemes for different code blocks to control the complexity of computation and sort of path metrics. In the analysis, the experiment results show that the proposed algorithm has similar FER performance compared to the conventional SCL algorithm but its decoding latency outperforms other peer decoding algorithms with multi-bit decision.\",\"PeriodicalId\":256971,\"journal\":{\"name\":\"2019 IEEE International Workshop on Signal Processing Systems (SiPS)\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE International Workshop on Signal Processing Systems (SiPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SiPS47522.2019.9020375\",\"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 IEEE International Workshop on Signal Processing Systems (SiPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SiPS47522.2019.9020375","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

Polar码作为最早可以证明实现信道容量的信道码,近年来受到越来越多的关注。但是,在实际应用中,极性码的译码还有很多需要改进的地方。基于连续抵消(SC)译码算法的高延迟是极化码译码的关键瓶颈之一。作为解决这一问题的方法之一,提出了许多具有多比特判决的SCL译码算法。尽管减少了解码延迟,但与传统的SCL算法相比,这些算法的计算复杂度和候选路径排序明显增加。本文提出了一种新的具有多比特判决的极性码SCL译码算法,称为灵活简化的多比特连续取消列表(FSMSCL)译码。与现有的多比特译码算法相比,该算法进一步降低了延迟。另一方面,我们为不同的代码块提供了不同的路径分割方案,以控制计算的复杂性和路径度量的种类。在分析中,实验结果表明,该算法与传统的SCL算法相比具有相似的FER性能,但其解码延迟优于其他具有多比特判决的对等解码算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Flexible and Simplified Multi-bit Successive-Cancellation List Decoding for Polar Codes
Polar codes, as the first channel code that can provably achieve the channel capacity, have received increasing attention these years. However, in practical application, the decoding of polar codes still has many aspects that need improvement. One of the key bottlenecks of polar codes decoding is the high latency of SC (Successive Cancellation) -based decoding algorithms. As one of the solutions to this problem, many SCL (Successive Cancellation List) decoding algorithms with the multi-bit decision are proposed. Despite of the reduction of decoding latency, the complexity spent for computation and sort of path candidates of these algorithms has significantly increased in contrast with the conventional SCL algorithm. In this paper, we propose a novel SCL decoding algorithm with multi-bit decision for polar codes, named as Flexible and Simplified Multi-bit Successive Cancellation List (FSMSCL) decoding. The proposed algorithm further reduces the latency compared to other existing multi-bit decoding algorithms. On the other hand, we provide different path-splitting schemes for different code blocks to control the complexity of computation and sort of path metrics. In the analysis, the experiment results show that the proposed algorithm has similar FER performance compared to the conventional SCL algorithm but its decoding latency outperforms other peer decoding algorithms with multi-bit decision.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Memory Reduction through Experience Classification f or Deep Reinforcement Learning with Prioritized Experience Replay Learning to Design Constellation for AWGN Channel Using Auto-Encoders SIR Beam Selector for Amazon Echo Devices Audio Front-End AVX-512 Based Software Decoding for 5G LDPC Codes Pipelined Implementations for Belief Propagation Polar Decoder: From Formula to Hardware
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1