A Noise-Assisted Polar Code Attempt Decoding Algorithm

He Zhanquan, L. Xiaoqing, W. Shusheng, Qian YueZhen
{"title":"A Noise-Assisted Polar Code Attempt Decoding Algorithm","authors":"He Zhanquan, L. Xiaoqing, W. Shusheng, Qian YueZhen","doi":"10.1109/ICCRD51685.2021.9386557","DOIUrl":null,"url":null,"abstract":"Aiming at the characteristics of Polar codes, this paper proposes a noise-assisted Polar code attempt decoding algorithm based on the analysis of frame error rate and bit error rate to improve Polar code decoding performance. The basic principle of the algorithm is that when the encoded data frame is transmitted through the channel, the signal-to-noise ratio is decreased. When the received signal exceeds the decoding capability and cannot be decoded normally, the auxiliary man-made noise is added to make the received signal to have a lower decision probability. The addition of low-power man-made noise will result in further randomization of the region with poor reliability of the original sampled data signal (close to zeros for BPSK modulation), and the bit rollover probability of the higher reliability of the sampled data is smaller. Under this condition, attempt to decode, if check data correct, decode finished, otherwise regenerate man-made noise for the next attempt until the decoding passes or reaches the maximum. This algorithm is a post-compensation processing method for existing algorithms, which play an incremental role.","PeriodicalId":294200,"journal":{"name":"2021 IEEE 13th International Conference on Computer Research and Development (ICCRD)","volume":"45 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 13th International Conference on Computer Research and Development (ICCRD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCRD51685.2021.9386557","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Aiming at the characteristics of Polar codes, this paper proposes a noise-assisted Polar code attempt decoding algorithm based on the analysis of frame error rate and bit error rate to improve Polar code decoding performance. The basic principle of the algorithm is that when the encoded data frame is transmitted through the channel, the signal-to-noise ratio is decreased. When the received signal exceeds the decoding capability and cannot be decoded normally, the auxiliary man-made noise is added to make the received signal to have a lower decision probability. The addition of low-power man-made noise will result in further randomization of the region with poor reliability of the original sampled data signal (close to zeros for BPSK modulation), and the bit rollover probability of the higher reliability of the sampled data is smaller. Under this condition, attempt to decode, if check data correct, decode finished, otherwise regenerate man-made noise for the next attempt until the decoding passes or reaches the maximum. This algorithm is a post-compensation processing method for existing algorithms, which play an incremental role.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种噪声辅助极化码尝试译码算法
针对Polar码的特点,在分析帧错误率和误码率的基础上,提出了一种基于噪声辅助的Polar码尝试译码算法,以提高Polar码的译码性能。该算法的基本原理是当编码后的数据帧通过信道传输时,降低信噪比。当接收信号超过解码能力,无法正常解码时,加入辅助的人为噪声,使接收信号具有较低的决策概率。低功率人为噪声的加入会导致原始采样数据信号可靠性较差的区域(BPSK调制时接近于零)进一步随机化,且采样数据可靠性越高的位翻转概率越小。在这种情况下,尝试解码,如果检查数据正确,解码完成,否则为下一次尝试重新产生人为噪声,直到解码通过或达到最大值。该算法是对现有算法的一种后补偿处理方法,起到增量的作用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
ICCRD 2021 Preface Point Cloud Depth Map and Optical Image Registration Based on Improved RIFT Algorithm ICCRD 2021 Copyright Page ICCRD 2021 Cover Page Robust Nighttime Road Lane Line Detection using Bilateral Filter and SAGC under Challenging Conditions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1