部分和前瞻的极码的基数-4连续对消译码

Hussein G. H. Hassan, A. Hussien, H. Fahmy
{"title":"部分和前瞻的极码的基数-4连续对消译码","authors":"Hussein G. H. Hassan, A. Hussien, H. Fahmy","doi":"10.1109/ICM.2017.8268893","DOIUrl":null,"url":null,"abstract":"Polar codes have been proposed recently as proven to asymptotically achieve channel capacity for memoryless channels. However, realization of high throughput decoders for large code lengths remains a daunting challenge due to the successive decoding behaviour. With the help of using radix-4 processing units, a special last stage processing unit to decode 4 bits in the same clock and partial sum look ahead technique, this paper proposes a high throughput decoder architecture, which considerably reduces the latency compared to state of the art implementations.","PeriodicalId":115975,"journal":{"name":"2017 29th International Conference on Microelectronics (ICM)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Radix-4 successive cancellation decoding of polar codes with partial sum lookahead\",\"authors\":\"Hussein G. H. Hassan, A. Hussien, H. Fahmy\",\"doi\":\"10.1109/ICM.2017.8268893\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Polar codes have been proposed recently as proven to asymptotically achieve channel capacity for memoryless channels. However, realization of high throughput decoders for large code lengths remains a daunting challenge due to the successive decoding behaviour. With the help of using radix-4 processing units, a special last stage processing unit to decode 4 bits in the same clock and partial sum look ahead technique, this paper proposes a high throughput decoder architecture, which considerably reduces the latency compared to state of the art implementations.\",\"PeriodicalId\":115975,\"journal\":{\"name\":\"2017 29th International Conference on Microelectronics (ICM)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 29th International Conference on Microelectronics (ICM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICM.2017.8268893\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 29th International Conference on Microelectronics (ICM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICM.2017.8268893","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

极性码最近被提出,被证明可以渐近地实现无记忆信道的信道容量。然而,由于连续的解码行为,实现大码长的高吞吐量解码器仍然是一个艰巨的挑战。利用基数-4处理单元(一种特殊的最后阶段处理单元,用于在同一时钟内解码4位)和部分和前瞻性技术,本文提出了一种高吞吐量的解码器架构,与目前的实现相比,该架构大大降低了延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Radix-4 successive cancellation decoding of polar codes with partial sum lookahead
Polar codes have been proposed recently as proven to asymptotically achieve channel capacity for memoryless channels. However, realization of high throughput decoders for large code lengths remains a daunting challenge due to the successive decoding behaviour. With the help of using radix-4 processing units, a special last stage processing unit to decode 4 bits in the same clock and partial sum look ahead technique, this paper proposes a high throughput decoder architecture, which considerably reduces the latency compared to state of the art implementations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信