Construction Methods Based on Minimum Weight Distribution for Polar Codes With Successive Cancellation List Decoding

IF 8.3 2区 计算机科学 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC IEEE Transactions on Communications Pub Date : 2024-09-11 DOI:10.1109/TCOMM.2024.3458081
Jinnan Piao;Dong Li;Jindi Liu;Xueting Yu;Zhibo Li;Ming Yang;Peng Zeng
{"title":"Construction Methods Based on Minimum Weight Distribution for Polar Codes With Successive Cancellation List Decoding","authors":"Jinnan Piao;Dong Li;Jindi Liu;Xueting Yu;Zhibo Li;Ming Yang;Peng Zeng","doi":"10.1109/TCOMM.2024.3458081","DOIUrl":null,"url":null,"abstract":"Minimum weight distribution (MWD) is an important metric to calculate the first term of union bound called minimum weight union bound (MWUB). In this paper, we first prove the maximum likelihood (ML) performance approaches MWUB as signal-to-noise ratio (SNR) goes to infinity and provide the deviation when MWD and SNR are given. Then, we propose a nested reliability sequence, namely MWD sequence, to construct polar codes independently of channel information. In the sequence, synthetic channels are sorted by partial MWD which is used to evaluate the influence of information bit on MWD and we prove the MWD sequence is the optimum sequence evaluated by MWUB for polar codes obeying partial order. Finally, we introduce an entropy constraint to establish a relationship between list size and MWUB and propose a heuristic construction method named entropy constraint bit-swapping (ECBS) algorithm, where we initialize information set by the MWD sequence and gradually swap information bit and frozen bit to satisfy the entropy constraint. The simulation results show the MWD sequence is more suitable for constructing polar codes with short code length than the polar sequence in 5G and the ECBS algorithm can improve MWD to show better performance as list size increases.","PeriodicalId":13041,"journal":{"name":"IEEE Transactions on Communications","volume":"73 3","pages":"1444-1457"},"PeriodicalIF":8.3000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Communications","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10677464/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

Minimum weight distribution (MWD) is an important metric to calculate the first term of union bound called minimum weight union bound (MWUB). In this paper, we first prove the maximum likelihood (ML) performance approaches MWUB as signal-to-noise ratio (SNR) goes to infinity and provide the deviation when MWD and SNR are given. Then, we propose a nested reliability sequence, namely MWD sequence, to construct polar codes independently of channel information. In the sequence, synthetic channels are sorted by partial MWD which is used to evaluate the influence of information bit on MWD and we prove the MWD sequence is the optimum sequence evaluated by MWUB for polar codes obeying partial order. Finally, we introduce an entropy constraint to establish a relationship between list size and MWUB and propose a heuristic construction method named entropy constraint bit-swapping (ECBS) algorithm, where we initialize information set by the MWD sequence and gradually swap information bit and frozen bit to satisfy the entropy constraint. The simulation results show the MWD sequence is more suitable for constructing polar codes with short code length than the polar sequence in 5G and the ECBS algorithm can improve MWD to show better performance as list size increases.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于最小权值分布的极性编码连续消隐列表解码构建方法
最小权值分布(MWD)是计算联合界第一项即最小权值联合界的重要度量。本文首先证明了信噪比(SNR)趋于无穷大时的最大似然(ML)性能接近MWUB,并给出了信噪比和信噪比给定时的偏差。然后,我们提出了一个嵌套的可靠性序列,即MWD序列,来构建独立于信道信息的极性码。在该序列中,合成信道按偏MWD排序,并利用偏MWD来评价信息位对MWD的影响,证明了该MWD序列是服从偏序极性码的最优MWUB评价序列。最后,我们引入熵约束来建立列表大小与MWUB之间的关系,并提出了一种启发式构造方法——熵约束比特交换(ECBS)算法,即初始化MWD序列设置的信息,逐步交换信息位和冻结位以满足熵约束。仿真结果表明,在5G环境下,MWD序列比极性序列更适合构建码长较短的极性编码,并且随着列表大小的增加,ECBS算法可以对MWD进行改进,显示出更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Communications
IEEE Transactions on Communications 工程技术-电信学
CiteScore
16.10
自引率
8.40%
发文量
528
审稿时长
4.1 months
期刊介绍: The IEEE Transactions on Communications is dedicated to publishing high-quality manuscripts that showcase advancements in the state-of-the-art of telecommunications. Our scope encompasses all aspects of telecommunications, including telephone, telegraphy, facsimile, and television, facilitated by electromagnetic propagation methods such as radio, wire, aerial, underground, coaxial, and submarine cables, as well as waveguides, communication satellites, and lasers. We cover telecommunications in various settings, including marine, aeronautical, space, and fixed station services, addressing topics such as repeaters, radio relaying, signal storage, regeneration, error detection and correction, multiplexing, carrier techniques, communication switching systems, data communications, and communication theory. Join us in advancing the field of telecommunications through groundbreaking research and innovation.
期刊最新文献
Measurement-Driven Cluster Power Generation Method for A Hybrid A2G Channel Model Utility-oriented Rate-Splitting Multiple Access for Multi-Type Services in Satellite-Integrated Internet Theoretical Analysis of Multi-Coding with Arbitrary Correlations Among the Codes Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing Adaptive Inter-orbital LEO Satellite THz Communication Under Satellite Position and Attitude Disturbances
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1