.png){kind=icon}
返回
ML Performance Achieving Algorithm With the Zero-Forcing Complexity at High SNR Regime
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2016.2543217.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Although zero-forcing ( ZF) detection is well-known for its low computational complexity in multiple-input multiple-output ( MIMO) communication systems, it suffers from significantly poor performance. The sphere decoder ( SD) method, on the other hand, achieves the maximum likelihood ( ML) performance yet imposes a high computational complexity. We propose a low-complexity detection scheme, concatenated with the SD method, which verifies the reliability of the ZF equalized observations via some predefined regions and thresholds obtained by the channel realization. We design the threshold analytically, such that the method achieves the ML performance. With the designed threshold, we prove that the method achieves the ML performance and the ZF computational complexity at the same time with probability one, at high signal-to-noise ratio ( SNR). The theoretical analysis is corroborated with numerical simulations. The simulation results also show that the proposed method achieves the ML performance very rapidly as the SNR increases.
Keyword:
MIMO detection
Sphere decoding
Reduced sphere decoding
Diversity
Computational complexity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.7
论文数:
1.3W
被引数:
5.3W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容