Low-latency software successive cancellation list polar decoder using stage-located copy

Yifei Shen, Chuan Zhang, Junmei Yang, Shunqing Zhang, X. You
{"title":"Low-latency software successive cancellation list polar decoder using stage-located copy","authors":"Yifei Shen, Chuan Zhang, Junmei Yang, Shunqing Zhang, X. You","doi":"10.1109/ICDSP.2016.7868521","DOIUrl":null,"url":null,"abstract":"Successive cancellation list (SCL) decoding for polar codes is promising in data communication. However, in addition to L times complexity of conventional SC, both path selecting and updating result in extra complexity. In detail, the copy of intermediate values suffers from a long latency, especially when list size L is large. In this paper, a stage-located copy algorithm is proposed to avoid copying the same contents in candidate paths, which significantly reduces the processing latency. Furthermore, the resulting data processing speedup increases with code length. For (2048, 1723) polar codes, experimental results have shown that by employing the proposed stage-located copy, throughput of software-based SCL decoder with L = 32 achieves up to 1.1 Mbps throughput with 45% increase compared to the state-of-the-art software SCL decoders.","PeriodicalId":206199,"journal":{"name":"2016 IEEE International Conference on Digital Signal Processing (DSP)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Digital Signal Processing (DSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDSP.2016.7868521","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

Abstract

Successive cancellation list (SCL) decoding for polar codes is promising in data communication. However, in addition to L times complexity of conventional SC, both path selecting and updating result in extra complexity. In detail, the copy of intermediate values suffers from a long latency, especially when list size L is large. In this paper, a stage-located copy algorithm is proposed to avoid copying the same contents in candidate paths, which significantly reduces the processing latency. Furthermore, the resulting data processing speedup increases with code length. For (2048, 1723) polar codes, experimental results have shown that by employing the proposed stage-located copy, throughput of software-based SCL decoder with L = 32 achieves up to 1.1 Mbps throughput with 45% increase compared to the state-of-the-art software SCL decoders.
低延迟软件逐次取消列表极性解码器,采用分段复制
逐次消列译码在数据通信中具有广阔的应用前景。但是,路径选择和路径更新的复杂度都是传统SC的L倍。详细地说,中间值的复制有很长的延迟,特别是当列表大小L很大时。为了避免在候选路径中复制相同的内容,本文提出了一种基于阶段的复制算法,大大降低了处理延迟。此外,所得到的数据处理速度随着代码长度的增加而增加。对于(2048,1723)极性码,实验结果表明,通过采用所提出的阶段定位复制,L = 32的基于软件的SCL解码器的吞吐量达到1.1 Mbps,与最先进的软件SCL解码器相比,吞吐量提高了45%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信