Capacity-Constrained Rate Profiling Refinement for PAC Codes via Bit Position Reassignment

IF 4.4 3区 计算机科学 Q2 TELECOMMUNICATIONS
Rui Guo;Yulin Wang;Meilin He
{"title":"Capacity-Constrained Rate Profiling Refinement for PAC Codes via Bit Position Reassignment","authors":"Rui Guo;Yulin Wang;Meilin He","doi":"10.1109/LCOMM.2026.3664146","DOIUrl":null,"url":null,"abstract":"Polarization-Adjusted Convolutional (PAC) codes combine the polarization effect of polar codes with the memory structure of convolutional precoding, offering strong error-correcting performance. However, the performance of PAC codes heavily depends on the selection of information set. Existing rate profiling methods such as Reed Muller-Polar (RM-Polar) may inadvertently assign an excessively large information set to low-capacity bit-channels. This tends to result in degraded decoding performance especially when using decoders with small to moderate list sizes. This letter proposes a rate profiling refinement strategy for PAC codes that reassigns certain information and frozen bit positions to better match the underlying channel capacity. Simulation results indicate that the proposed strategy significantly improves the decoding performance of PAC codes over various code rates.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"30 ","pages":"1146-1150"},"PeriodicalIF":4.4000,"publicationDate":"2026-02-12","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/11395178/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Polarization-Adjusted Convolutional (PAC) codes combine the polarization effect of polar codes with the memory structure of convolutional precoding, offering strong error-correcting performance. However, the performance of PAC codes heavily depends on the selection of information set. Existing rate profiling methods such as Reed Muller-Polar (RM-Polar) may inadvertently assign an excessively large information set to low-capacity bit-channels. This tends to result in degraded decoding performance especially when using decoders with small to moderate list sizes. This letter proposes a rate profiling refinement strategy for PAC codes that reassigns certain information and frozen bit positions to better match the underlying channel capacity. Simulation results indicate that the proposed strategy significantly improves the decoding performance of PAC codes over various code rates.
基于位重分配的PAC码容量约束速率分析改进
极化调整卷积码(PAC)将极化码的极化效应与卷积预编码的记忆结构相结合,具有较强的纠错性能。然而,PAC代码的性能在很大程度上取决于信息集的选择。现有的速率分析方法,如Reed Muller-Polar (RM-Polar),可能会不经意地将过大的信息集分配给低容量的位信道。这往往会导致解码性能下降,特别是在使用小到中等列表大小的解码器时。这封信提出了一种PAC代码的速率分析改进策略,该策略可以重新分配某些信息和冻结位,以更好地匹配底层信道容量。仿真结果表明,该策略显著提高了PAC码在不同码率下的译码性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信
小红书