Detection based on local search

Abstract

Local search has grown from a simple heuristic idea into an important and mature field of research in combinatorial optimization [1]. When confronted with NP-hard problems, one can resort to ( i ) an enumerative method that is guaranteed to produce an optimal solution, or ( ii ) an approximation algorithm that runs in polynomial time, or ( iii ) some kind of heuristic technique without any guarantee on the quality of the solution and running time. The first approach of true optimization algorithms may become prohibitive due to the problem of size or the lack of insight into the problem structure. The second approach of polynomial-time approximation algorithms, though characterizable by performance bounds, may give inferior solutions. The third approach of heuristics is the preferred choice for NP-hard problems, as it provides a robust means to obtain good solutions to problems of large size in a reasonable time. Local search techniques come under the third approach. Optimum signal detection in MIMO systems involves the minimization of a certain cost over a discrete signal space, where the exhaustive enumerative approach becomes prohibitive when the number of signaling dimensions becomes large. Therefore, the local search approach can be a considered choice for signal detection in MIMO systems with a large number of antennas. An important characteristic of a local search algorithm is its neighborhood function/definition which guides the search to a good solution.