Minimum variance space-time CDMA receiver algorithms based on URV decomposition

A minimum variance space-time (MVST) receiver with an antenna array has recently been proposed as a relatively simple method for designing blind multiuser receivers for code division multiple access (CDMA) systems. For time-varying CDMA systems, it is necessary to update the response vector, which is used to construct the receiver algorithm, of the MV receiver for each symbol interval. In this paper, we propose a new MVST receiver whose the response vector is updated based on the rank-revealing URV-decomposition rather than the eigen decomposition or singular value decomposition (SVD) used in previous MVST receivers. We demonstrate its performance through simulation in varying the number of multipaths and the Rayleigh fading parameters. It is found that the URV-decomposition based MVST receiver is effective for the time-varying CDMA signal, and achieves considerable computational savings.

[1]  Andrew J. Viterbi,et al.  On the capacity of a cellular CDMA system , 1991 .

[2]  Upamanyu Madhow,et al.  Blind adaptive multiuser detection , 1995, IEEE Trans. Inf. Theory.

[3]  K. J. Ray Liu,et al.  URV ESPRIT for tracking time-varying signals , 1994, IEEE Trans. Signal Process..

[4]  Don H. Johnson,et al.  Array Signal Processing: Concepts and Techniques , 1993 .

[5]  Joohwan Chun,et al.  A new space-time minimum variance receiver for CDMA systems and its performance analysis , 2000, Vehicular Technology Conference Fall 2000. IEEE VTS Fall VTC2000. 52nd Vehicular Technology Conference (Cat. No.00CH37152).

[6]  Joohwan Chun,et al.  Blind space-time minimum variance CDMA receiver for multipath channel , 1999 .

[7]  G. W. Stewart,et al.  An updating algorithm for subspace tracking , 1992, IEEE Trans. Signal Process..

[8]  Upamanyu Madhow,et al.  MMSE interference suppression for direct-sequence spread-spectrum CDMA , 1994, IEEE Trans. Commun..