CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Multiuser detection in CDMA - a comparison of relaxations, exact and heuristic search methods

Peng Hui Tan (Institutionen för datorteknik) ; Lars K. Rasmussen (Institutionen för datorteknik)
IEEE Transactions on Wireless Communications (1536-1276). Vol. 3 (2004), 5, p. 1802-1809.
[Artikel, refereegranskad vetenskaplig]

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.

Nyckelord: code-division multiple access (CDMA); multiuser detection (MUD); optimum detection; semidefinite relaxation; heuristic search methods

Denna post skapades 2013-06-17.
CPL Pubid: 178679


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för datorteknik (2002-2004)


Data- och informationsvetenskap

Chalmers infrastruktur