DocumentCode :
911594
Title :
A reduced-complexity maximum-likelihood method for multiuser detection
Author :
Li, Junqiang ; Letaief, Khaled ; Cao, Zhigang
Author_Institution :
Dept. of Electron. Eng., Tsinghua Univ., Beijing, China
Volume :
52
Issue :
2
fYear :
2004
Firstpage :
289
Lastpage :
295
Abstract :
Multiuser or joint detection has recently been receiving significant research interest because of its potential for the significant increase in system capacity and performance. Among the conventional multiuser detection schemes such as the minimum mean-squared error and successive interference cancellation-based ones, maximum-likelihood multiuser detection has the best system performance. However, the complexity of maximum-likelihood detection (MLD) increases exponentially in the number of users and constellation size. In this paper, a low-complexity MLD scheme based on the use of a sensitive-bits algorithm is proposed. It is demonstrated that the proposed method can greatly reduce the computational complexity with a minimal penalty in performance compared with the exhaustive optimal MLD scheme.
Keywords :
computational complexity; maximum likelihood detection; multiuser detection; space division multiple access; space division multiplexing; SDMA; computational complexity; joint detection; low-complexity MLD; multiuser detection; reduced-complexity maximum-likelihood method; sensitive-bits algorithm; space division multiplexing; space-division multiple access; wireless communication system; Bit error rate; Computational complexity; Detectors; Information technology; Interference cancellation; Laboratories; Maximum likelihood detection; Multiaccess communication; Multiuser detection; Wireless communication;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/TCOMM.2003.822756
Filename :
1269977
Link To Document :
بازگشت