返回
Augmented Lattice Reduction for MIMO Decoding
DOI:10.1109/TWC.2010.072210.100023.png)
摘要
En 中文
Lattice reduction algorithms, such as the Lenstra-Lenstra-Lovasz (LLL) algorithm, have been proposed as preprocessing tools in order to enhance the performance of suboptimal receivers in multiple-input multiple-output (MIMO) communications. A different approach, introduced by Kim and Park, allows to combine right preprocessing and detection in a single step by performing lattice reduction on an augmented channel matrix. In this paper we propose an improvement of the augmented matrix approach which guarantees a better performance. We prove that our method attains the maximum receive diversity order of the channel. Simulation results evidence that it significantly outperforms LLL reduction followed by successive interference cancellation (SIC) while requiring a moderate increase in complexity. A theoretical bound on the complexity is also derived.
Keyword:
Lattice reduction-aided decoding
LLL algorithm
right preprocessing
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.7
论文数:
1.3W
被引数:
5.3W
机构
引用论文
Interaction of Fischer carbene complexes of the type W(CO)5[C(OMe)R] (R = CH3, C2H5) with acetylenes
Economics of One Health: Costs and benefits of integrated West Nile virus surveillance in Emilia-Romagna
PLOS ONE
IF0

