Optimum multi-user detection by nonsmooth optimization

摘要: The optimum multiuser detection (OMD) is a discrete (binary) optimization. previously developed approaches often relax it by semi-definite program (SDP) and then employ randomization for searching the optimal solution around of this relaxed SDP. In paper, we show limited capacity SDP program, which at end cannot give better than simple linear minimum mean square error detector (LMMSE). Our departure point to express problem as quadratic minimization over equality constraint (QMQE) or concave box continuous optimization (CQOB). QMQE allows us develop nonsmooth algorithm locate global OMD, while CQOB facilities effective confirmation solutions found QMQE. intensive simulation clearly shows that outperforms all algorithms computational burden essentially reduced.