A two-stage adaptive multiuser detector in an additive white Gaussian noise code-division multiple-access channel is proposed and analyzed. Its first stage is an asynchronous one-shot decorrelator which in terms of computational complexity only requires inversion of K symmetric K/spl times/K matrices for all K users. In addition, the K inversions can be done in parallel, and the computed results for one user can be reused by all other users as well, resulting in a latency of only one bit, same as its synchronous counterpart. The decorrelated tentative decisions are utilized to estimate and subtract multiple-access interference in the second stage. Another novel feature of the detector is the adaptive manner in which the multiple-access interference estimates are formed, which renders prior estimation of the received signal amplitudes and the use of training sequences unnecessary. Adaptation algorithms considered include steepest descent (as well as its stochastic version), and a recursive least squares-type algorithm that offers a faster transient response and better error performance. Sufficient conditions for the receiver to achieve convergence are derived. The detector is near-far resistant, and is shown to provide substantial steady-state error performance improvement over the conventional and decorrelating detector, particularly in the presence of strong interfering signals.
['Lizhi Charlie Zhong', 'Zoran Siveski', 'Raafat E. Kamel', 'Nirwan Ansari']
Adaptive multiuser CDMA detector for asynchronous AWGN channels-steady state and transient analysis