.png){kind=icon}
返回
Improved Random Redundant Iterative HDPC Decoding
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2009.07.070621.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
An iterative algorithm for soft-input soft-output (SISO) decoding of classical algebraic cyclic block codes is presented below. Inspired by other approaches for high performance belief propagation (BP) decoding, this algorithm requires up to 10 times less computational complexity than other methods that achieve similar performance. By utilizing multiple BP decoders, and using random permutation taken from the permutation group of the code, this algorithm reaches near maximum likelihood performance. A computational complexity comparison of the proposed algorithm versus other methods is presented as well. This includes complexity versus performance analysis, allowing one to trade between the former and the latter, according to ones needs.
Keyword:
Iterative decoding
soft-decision decoding
permutation group
message-passing algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
Redox Titration of All Electron Carriers of Cytochrome c Oxidase by Fourier Transform Infrared Spectroscopy.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏分享收藏Reduced complexity iterative decoding of low-density parity check codes based on belief propagation基于置信传播的低密度奇偶校验码迭代译码复杂度降低
PREAI
分享收藏 没有更多内容
没有更多内容