.png){kind=icon}
返回
Near-ML MIMO Detection Algorithm With LR-Aided Fixed-Complexity Tree Searching
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2014.2364217.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose a low-complexity multiple-input multiple-output (MIMO) detection algorithm with lattice-reduction-aided fixed-complexity tree searching which is motivated by the fixed-complexity sphere decoder (FSD). As the proposed scheme generates a fixed tree whose size is much smaller than that of the full expansion in the FSD, the computational complexity is reduced considerably. Nevertheless, the proposed scheme achieves a near-maximum-likelihood (ML) performance with a large number of transmit antennas and a high-order modulation. The experimental results demonstrate that the performance degradation of the proposed scheme is less than 0.5 dB at the bit error rate (BER) of 10(-5) for a 8 x 8 MIMO system with 256 QAM. Also, the proposed method reduces the complexity to about 1.23% of the corresponding FSD complexity.
Keyword:
MIMO
lattice reduction
tree searching
fixed-complexity sphere decoder
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
Synthesis and Behavior of Cetyltrimethyl Ammonium Bromide Stabilized Zn1+xSnO3+x (0 ≤ x ≤1) Nano-Crystallites.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏
查看更多内容