.png){kind=icon}
返回
Full-Diversity Approximated Lattice Reduction Algorithm for Low-Complexity MIMO Detection
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2014.2323235.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this letter, we propose a new approximated basis vector reordering (ABVR) criterion for low-complexity lattice reduction aided (LRA) multiple-input multiple-output (MIMO) detection. Despite the approximation, the ABVR criterion is proved to collect the full receiving diversity for LRA linear detection. A variant of the well-known complex Lenstra Lenstra Lovasz (CLLL) algorithm, i.e., LLL with deep insertion (DLLL), is employed to accommodate the ABVR criterion (DLLL-ABVR). Compared with the original CLLL and other approximated algorithms, the proposed DLLL-ABVR algorithm largely reduces the number of basis vector reordering (BVR) operations. Simulation results show that, on a practical MIMO scale, the proposed lattice reduction algorithm provides similar detection performance, especially for successive interference cancelation (SIC) detectors, while requiring significantly lower computational complexity.
Keyword:
Basis vector reordering (BVR) criterion
lattice reduction
multiple-input multiple-output (MIMO) detection
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
.png){kind=icon}
Interaction of Fischer carbene complexes of the type W(CO)5[C(OMe)R] (R = CH3, C2H5) with acetylenes
PREAI
分享收藏
没有更多内容
没有更多内容