Turbo multiuser detection based on simulated annealing

The conventional multiuser detector based on the a posteriori probability (APP) algorithm has a computational complexity growing exponentially with the number of users. In this paper, we propose a low-complexity soft-output multiuser detector based on the simulated annealing (SA) algorithm, which is a highly efficient heuristic search method for solving large-scale combinatorial optimization problems. Simulation results over highly correlated convolutional coded and turbo coded channels are presented, respectively. It is shown that the proposed receiver can significantly reduce the computational complexity with only slight performance degradation compared to the full-complexity APP multiuser detector.