Abstract
Based on the well known Lenstra Lenstra Lovasz (LLL) algorithm, we propose a possible swap LLL algorithm (P-SLLL) for lattice reduction aided (LRA) MIMO detection in this paper. The reduction process of the new algorithm is modified by searching for the next column swap through the whole basis, instead of the sequential implementation in the original LLL algorithm. Two different searching criteria are proposed, i.e. the random selection criterion and the optimal swap selection criterion. Comparing to the LLL algorithm, the PSLLL algorithm enjoys fast termination property and lower computational complexity, which can benefit practical hardware implementation. Simulation results prove our analysis and show that PSLLL aided linear MIMO detectors achieve the same performance as the LLL aided methods.
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.
