A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Reduced Neighborhood Search Algorithms for Low Complexity Detection in MIMO Systems
2015
2015 IEEE Global Communications Conference (GLOBECOM)
Neighborhood search algorithms such as likelihood ascent search (LAS) and reactive tabu search (RTS) have been proposed for low complexity detection in multiple-input multipleoutput (MIMO) systems having a large number of antennas. Both these algorithms are iterative and search for the vector which minimizes the maximum likelihood (ML) cost in the neighborhood. In this paper we propose a way to reduce the size of the neighborhood. For this, we propose a metric and a selection rule to decide
doi:10.1109/glocom.2015.7417691
fatcat:nllhdb5ppnh6jkimyeucib3ere