Performance Analysis of an Expanding-Search Algorithm forCoarse Acquisition of DSSS Signals

  • Authors:
  • J. S. Seybold;G. V. Fountain;M. A. Belkerdid

  • Affiliations:
  • TASC, Inc., 1992 Lewis Turner Boulevard, Fort Walton Beach, FL 32547, U.S.A.;TASC, Inc., 1992 Lewis Turner Boulevard, Fort Walton Beach, FL 32547, U.S.A.;Electrical and Computer Engineering Department, University of Central Florida, Orlando, FL 32816, U.S.A.

  • Venue:
  • Wireless Personal Communications: An International Journal
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

For coarse acquisition of Direct Sequence Spread Spectrum (DSSS)signals, a search of the possible code phases is required. In cases suchas signal reacquisition, where a priori information is available, the serial search may be abandoned in favor of an expanding search.In this paper, an expanding-search algorithm is presented andcompared to the expanding-sweep algorithms which have beentreated in the literature. Performance results for the serial-searchand the expanding-search algorithms are given.A discussion of the optimality of the serial-search and the expanding-search algorithms is presented. Performance comparisonsof the serial search and the expanding search are made fordifferent a priori code phase probability density functions (pdfs) andthe results are discussed. A technique for determining when the expanding search is an optimal search algorithm is developed andapplied to the performance curves shown previously. The resultsindicate that the expanding search provides a quantifiableimprovement over the serial search when the pdf is somewhatpeaked. The results also indicate that in many cases the expandingsearch may be a more effective search algorithm than the morecommon expanding sweep.