A NEW RECURSIVE ALGORITHM FOR MULTIUSER DETECTION  

作　　者：Wang Lei Zheng Baoyu Li Lei Chen Chao 

机构地区：[1]College of Communication and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing 210003, China [2]Stevens Institute of Technology, Department of Electrical and Computer Engineering, WISELAB, New Jersey 07030, United States

出　　处：《Journal of Electronics(China)》2009年第3期312-317,共6页电子科学学刊（英文版）

基　　金：Supported by National Natural Science Foundation of China (No. 60372107, 10371106, 10471114);Natural Science Foundation of Jiangsu Province (No. 04KJB110097)

摘　　要：Based on the synthesis and analysis of recursive receivers, a new algorithm, namely partial grouping maximization likelihood algorithm, is proposed to achieve satisfactory performance with moderate computational complexity.During the analysis, some interesting properties shared by the proposed procedures are described.Finally, the performance assessment shows that the new scheme is superior to the linear detector and ordinary grouping algorithm, and achieves a bit-error rate close to that of the optimum receiver.Based on the synthesis and analysis of recursive receivers, a new algorithm, namely partial grouping maximization likelihood algorithm, is proposed to achieve satisfactory performance with moderate computational complexity. During the analysis, some interesting properties shared by the proposed procedures are described. Finally, the performance assessment shows that the new scheme is superior to the linear detector and ordinary grouping algorithm, and achieves a bit-error rate close to that of the optimum receiver.

关 键 词：Maximization likelihood Iterative detection Multi-user detection Partial groupingmaximization likelihood 

分 类 号：TN929.533[电子电信—通信与信息系统] TP301.6[电子电信—信息与通信工程]