A reactive tabu search heuristic for multiuser detection in CDMA

In this paper, a heuristic detection strategy for approximating the solution the optimal maximum-likelihood (ML) problem is investigated. The heuristic detector is based on a reactive tabu search, where a local descent algorithm is complemented by a list of forbidden moves in order to diversify the search. It adheres to the symbol constraints and performs local moves in the space of feasible solutions. The simulated bit error rate performance shows that this approach provides a good approximation to the ML detector.