Blind Paralind Space-Time Multiuser Detection for Asynchronous Cdma System

This paper links the asynchronous CDMA system signal detection problem to the parallel profiles with linear dependencies (PARALIND), and derives a deterministic blind PARALIND algorithm whose performance is close to nonblind space-time minimum mean square error method. The proposed algorithm has the better performance than space-time matched filter, supports small sample sizes, and even works well in array error condition. Most notably, it does not require knowledge of the direction of arrival and channel fading information.