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

IEEE Transactions on Wireless Communications

Volumn 3, Issue 5, 2004, Pages 1802-1809

  Tan, Peng Hui ^a   Rasmussen, Lars K ^b  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b UNIVERSITY OF SOUTH AUSTRALIA   (Australia)

Author keywords

Code division multiple access (cdma); Heuristic search methods; Multiuser detection (mud); Optimum detection; Semidefinite relaxation

Indexed keywords

BIT ERROR RATE; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; HEURISTIC METHODS; MAXIMUM LIKELIHOOD ESTIMATION; PROBLEM SOLVING;

HEURISTIC SEARCH METHODS; MULTIUSER DETECTION (MUD); OPTIMUM DETECTION; SEMIDEFINITE RELAXATION;

CODE DIVISION MULTIPLE ACCESS;

EID: 7544236843     PISSN: 15361276     EISSN: None     Source Type: Journal    
DOI: 10.1109/TWC.2004.834699     Document Type: Article

References (47)

1. S. Moshavi, "Multiuser detection for DS-CDMA communications," IEEE Commun. Mag., vol. 34, pp. 132-136, Oct. 1996.
2. S. Verdú, "Computational complexity of optimum multiuser detection," Algorithmica, vol. 4, pp. 303-312, 1989.
3. C. Sankaran and T. Ephremides, "Solving a class of optimum multiuser detection problems with polynomial complexity," IEEE Trans. Inform. Theory, vol. 44, pp. 1958-1961, Sept. 1998.
4. S. Ulukus and R. D. Yates, "Optimum multiuser detection is tractable for synchronous CDMA using m-sequences," IEEE Commun. Lett., vol. 2, pp. 89-91, Apr. 1998.
5. C. Schlegel and A. Grant, "Polynomial complexity optimal detection of certain multiple-access systems," IEEE Trans. Inform, Theory, vol. 46, pp. 2246-2248, Sept. 2000.
6. P. Németh, L. K. Rasmussen, and T. M. Aulin, "Maximum-likelihood detection of block coded CDMA using A* algorithm," in Proc. Int. Symp. Information Theory, Washington, DC, June 2001, p. 88.
7. S. Verdú, Multiuser Detection. Cambridge, U.K.: Cambridge Univ. Press, 1998.
8. R. Lupas and S. Verdú, "Near-far resistance of multiuser detectors in asynchronous channels," IEEE Trans. Commun., vol. 38, pp. 496-508, Apr. 1990.
9. A. Yener, R. D. Yates, and S. Ulukus, "A nonlinear programming approach to CDMA multiuser detection," in Proc. Asilomar Conf. Signals, Systems, Computing, Pacific Grove, CA, Oct. 1999, pp. 1579-1583.
10. P. H. Tan, L. K. Rasmussen, and T. J. Lim, "Constrained maximum-likelihood detection in CDMA," IEEE Trans. Commun., vol. 49, pp. 142-153, Jan. 2001.
11. P. Spasojeviæ and C. N. Georghiades, "The slowest descent method and its application to sequence estimation," IEEE Trans. Commun., vol. 49, pp. 1592-1604, Sept. 2001.
12. P. Spasojeviæ and A. Yener, "Improving soft interference cancellation for CDMA systems," in Proc. Int. Conf. Communications, Helsinki, Finland, June 2001, pp. 550-554.
13. X. F. Wang, W. S. Lu, and A. Antoniou, "A near-optimal multiuser detection for CDMA channels using semidefinite programming relaxation," in Proc. Int. Symp. Circuits System, 2001, pp. 298-301.
14. P. H. Tan and L. K. Rasmussen, "The application of semidefinite programming for detection in CDMA," IEEE J. Select. Areas Commun., vol. 19, pp. 1442-1449, Aug. 2001.
15. W.-K. Ma, T. N. Davidson, K. M. Wong, Z. Q. Luo, and P. C. Ching, "Quasi-maximum-likelihood multiuser detection by semi-definite relaxation with application to synchronous CDMA," IEEE Trans. Signal Processing, vol. 50, pp. 912-922, Apr. 2002.
16. M. Abdi, H. E. Nahas, A. Jard, and E. Moulines, "Semidefinite positive relaxation of the maximum-likelihood criterion applied to multiuser detection in a CDMA context," IEEE Signal Processing Lett., vol. 9, pp. 165-167, June 2002.
17. V. J. Rayward-Smith, I. H. Osman, C. R. Reeves, and G. D. Smith, Eds., Modern Heuristic Search Methods. New York: Wiley, 1996.
18. A. A. AlRustamani and B. R. Vojcic, "Greedy multiuser detection over single-path fading channel," in Proc. IEEE Int. Symp. Spread Spectrum Techniques Application, Parsippany, NJ, Sept. 2000, pp. 708-712.
19. G. He, A. C. Kot, and T. Qi, "Decorrelator-based neighborhood-searching multiuser detector in CDMA systems," IEE Electron. Lett., vol. 32, pp. 2307-2308, 1996.
20. Y. Sun, "A family of linear-complexity likelihood ascent search detectors for CDMA multiuser detection," in Proc. IEEE Int. Symp. Spread Spectrum Techniques Application, Parsippany, NJ, Sept. 2000, pp. 713-717.
21. J. Luo, G. Levchuk, K. Pattipati, and P. Whillett, "A class of coordinate descent methods for multiuser detection," in Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing, 2000, pp. 2853-2856.
22. F. Hasegawa, J. Luo, K. Pattipati, and P. Whillett, "Speed and accuracy comparison of techniques to solve a binary quadratic programming problem with applications to synchronous CDMA," in Proc. 40th IEEE Conf. Decision Control, 2001, pp. 4051-4056.
23. C. Ergün and K. Hacioglu, "Multiuser detection using a genetic algorithm in CDMA communications systems," IEEE Trans. Commun., vol. 48, pp. 1374-1383, Aug. 2000.
24. S. Abedi and R. Tafazolli, "Genetic multiuser receiver for code division multiple access communications," IEE Electron. Lett., vol. 36, pp. 1957-1958, Nov. 2000.
25. K. Yen and L. Hanzo, "Hybrid genetic algorithm based detection schemes for synchronous CDMA systems," in Proc. IEEE Vehicular Technology Conf., Tokyo, Japan, May 2000, pp. 1400-1404.
26. T. Miyajima and T. Hasegawa, "Multiuser detection using a hop-field network for asynchronous code-division multiple-access systems," IEICE Trans. Fundamentals Electron., Commun. Comput. Sci., vol. E79-A, pp. 1963-1971, 1996.
27. G. I. Kechriotis and E. S. Manolakos, "Hopfield neural network implementation of the optimal CDMA multiuser detector," IEEE Trans. Neural Network, vol. 7, pp. 131-141, Aug. 1996.
28. H. R. Lorenco, O. Martin, and T. Stutzle, "Iterated local search," in Handbook of Metaheuristics, F. Glover and G. Kochenberger, Eds. Norwell, MA: Kluwer, 2002, pp. 321-353.
29. F. Glover and M. Laguna, Tabu Search. Norwell, MA: Kluwer, 1997.
30. J. G. Proakis, Digital Communications, 3rd ed. New York: McGraw-Hill. 1995.
31. C. Helmberg and F. Rendl, "Solving quadratic (0, 1)-problems by semidefinite programs and cutting planes," Math. Program., no. 82, pp. 219-315, 1998.
32. C. Helmberg, F. Rendl, R. J. Vanderbei, and H. Wolkowicz, "An interior point method for semidefinite programming," SLAM J. Optim., no. 6, pp. 342-361, 1996.
33. M. X. Goemans and D. P. Williamsom, "Improved approximation algorithms for maximum cut and satisfiability problem using semidefinite programming," J. ACM, vol. 42, pp. 1115-1145, 1995.
34. W. K. Ma, T. N. Davidson, K. M. Wong, Z. Q. Luo, and P. C. Ching, "Efficient quasi-maximum-likelihood multiuser detection by semi-definite relaxation," in Proc. Int. Conf. Communications, Helsinki, Finland, June 2001, pp. 333-337.
35. P. Merz and B. Freisleben, "Greedy and local search heuristics for unconstrained binary quadratic programming," J. Heuristics, vol. 8, pp. 197-213, 2002.
36. J. E. Beasley, "Heuristic algorithms for the unconstrained binary quadratic programming problem," Manage. School, Imperial College, London, U.K., Tech. Rep., 1998.
37. K. Katayama and H. Narihisa, "Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem," Eur. J. Oper. Res., vol. 134, pp. 103-119, 2001.
38. T. M. Alkhamis, M. Hansan, and M. A. Ahmed, "Simulated annealing for the unconstrained quadratic pseduo-boolean function," Eur. J. Oper. Res., vol. 108, pp. 641-651, 1998.
39. M. Hansan, T. M. Alkhamis, and J. Ali, "A comparsion between simulated annealing, genetic algorithm and tabu search methods for the unconstrained quadratic pseduo-boolean function," Comput. Ind. Eng., vol. 38, pp. 323-339, 2000.
40. K. Katayama, M. Tani, and H. Narihisa, "Solving large binary quadratic programming problems by effective genetic local search algorithm," in Proc. Genetic Evolutionary Computation Conf., Oct. 2000, pp. 643-650.
41. A. Lodi, K. Allemand, and T. M. Liebling, "An evolutionary heuristic for quadratic 0-1 programming," Eur. J. Oper. Res., vol. 119, pp. 662-670, 1999.
42. P. Merz and B. Freisleben, "Genetic algorithms for binary quadratic programming," in Proc. Genetic Evolutionary Computation Conf., Sept. 1999, pp. 417-424.
43. F. Glover, G. A. Kochenberger, and B. Alidaee, "Adaptive memory tabu search for binary quadratic programs," Manage. Sci., vol. 44, pp. 336-345, 1998.
44. P. H. Tan, "Multiuser Detection in CDMA - Combinatorial Optimization Methods," Dept. Comp. Eng., Chalmers Univ. Technology, Gothenburg, Sweden, Tech. Rep. 408L, 2001.
45. R. Battiti and G. Tecchiolli, "The reactive tabu search," ORSA J. Comput., no. 2, pp. 126-140, 1994.
46. M. C. Reed, C. B. Schlegel, P. D. Alexander, and J. A. Asenstorfer, "Iterative multiuser detection for CDMA with FEC: Near-single-user performance," IEEE Trans. Commun., vol. 46, pp. 1693-1699, Dec. 1998.
47. A. A. AlRustamani, A. D. Damnjanovic, and B. R. Vojcic, "Turbo greedy multiuser detection," IEEE J. Select. Areas Commun., vol. 19, pp. 1638-1645, Aug. 2001.