Path Metric Range and LLR-Based Design of Polar Codes and PAC Codes for SCL Decoding

IF 3.7 3区 计算机科学 Q2 TELECOMMUNICATIONS
Rongchi Xu;Hao Chen;Ling Liu;Baoming Bai
{"title":"Path Metric Range and LLR-Based Design of Polar Codes and PAC Codes for SCL Decoding","authors":"Rongchi Xu;Hao Chen;Ling Liu;Baoming Bai","doi":"10.1109/LCOMM.2024.3516939","DOIUrl":null,"url":null,"abstract":"Polar codes and polarization-adjusted convolutional (PAC) codes can achieve good performance with successive cancellation list (SCL) decoding. When constructed by the Reed-Muller rate profile, the rate of PAC code is limited, and its performance is not competitive for large block lengths under the SCL decoder with small or modest list sizes. How to design optimal polar codes and PAC codes for SCL decoding are still open problems. In this letter, we analyse the probability of the correct path in the list according to the path metric in SCL decoding. We calculate the path metric range and log-likelihood ratio of each sub-channel. Then we select the frozen bits to maximize the probability of the correct path in the list. Simulation results show that the proposed polar codes and PAC codes have better performance compared with other advanced constructions at a wide range of code rates and block lengths.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 2","pages":"338-342"},"PeriodicalIF":3.7000,"publicationDate":"2024-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Communications Letters","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10798619/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Polar codes and polarization-adjusted convolutional (PAC) codes can achieve good performance with successive cancellation list (SCL) decoding. When constructed by the Reed-Muller rate profile, the rate of PAC code is limited, and its performance is not competitive for large block lengths under the SCL decoder with small or modest list sizes. How to design optimal polar codes and PAC codes for SCL decoding are still open problems. In this letter, we analyse the probability of the correct path in the list according to the path metric in SCL decoding. We calculate the path metric range and log-likelihood ratio of each sub-channel. Then we select the frozen bits to maximize the probability of the correct path in the list. Simulation results show that the proposed polar codes and PAC codes have better performance compared with other advanced constructions at a wide range of code rates and block lengths.
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Communications Letters
IEEE Communications Letters 工程技术-电信学
CiteScore
8.10
自引率
7.30%
发文量
590
审稿时长
2.8 months
期刊介绍: The IEEE Communications Letters publishes short papers in a rapid publication cycle on advances in the state-of-the-art of communication over different media and channels including wire, underground, waveguide, optical fiber, and storage channels. Both theoretical contributions (including new techniques, concepts, and analyses) and practical contributions (including system experiments and prototypes, and new applications) are encouraged. This journal focuses on the physical layer and the link layer of communication systems.
×
引用
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学术官方微信