Simple schemes for parallel acquisition of spreading sequences in DS/SS systems

Suboptimal parallel schemes for the acquisition of spreading sequences in chip-asynchronous spread-spectrum systems are considered. These acquisition schemes estimate the unknown delay of the received signal with respect to a locally generated spreading code. Two schemes are presented which are considerably easier to implement than the optimal estimator. An analytical expression is given for the error probability of the simpler of the two schemes, and it is shown that the average error probability of this scheme decreases exponentially with the signal-to-noise ratio. Numerical results show that the performance of both suboptimal estimators is comparable to that of the optimal estimator.