具有速率匹配的极化调整卷积码的设计

C. Liang, Jin Xu, Wei Zhao, LiGuang Li
{"title":"具有速率匹配的极化调整卷积码的设计","authors":"C. Liang, Jin Xu, Wei Zhao, LiGuang Li","doi":"10.1109/ICCCWorkshops57813.2023.10233770","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a convolution transform design for polarization-adjusted convolutional (PAC) codes with rate matching. The proposed convolution transform is adapted to rate matching patterns. More specifically, bits output from rate profiling but with indices punctured (or shortened) in rate matching do not participate in convolution. Also, the forward convolution transform is extended to the general convolution transform. It is shown that recursive feedback convolution can perform better than the original forward convolution. Simulation results show that PAC codes with the proposed design can perform about $0.1\\sim 0.2\\mathrm{dB}$ better than 5G polar codes at a block error rate of $10^{-4}$.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Designing Polarization-Adjusted Convolutional (PAC) Codes with Rate Matching\",\"authors\":\"C. Liang, Jin Xu, Wei Zhao, LiGuang Li\",\"doi\":\"10.1109/ICCCWorkshops57813.2023.10233770\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a convolution transform design for polarization-adjusted convolutional (PAC) codes with rate matching. The proposed convolution transform is adapted to rate matching patterns. More specifically, bits output from rate profiling but with indices punctured (or shortened) in rate matching do not participate in convolution. Also, the forward convolution transform is extended to the general convolution transform. It is shown that recursive feedback convolution can perform better than the original forward convolution. Simulation results show that PAC codes with the proposed design can perform about $0.1\\\\sim 0.2\\\\mathrm{dB}$ better than 5G polar codes at a block error rate of $10^{-4}$.\",\"PeriodicalId\":201450,\"journal\":{\"name\":\"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-08-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233770\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233770","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种具有速率匹配的极化调整卷积码的卷积变换设计。所提出的卷积变换适用于速率匹配模式。更具体地说,从速率分析中输出的比特,如果索引在速率匹配中被刺穿(或缩短),则不参与卷积。同时,将正卷积变换推广到一般卷积变换。结果表明,递归反馈卷积比原正卷积具有更好的性能。仿真结果表明,在分组错误率为$10^{-4}$的情况下,采用该设计的PAC码比5G极性码的性能提高约$0.1\sim 0.2\math {dB}$。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Designing Polarization-Adjusted Convolutional (PAC) Codes with Rate Matching
In this paper, we propose a convolution transform design for polarization-adjusted convolutional (PAC) codes with rate matching. The proposed convolution transform is adapted to rate matching patterns. More specifically, bits output from rate profiling but with indices punctured (or shortened) in rate matching do not participate in convolution. Also, the forward convolution transform is extended to the general convolution transform. It is shown that recursive feedback convolution can perform better than the original forward convolution. Simulation results show that PAC codes with the proposed design can perform about $0.1\sim 0.2\mathrm{dB}$ better than 5G polar codes at a block error rate of $10^{-4}$.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信