极性码的块顺序解码

Grigorii Trofimiuk, P. Trifonov
{"title":"极性码的块顺序解码","authors":"Grigorii Trofimiuk, P. Trifonov","doi":"10.1109/ISWCS.2015.7454356","DOIUrl":null,"url":null,"abstract":"The problem of efficient decoding of polar codes is considered. A modification of the sequential decoding algorithm is proposed. Instead of processing one symbol at each iteration, we perform ML decoding of blocks of symbols using the tree-trellis list Viterbi algorithm. Numeric results show that the proposed approach significantly reduces the average complexity and latency of the sequential decoder without any performance degradation.","PeriodicalId":383105,"journal":{"name":"2015 International Symposium on Wireless Communication Systems (ISWCS)","volume":"214 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Block sequential decoding of polar codes\",\"authors\":\"Grigorii Trofimiuk, P. Trifonov\",\"doi\":\"10.1109/ISWCS.2015.7454356\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of efficient decoding of polar codes is considered. A modification of the sequential decoding algorithm is proposed. Instead of processing one symbol at each iteration, we perform ML decoding of blocks of symbols using the tree-trellis list Viterbi algorithm. Numeric results show that the proposed approach significantly reduces the average complexity and latency of the sequential decoder without any performance degradation.\",\"PeriodicalId\":383105,\"journal\":{\"name\":\"2015 International Symposium on Wireless Communication Systems (ISWCS)\",\"volume\":\"214 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Symposium on Wireless Communication Systems (ISWCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISWCS.2015.7454356\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Symposium on Wireless Communication Systems (ISWCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWCS.2015.7454356","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

研究了极化码的有效译码问题。提出了一种改进的顺序解码算法。我们不是在每次迭代中处理一个符号,而是使用树格列表Viterbi算法对符号块进行ML解码。数值结果表明,该方法在不降低序列解码器性能的前提下,显著降低了序列解码器的平均复杂度和时延。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Block sequential decoding of polar codes
The problem of efficient decoding of polar codes is considered. A modification of the sequential decoding algorithm is proposed. Instead of processing one symbol at each iteration, we perform ML decoding of blocks of symbols using the tree-trellis list Viterbi algorithm. Numeric results show that the proposed approach significantly reduces the average complexity and latency of the sequential decoder without any performance degradation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信