.png){kind=icon}
返回
On low complexity stack decoding of convolutional codes
.png){kind=icon}
PRE
AI
DOI：10.1109/26.768752.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This letter presents techniques for improving the distribution of the number of stack entries, for stack sequential decoding over hard quantized channel, with emphasis on high rate codes. It is shown that, for a class of high rate b/(b + 1) codes, a table-based true high rate approach can be easily implemented for obtaining decoding advantage over the punctured approach. Modified algorithms, which significantly improve the distribution of the number of stack entries and decoding time, are proposed for rate 1/N codes and high rate b/(b + 1) codes.
Keyword:
convolutional codes
sequential decoding
stack algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
暂无机构信息
引用论文
Structural Basis of the Ferrous Iron Specificity of the Yeast Ferroxidase, Fet3p.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏分享收藏
没有更多内容
没有更多内容