极性码的缩减路径逐次消去列表译码

IF 1.3 Q3 ENGINEERING, MULTIDISCIPLINARY
W. Abdulwahab, A. Kadhim
{"title":"极性码的缩减路径逐次消去列表译码","authors":"W. Abdulwahab, A. Kadhim","doi":"10.46604/IJETI.2021.6376","DOIUrl":null,"url":null,"abstract":"Polar codes have already been adopted in 5G systems to improve error performance. Successive cancellation list (SCL) decoding is usually used at the decoder and involves lengthy processing. Therefore, different methods have been developed to reduce an SCL decoder’s complexity. In this paper, a reduced path successive cancellation list (RP-SCL) decoder is presented to reduce this complexity, where some decoding paths are pruned. The pruning is achieved by using three different thresholds: two for the path metric and one for the pruning depth in the decoding tree. An optimization procedure is considered to determine the optimum settings for these thresholds. The simulation tests are carried out over models of an additive white Gaussian noise channel and a fading channel by using 5G environments. The results reveal that the proposed RP-SCL decoder provides the complexity reduction in terms of the average number of processed paths at high SNR. Additionally, the computational complexity and the memory requirements decrease.","PeriodicalId":43808,"journal":{"name":"International Journal of Engineering and Technology Innovation","volume":null,"pages":null},"PeriodicalIF":1.3000,"publicationDate":"2021-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Reduced Path Successive Cancellation List Decoding for Polar Codes\",\"authors\":\"W. Abdulwahab, A. Kadhim\",\"doi\":\"10.46604/IJETI.2021.6376\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Polar codes have already been adopted in 5G systems to improve error performance. Successive cancellation list (SCL) decoding is usually used at the decoder and involves lengthy processing. Therefore, different methods have been developed to reduce an SCL decoder’s complexity. In this paper, a reduced path successive cancellation list (RP-SCL) decoder is presented to reduce this complexity, where some decoding paths are pruned. The pruning is achieved by using three different thresholds: two for the path metric and one for the pruning depth in the decoding tree. An optimization procedure is considered to determine the optimum settings for these thresholds. The simulation tests are carried out over models of an additive white Gaussian noise channel and a fading channel by using 5G environments. The results reveal that the proposed RP-SCL decoder provides the complexity reduction in terms of the average number of processed paths at high SNR. Additionally, the computational complexity and the memory requirements decrease.\",\"PeriodicalId\":43808,\"journal\":{\"name\":\"International Journal of Engineering and Technology Innovation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.3000,\"publicationDate\":\"2021-01-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Engineering and Technology Innovation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.46604/IJETI.2021.6376\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"ENGINEERING, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Engineering and Technology Innovation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46604/IJETI.2021.6376","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

极化码已经在5G系统中被采用,以提高错误性能。逐次消除列表(SCL)解码通常在解码器处使用,并且涉及漫长的处理。因此,已经开发了不同的方法来降低SCL解码器的复杂性。本文提出了一种减少路径连续消除列表(RP-SCL)解码器来降低这种复杂性,其中一些解码路径被修剪。修剪是通过使用三个不同的阈值来实现的:两个用于路径度量,一个用于解码树中的修剪深度。考虑优化过程来确定这些阈值的最佳设置。利用5G环境对加性高斯白噪声信道和衰落信道模型进行了仿真测试。结果表明,所提出的RP-SCL解码器在高SNR下提供了处理路径的平均数量方面的复杂性降低。此外,降低了计算复杂度和内存需求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Reduced Path Successive Cancellation List Decoding for Polar Codes
Polar codes have already been adopted in 5G systems to improve error performance. Successive cancellation list (SCL) decoding is usually used at the decoder and involves lengthy processing. Therefore, different methods have been developed to reduce an SCL decoder’s complexity. In this paper, a reduced path successive cancellation list (RP-SCL) decoder is presented to reduce this complexity, where some decoding paths are pruned. The pruning is achieved by using three different thresholds: two for the path metric and one for the pruning depth in the decoding tree. An optimization procedure is considered to determine the optimum settings for these thresholds. The simulation tests are carried out over models of an additive white Gaussian noise channel and a fading channel by using 5G environments. The results reveal that the proposed RP-SCL decoder provides the complexity reduction in terms of the average number of processed paths at high SNR. Additionally, the computational complexity and the memory requirements decrease.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.80
自引率
0.00%
发文量
18
审稿时长
12 weeks
期刊介绍: The IJETI journal focus on the field of engineering and technology Innovation. And it publishes original papers including but not limited to the following fields: Automation Engineering Civil Engineering Control Engineering Electric Engineering Electronic Engineering Green Technology Information Engineering Mechanical Engineering Material Engineering Mechatronics and Robotics Engineering Nanotechnology Optic Engineering Sport Science and Technology Innovation Management Other Engineering and Technology Related Topics.
×
引用
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学术官方微信