Abstract

Complexity and performance of many sub-optimal MIMO detectors can be improved by Lattice-reduction (LR) algorithms. Seysen's Algorithm (SA) based LR finds the basis with small number of iterations compared to other LR algorithms. Also, SA based lattice reduction enhance the efficiency of VLSI implementation and outperforms the existing Lenstra, Lenstra, and Lovasz (LLL) algorithm for sub optimal linear detectors in terms of number of bits detected (BER) and computational complexity. This paper exploits the possibilities of architectural modification of SA based preprocessing of the channel matrix H. SA is applied on the gram matrix equivalent of H and its duel to achieve better orthogonal lattice basis with minimum number of iterations.

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.