Low-complexity fast-convergence blindly adaptive array processing techniques for wideband CDMA networks
Shang-Chieh Liu, E. Geraniotis · 2002
We present a linear-complexity fast-convergence blindly adaptive space-time processing which maximizes the received signal to interference and noise ratio (SINR) in wideband direct sequence code division multiple access (W-CDMA) networks. Compared to the other famous array processing algorithms, the proposed blind space-time processing technique outperforms the least mean square (LMS) algorithm. Both the aforementioned algorithms operate at the same order of complexity and, furthermore, the proposed one need no training sequence or feedback training. The convergence speed of the low-complexity algorithm almost competes which of the recursive least square (RLS) algorithm which is well-known for its fast convergence by using a training sequence and high computational complexity.