Abstract
In this paper, we propose a fixed-complexity variant of LLL (Lenstra-Lenstra-Lovasz) algorithm. LLL algorithm is widely used in MIMO signal processing to obtain full diversity gain with low complexity increase. However, because of its non-deterministic nature with varying complexity and high worst-case costs, the real implementation of original LLL algorithm is difficult. Although some fixed-complexity variants of LLL algorithm has been proposed, but still their complexity in large MIMO system is high. The proposed algorithm uses column selection method based on threshold which leads to the fast convergence in fewer iterations. Simulation result shows that the proposed algorithm converges faster than other fixed-complexity variants of LLL algorithms while it saves about 30% complexity in 8 × 8 MIMO system compared to existing fixed-complexity LLL (fc-LLL) algorithm.
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.
