.png){kind=icon}
返回
Variable-complexity trellis decoding of binary convolutional codes
.png){kind=icon}
PRE
AI
DOI：10.1109/26.486598.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider trellis decoding of convolutional codes with selectable effort, as measured by decoder complexity. Decoding is described for single parent codes with a variety of complexities, with performance ''near'' that of the optimal fixed receiver complexity coding system. Effective free distance is examined. Criteria are proposed for ranking parent codes, and some codes found to be best according to the criteria are tabulated. Several codes with effective free distance better than the best code of comparable complexity were found. Asymptotic (high SNR) performance analysis and error propagation are discussed. Simulation results are also provided.
Keyword:
SEQUENCE ESTIMATION
DECISION-FEEDBACK
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏 没有更多内容
没有更多内容