Blind channel estimation for multi-user CDMA systems

Blind identification of digital communication channels has recently attracted a significant amount of attention. In this work, subspace-based methods are considered specifically for Direct-Sequence/Code-Division Multiple-Access (DS/CDMA) signals in an asynchronous, multipath, multi-user environment. The objective is to reduce the complexity of previously proposed methods by exploiting the properties of DS/CDMA waveforms. In particular, knowledge of the MS/CDMA spreading codes is employed, via matched filtering, to reduce dimensionality. The resulting algorithm shows negligible difference in performance with respect to a previously proposed algorithm by Torlak and Xu. However, the reduction in complexity can be significant. The Cramer-Rao lower bounds on the estimation variance are determined and provide further justification for the matched filtering scheme.