Multiuser detection in CDMA - a comparison of relaxations, exact and heuristic search methods
Artikel i vetenskaplig tidskrift, 2004

In this paper, we compare several optimization methods for solving the optimal multiuser detection problem exactly or approximately. The purpose of using these algorithms is to provide complexity constraint alternatives to solving this nondeterministic polynomial-time (NP)-hard problem. An approximate solution is found either by relaxation or by heuristic search methods, while the branch and bound algorithm is used to provide an exact solution. Simulations show that these approaches can have bit-error rate (BER) performance which is indistinguishable from the maximum likelihood performance. A tabu search method is shown to be an effective (in terms of BER performance) and efficient (in terms of computational complexity) heuristic when compared to other heuristics like local search and iterative local search algorithms. When the number of users increases, the tabu search method is more effective and efficient than the semidefinite relaxation approach.

heuristic search methods

optimum detection

semidefinite relaxation

multiuser detection (MUD)

code-division multiple access (CDMA)

Författare

Peng Hui Tan

Chalmers, Institutionen för datorteknik

Lars K. Rasmussen

Chalmers, Institutionen för datorteknik

IEEE Transactions on Wireless Communications

1536-1276 (ISSN)

Vol. 3 5 1802-1809

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1109/TWC.2004.834699

Mer information

Skapat

2017-10-06