In order to solve the blind despreading problem of the synchronous DS-CDMA signals, a fast blind despreading based on iterative least squares with projection (ILSP) is proposed. Firstly, the signal subspace spanned by the spreading sequences of all users is estimated via the eigen-decomposition of the intercepted signal covariance matrix. Then with the finite alphabet property of the spreading sequences, the ILSP algorithm is exploited to cope with the unitary matrix ambiguity resulting from the eigen-decomposition operation and estimate the spreading sequences accurately. Finally, the symbol sequences are obtained by despreading the intercepted signal using the estimated spreading sequences. The simulation results demonstrate that the proposed algorithm has good performance under the low SNR (Signal to noise ratio) environment and much lower computational complexity compared with the traditional algorithms.

%U http://www.yhxb.org.cn/EN/10.3873/j.issn.1000-1328.2019.07.011