.png){kind=icon}
返回
A maximum-likelihood soft-decision sequential decoding algorithm for binary convolutional codes
.png){kind=icon}
PRE
AI
DOI：10.1109/26.983310.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this letter, we present a trellis-based maximum-likelihood soft-decision sequential decoding algorithm (MLSDA) for binary convolutional codes. Simulation results show that, for (2, 1, 6) and (2, 1, 16) codes antipodally transmitted over the AWGN channel, the average computational effort required by the algorithm is several orders of magnitude less than that of the Viterbi algorithm. Also shown via simulations upon the same system models is that, under moderate SNR, the algorithm is about four times faster than the conventional sequential decoding algorithm (i.e., stack algorithm with Fano metric) having comparable bit-error probability.
Keyword:
coding
convolutional codes
decoding
maximum-likelihood
sequential decoding
soft-decision
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
暂无机构信息
引用论文
Prognostic roles of mRNA expression of notch receptors in non-small cell lung cancer.png)
Oncotarget
OAAI
OncotargetIF0
OAAI分享收藏分享收藏 没有更多内容
没有更多内容