Asymptotic analysis of blind multiuser detection with blind channel estimation

Authors:
A. Host-Madsen;Xiaodong Wang;Seungjae Bahng
Affiliations:
Dept. of Electr. Eng., Univ. of Hawaii, Honolulu, HI, USA;-;-
Venue:
IEEE Transactions on Signal Processing
Year:
2004

Citing 0
Cited 3

Performance analysis of blind subspace-based signature estimation algorithms for DS-CDMA systems with unknown correlated noise

EURASIP Journal on Applied Signal Processing
Widely linear versus linear blind multiuser detection with subspace-based channel estimation: finite sample-size effects

IEEE Transactions on Signal Processing
Performance Analysis of Downlink W-CDMA Systems in Weibull and Lognormal Fading Channels Using Chaotic Codes

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	35.69

Visualization

Abstract

The analytical performance of the subspace-based blind linear minimum mean-square error (MMSE) multiuser detection algorithm in general multipath multi-antenna code-division multiple-access (CDMA) systems is investigated. In blind multiuser detection, the linear MMSE detector of a given user is estimated from the received signals, based on the knowledge of only the spreading sequence of that user. Typically, the channel of that user must be estimated first, based on the orthogonality between the signal and noise subspaces. An asymptotic limit theorem for the estimate of the blind linear detector (when the received signal sample size is large) is obtained, based on which approximate expressions of the average output signal-to-inference plus noise ratios (SINRs) and bit error rates (BERs) for both binary phase-shift keying (BPSK) and quaternary phase-shift keying (QPSK) modulations are given. Corresponding results for group-blind multiuser detectors are also obtained. Examples are provided to demonstrate the excellent match between the theory developed in this paper and the simulation results.