Title :
Convex-constrained maximum-likelihood detection in CDMA
Author :
Tan, Peng Hui ; Rasmussen, Lars K. ; Lim, Teng Joon
Author_Institution :
Dept. of Comput. Sci., Chalmers Univ. of Technol., Goteborg, Sweden
Abstract :
We consider the constrained ML problem where the solution vector is restricted to lie within a convex set. An iterative algorithm for solving the convex-constrained ML problems is derived where special cases correspond to multistage interference cancellation structures
Keywords :
AWGN; code division multiple access; interference suppression; iterative methods; maximum likelihood detection; multiuser channels; set theory; AWGN; CDMA; additive white Gaussian noise; constrained ML problem; convex set; convex-constrained maximum-likelihood detection; iterative algorithm; multistage interference cancellation structures; solution vector; AWGN; Interference cancellation; Interference constraints; Iterative algorithms; Matched filters; Maximum likelihood detection; Multiaccess communication; Partitioning algorithms; Silicon carbide; Wireless communication;
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
DOI :
10.1109/ISIT.2000.866685
