Fast optimal and suboptimal any-time algorithms for CDMA multiuser detection based on branch and bound

IEEE Transactions on Communications

Volumn 52, Issue 4, 2004, Pages 632-642

  Luo, Jie ^a   Pattipati, Krishna R ^b   Willett, Peter ^b   Levchuk, Georgiy M ^c  

^a UNIVERSITY OF MARYLAND   (United States)

^b UNIVERSITY OF CONNECTICUT   (United States)

^c APTIMA INC   (United States)

Author keywords

Branch and bound (BBD); Code division multiple access (CDMA); Multiuser detection; Optimal algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECODING; ERROR DETECTION; GAUSSIAN NOISE (ELECTRONIC); OPTIMIZATION; SIGNAL TO NOISE RATIO;

BRANCH AND BOUND; CODE DIVISION MULTIPLE ACCESS MULTIUSER DETECTION;

CODE DIVISION MULTIPLE ACCESS;

EID: 2442491036     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2004.826349     Document Type: Article

References (30)

1. J. Luo, K. Pattipati, P. Willett, and G. Levchuk, "Fast optimal and sub-optimal any-time algorithms for CWMA multiuser detecttion," in Proc. IEEE Int. Symp. Information Theory, Washington, DC, June 2001, p. 11.
2. J. Luo, K. Pattipati, P. Willett, and L. Brunel, "Branch-and-bound-based fast optimal algorithm for multiuser detection in synchronous CDMA," in Proc. IEEE Int. Conf. Communications, Anchorage, AK, May 2003, pp. 3336-3340.
3. S. Verdu, "Minimum probability of error for asynchronous Gaussian multiple-access channel," IEEE Trans. Inform. Theory, vol. IT-32, pp. 85-96, Jan. 1986.
4. R. Lupas and S. Verdu, "Linear multiuser detectors for synchronous code-division multiple-access channels," IEEE Trans. Inform. Theory, vol. 35, pp. 123-136, Jan. 1989.
5. Z. Xie, R. Short, and C. Rushforth, "A family of suboptimum detectors for coherent multiuser communications," IEEE Trans. Commun., vol. 8, pp. 683-690, May 1990.
6. M. K. Varanasi, "Multistage detection for asynchronous code-division multiple-access communications," IEEE Trans. Commun., vol. 38, pp. 509-519, Apr. 1990.
7. M. K. Varanasi and B. Aazhang, "Near-optimum detection in synchronous code-division multiple-access systems," IEEE Trans. Commun., vol. 39, pp. 725-736, May 1991.
8. M. K. Varanasi, "Group detection for synchronous Gaussian code-division multiple-access channels," IEEE Trans. Inform. Theory, vol. 41, pp. 1083-1096, July 1995.
9. J. Luo, K. Pattipati, and P. Willet, "Optimal grouping algorithm for a group decision feedback detector in synchronous CDMA communications," IEEE Trans. Commun., vol. 51, pp. 341-346, Mar. 2003.
10. A. Duel-Hallen, "Decorrelating decision-feedback multiuser detector for synchronous code-division multiple-access channel," IEEE Trans. Commun., vol. 41, 285-290, Feb. 1993.
11. ____, "A family of multiuser decision-feedback detectors for asynchronous code-division multiple-access channels," IEEE Trans. Commun., vol. 43, pp. 421-432, Feb.-Apr. 1995.
12. M. K. Varanasi, "Decision feedback multiuser detection: a systematic approach," IEEE Trans. Inform. Theory, 45, pp. 219-240, Jan. 1999.
13. P. Tan and L. Rasmussen, "The application of semidefinite programming for detection in CDMA," IEEE J. Select. Areas Commun., 19, pp. 1442-1449, Aug. 2001.
14. W. Ma, T. Davison, K. Wong, Z. Luo, and P. Ching, "Quasi-maximum-likelihood multiuser detection using semidefinite relaxation with application to synchronous CDMA," IEEE Trans. Signal Processing, vol. 50, pp. 912-922, Apr. 2002.
15. J. Luo, K. Pattipati, P. Willet, and F. Hasegawa, "Near-optimal multiuser detection in synchronous CDMA using probabilistic data association," IEEE Commun. Lett., vol. 5, pp. 361-363, Sept. 2001.
16. J. Luo, K. Pattipati, and P. Willet, "A sliding window PDA for asynchronous CDMA, and a proposal for deliberate asynchronicity," IEEE Trans. Commun., vol. 51, pp. 1970-1974, Dec. 2003.
17. F. Hasegawa, J. Luo, K. Pattipati, P. Willet, and D. Pham, "Speed and accuracy comparison of techniques for multiuser detection in synchronous CDMA," IEEE Trans. Commun., vol. 52, pp. 540-545, Apr. 2004.
18. S. Verdu, "Computational complexity of optimum multiuser detection," Algorithmica, vol. 4, pp. 303-312, 1989.
19. S. Verdu and H. Poor, "Abstract dynamic programming models under commutativity conditions," SIAM J. Control Optim., vol. 25, pp. 990-1006, July 1987.
20. C. Papadimitriou and K. Steiglitz, Combinatorial Optimization - Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.
21. D. Bertsekas, Network Optimization, Continuous and Discrete Models. Belmont, MA: Athena Scientific, 1998, ch. 10, pp. 483-492.
22. B. Paris, "Finite-precision decorrelating receivers for multi-user CDMA communication systems," IEEE Trans. Commun., vol. 44, pp. 496-507, Apr. 1996.
23. C. Schlegel and L. Wei, "A simple way to compute the minimum distance in multiuser CDMA systems," IEEE Trans. Commun., vol. 45, pp. 532-535, May 1997.
24. C. SanKaran and A. Ephremides, "Solving a class of optimum multiuser detection problems with polynomial complexity," IEEE Trans. Inform. Theory, vol. 44, pp. 1958-1961, Sept. 1998.
25. S. Ulukus and R. Yates, "Optimum multiuser detection is tractable for synchronous CDMA systems using M-sequences," IEEE Commun. Lett., vol. 2, pp. 89-91, Feb. 1998.
26. L. Brunel and J. Boutros, "Lattice decoding for joint detection in direct sequence CDMA systems," IEEE Trans. Inform. Theory, to be published.
27. B. Hassibi and H. Vikalo, "On the expected complexity of integer least-squares problems," in Proc. IEEE ICASSP, vol. 2, Orlando, FL, May 2002, pp. 1497-1500.
28. U. Fincke and M. Pohst, "Improved algorithms on integer programming and related lattice problems," in Proc. 15th Annu. ACM Symp. Theory of Computing, 1983, pp. 193-206.
29. R. Wolniansky, G. Foschini, G. Golden, and R. Valenzuela, "V-blast: an architecture for realizing very high data rates over the rich-scattering wireless channel," in Proc. ISSE, Pisa, Italy, Sept. 1998, pp. 295-300.
30. J. Luo, "Improved multiuser detection in code-division multiple access communications," Ph.D. dissertation, Elect. Comput. Eng. Dept., Univ. Connecticut, Storrs, CT, May 2002.