Relaxed maximum a posteriori fault identification
Signal Processing
SMACK: a SMart ACKnowledgment scheme for broadcast messages in wireless networks
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Quasi-maximum-likelihood detector based on geometrical diversification greedy intensification
IEEE Transactions on Communications
On the performance of ad hoc networks with multiuser detection, rate control and hybrid ARQ
IEEE Transactions on Wireless Communications
Low-complexity near-ML decoding of large non-orthogonal STBCs using reactive tabu search
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Efficient symbol detection in multi-device STBC-MIMO system
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
A reactive tabu search based equalizer for severely delay-spread UWB MIMO-ISI channels
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Landscape properties and hybrid evolutionary algorithm for optimum multiuser detection problem
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
| Hi-index | 0.01 |
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.