作者: H.D. Tuan , T.T. Son , H. Tuy , T. Le Ngoc
DOI: 10.1109/WPMC.2002.1088373
关键词:
摘要: The multiuser detection (MUD) problem is revealed concave in nature. Then, a new programming-based algorithm for MUD proposed. Our intensive simulation clearly shows that it outperforms all previously developed algorithms while the computational burden essentially reduced.