.png){kind=icon}
返回
Symbol-by-symbol MAP decoding algorithm for high-rate convolutional codes that use reciprocal dual codes
.png){kind=icon}
PRE
AI
DOI：10.1109/49.661106.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A symbol-by-symbol maximum a posteriori (MAP) decoding algorithm for high-rate convolutional codes applying reciprocal dual convolutional codes Is presented, The advantage of this approach is a reduction of the computational complexity since the number of codewords to consider is decreased. All requirements for iterative decoding schemes are fulfilled. Since tail-biting convolutional codes are equivalent to quasicyclic block codes, the decoding algorithm for truncated or terminated convolutional codes is modified to obtain a soft-in/soft-out decoder for high-rate quasi-cyclic block codes which also uses the dual code because of complexity reasons, Additionally, quasi-cyclic block codes are investigated as component codes for parallel concatenation, Simulation results obtained by iterative decoding are compared with union bounds for maximum likelihood decoding, The results of a search for high-rate quasi-cyclic block codes are given in the Appendix.
Keyword:
convolutional codes
dual codes
iterative decoding
MAP decoding
quasi-cyclic block codes
tail-biting convolutional codes
turbo codes
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
17.2
论文数:
6.4K
被引数:
3.1W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容