.png){kind=icon}
Return
Augmented Lattice Reduction for MIMO Decoding
.png){kind=icon}
OA
AI
DOI：10.1109/TWC.2010.072210.100023.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Lattice reduction-aided decoding
LLL algorithm
right preprocessing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.7
Papers:
1.3W
Citations:
5.3W
Organization
Cited Papers
ShareSaveInteraction of Fischer carbene complexes of the type W(CO)5[C(OMe)R] (R = CH3, C2H5) with acetylenes
PREAI
ShareSaveEconomics of One Health: Costs and benefits of integrated West Nile virus surveillance in Emilia-Romagna.png)
PLOS ONEOAAI
PLOS ONEIF0
OAAIShareSaveShareSave
ShareSaveShareSave
View more