Blind multiuser spreading sequences estimation algorithm for the direct-sequence code division multiple access signals

Abstract

By combining the multiple signal classification (MUSIC)-based algorithm, proposed by Haghighat and Soleymani, and the segmentation-based idea, a blind multiuser spreading sequences estimation algorithm for the direct-sequence code division multiple access (DS-CDMA) signals is presented in this study. The main idea of the proposed algorithm is to divide the spreading sequences into short-time segments so as to recover them in a sequential procedure. First, the received signal samples are divided into K collections of temporal windows. Each collection is corresponding to a group of short-time segments of the spreading sequences. Secondly, by performing a sub-segmentation-based estimation scheme on the first collection of temporal windows, the first short-time segments of all the users' spreading sequences are extracted. Finally, with the help of the segments acquired in advance, the remaining segments of the spreading sequences can be recovered chip-by-chip through K−1 subspace projection loops. This algorithm can be applied not only to the synchronous short-code (SC) DS-CDMA signals, but also to the long-code (LC) DS-CDMA signals in non-cooperative contexts, even with minus SNR. Simulations are presented to illustrate the performance of the proposed method. In addition, for the synchronous SC-DS-CDMA signals, the computational cost of the proposed algorithm is much lower than that of the MUSIC-based algorithm. Furthermore, a derivation for blind synchronisation of the synchronous SC-DS-CDMA signals is also presented.