逐次取消表译码下crc级联极化码的错误检测策略

Alexander Sauter, B. Matuz, G. Liva
{"title":"逐次取消表译码下crc级联极化码的错误检测策略","authors":"Alexander Sauter, B. Matuz, G. Liva","doi":"10.1109/CISS56502.2023.10089769","DOIUrl":null,"url":null,"abstract":"In this work we introduce a framework to study the trade-off between the undetected error rate (UER) and overall frame error rate (FER) of CRC-concatenated polar codes in the short blocklength regime. Three approaches to improve the tradeoff under successive cancellation list (SCL) decoding are outlined. Two techniques are based on the optimum threshold test introduced by Forney in 1968, whereas a third technique partitions the CRC code parity bits in two sets, where one set is used to prune the SCL decoder list, and the other set is used for error detection. The performance of the three schemes is analyzed via Monte Carlo simulations, and compared with a finite-length achievability bound based on Forney's random coding bound.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Error Detection Strategies for CRC-Concatenated Polar Codes under Successive Cancellation List Decoding\",\"authors\":\"Alexander Sauter, B. Matuz, G. Liva\",\"doi\":\"10.1109/CISS56502.2023.10089769\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work we introduce a framework to study the trade-off between the undetected error rate (UER) and overall frame error rate (FER) of CRC-concatenated polar codes in the short blocklength regime. Three approaches to improve the tradeoff under successive cancellation list (SCL) decoding are outlined. Two techniques are based on the optimum threshold test introduced by Forney in 1968, whereas a third technique partitions the CRC code parity bits in two sets, where one set is used to prune the SCL decoder list, and the other set is used for error detection. The performance of the three schemes is analyzed via Monte Carlo simulations, and compared with a finite-length achievability bound based on Forney's random coding bound.\",\"PeriodicalId\":243775,\"journal\":{\"name\":\"2023 57th Annual Conference on Information Sciences and Systems (CISS)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-03-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 57th Annual Conference on Information Sciences and Systems (CISS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISS56502.2023.10089769\",\"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 57th Annual Conference on Information Sciences and Systems (CISS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS56502.2023.10089769","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在这项工作中,我们引入了一个框架来研究短块长度体制下crc -连接极性码的未检测错误率(UER)和总帧错误率(FER)之间的权衡。提出了三种改进逐次取消列表(SCL)译码折衷的方法。两种技术基于1968年由Forney引入的最佳阈值测试,而第三种技术将CRC码奇校验位划分为两组,其中一组用于修剪SCL解码器列表,另一组用于错误检测。通过蒙特卡罗仿真分析了三种方案的性能,并与基于Forney随机编码界的有限长度可达性界进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Error Detection Strategies for CRC-Concatenated Polar Codes under Successive Cancellation List Decoding
In this work we introduce a framework to study the trade-off between the undetected error rate (UER) and overall frame error rate (FER) of CRC-concatenated polar codes in the short blocklength regime. Three approaches to improve the tradeoff under successive cancellation list (SCL) decoding are outlined. Two techniques are based on the optimum threshold test introduced by Forney in 1968, whereas a third technique partitions the CRC code parity bits in two sets, where one set is used to prune the SCL decoder list, and the other set is used for error detection. The performance of the three schemes is analyzed via Monte Carlo simulations, and compared with a finite-length achievability bound based on Forney's random coding bound.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信