Abstract
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 v{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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
