Convex-constrained maximum-likelihood detection in CDMA
P.H. Tan, Lars Kildehoj Rasmussen, Teng Joon Lim · 2002
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.