.png){kind=icon}
返回
Low Complexity Demapping Algorithms for Multilevel Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2011.020411.090497.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In order to reduce the computational complexity of maximum-likelihood symbol estimation (MLSE) demapping of multilevel codes which is based on block partitioning and which produces soft input for a multistage decoding (MSD) process, three different demapping algorithms are proposed. It is theoretically proven that the proposed algorithms can reduce exponentially increasing computational complexity of the MLSE demapping algorithm to a constant complexity (neglecting comparisons). It is shown by extensive simulations for AWGN and Rayleigh fading channels that the proposed low complexity demapping algorithms can achieve near MLSE performance.
Keyword:
Multilevel codes
multistage decoding
maximum likelihood symbol estimation
log likelihood ratio
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
查看更多机构
引用论文
分享收藏Designing seawater RO for clean and fouling RO feed. Desalination experiences with the FilmTec SW30HR-380 and SW30HR-320 elements — technical—economic review.png)
Desalination
DesalinationIF0
PREAI
分享收藏分享收藏 没有更多内容