Abstract
In this paper, we propose a low-complexity constant-throughput LLL algorithm for lattice-reduction-aided (LRA) multi-input multi-output (MIMO) detection. The traditional LLL algorithm for the lattice reduction has a drawback of varying throughput due to the variable iteration loops for the size-reduction and LLL-reduction checks. To address this problem, we propose a constant-throughput LLL (CT-LLL) algorithm that is well suited for real-time implementation. We further propose some techniques to reduce the redundant operations in the CT-LLL algorithm so that the computational complexity can be reduced. Simulation and analysis results show that the proposed low-complexity CT-LLL algorithm reduces the complexity of the CT-LLL algorithm for 4×4 and 8×8 MIMO systems to 80% and 72.94%, respectively, with negligible performance degradation.
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.
