Abstract

The performance and complexity of two complex lattice reduction (LR) algorithms used in multiple input-multiple output (MIMO) detection are compared in this paper. The Seysen's Algorithm (SA) has been previously proposed as a low-complexity alternative to the real version of the Lenstra-Lenstra-Lovasz (LLL) algorithm while providing a better performance in LR-aided linear detectors. However, this paper shows that the SA has a higher complexity than the complex version of the LLL algorithm, due to its more computationally intensive preprocessing stage and its higher complexity per iteration. In addition, both the SA and the complex LLL algorithm provide practically the same performance when used in LR-aided successive interference cancellation (SIC) detectors.

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 call

Disclaimer: 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.