.png){kind=icon}
返回
A Low-Complexity Maximum-Likelihood Decoder for Tail-Biting Convolutional Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2018.2790935.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Due to the growing interest in applying tail-biting convolutional coding techniques in real-time communication systems, fast decoding of tail-biting convolutional codes has become an important research direction. In this paper, a new maximumlikelihood decoder for tail-biting convolutional codes is proposed. It is named bidirectional priority-first search algorithm (BiPFSA) because priority-first search algorithm has been used both in forward and backward directions during decoding. Simulations involving the antipodal transmission of (2, 1, 6) and (2, 1, 12) tail-biting convolutional codes over additive white Gaussian noise channels shows that BiPFSA not only has the least average decoding complexity among the state-of-the-art decoding algorithms for tail-biting convolutional codes but can also provide a highly stable decoding complexity with respect to growing information length and code constraint length. More strikingly, at high SNR, its average decoding complexity can even approach the ideal benchmark complexity, obtained under a perfect noise-free scenario by any sequential-type decoding. This demonstrates the superiority of BiPFSA in terms of decoding efficiency.
Keyword:
Tail-biting convolutional codes
maximum-likelihood decoding
convolutional codes
viterbi algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
4.1W
机构
引用论文
Prognostic roles of mRNA expression of notch receptors in non-small cell lung cancer.png)
Oncotarget
OAAI
OncotargetIF0
OAAI分享收藏分享收藏分享收藏
查看更多内容