.png){kind=icon}
返回
Parallel List Decoding of Convolutional Codes: Algorithm and Implementation
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSI.2017.2695536.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
List decoding is a promising technique for machine type communications (MTC) and other applications that pursue the high-coding gain of convolutional codes. However, there are obstacles that degrade the availability of list decoding. In specific, non-tail-biting list decoding involves high demands of data storage, while tail-biting list decoding requires substantial computational resources to preserve the optimal performance. In this paper, we rethink the parallel list decoder design from the aspects of algorithm and implementation to circumvent the foregoing obstacles. On the one hand, internal relations among the multiple decoding sequences are revealed and leveraged to redesign the non-tail-biting list decoding algorithm, which enables the design to extricate from the massive storage expense. On the other hand, a reliability-ordered initial-state estimator is designed for the tail-biting list decoder, which helps to alleviate the computational burden while retaining the optimal error-correction performance. In conjunction with the optimizations on underlying structures, the proposed list decoder achieves better energy efficiency than existing work under the same coding gain. In the MTC scenario, moreover, the proposed design will be less area consuming than existing schemes to fulfill coding gain enhancement.
Keyword:
List decoding
Viterbi algorithm
non-tailbiting convolutional codes
tailbiting convolutional codes
machine-type communications (MTC)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.2
论文数:
9.8K
被引数:
2.2W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容