Reduced-Complexity Iterative Multiuser Detection for DS-CDMA

Authors:
J. Y. Pan;C. B. Soh;E. Gunawan
Affiliations:
School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798;School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798;School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798
Venue:
Wireless Personal Communications: An International Journal
Year:
2004

Citing 4
Cited 0

Minimum probability of error for asynchronous Gaussian multiple-access channels

IEEE Transactions on Information Theory
Multi-user detection for DS-CDMA communications

IEEE Communications Magazine
An intuitive justification and a simplified implementation of the MAP decoder for convolutional codes

IEEE Journal on Selected Areas in Communications
Iterative multiuser detection for coded CDMA signals in AWGN and fading channels

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A reduced-complexity iterative multiuser detection scheme is proposed. The scheme involves a simple way of choosing only K + 1 user bit vectors instead of the full-complexity 2K for the likelihood computation, thus reducing the complexity to O(K). An alternative, reduced computation method of increasing this list of vectors after each iteration is also presented. Simulations over AWGN, imperfect power control and multipath conditions demonstrate that the performance of the proposed reduced-complexity method is close to that of the full-complexity.