Abstract
This paper presents a simulation study that evaluated one optimal and several near-optimal algorithms for detecting 16-QAM and 64-QAM symbols in single-user MIMO receivers. The study is part of a larger project to develop efficient and near-optimal MIMO detection algorithms for high-order symbol constellations. Fouladi Fard's near-optimal detection algorithm differs from the conventional V-BLAST algorithm by considering each possible value of the noisiest symbol in the current symbol vector, and then performing V-BLAST in parallel for each candidate to detect the remaining symbols. We investigated modifications of Fouladi Fard's algorithm that restrict the search space for the first (noisiest) symbol, thereby reducing the computational complexity while still producing performance that significantly exceeds that of V-BLAST.
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.
