A unified approach to serial search spread-spectrum code acquisition. I - General theory. II - A matched-filter receiver

In the first part of this paper, the code-acquisition problem is discussed and a general extension of the analysis approach for serial-search acquisition techniques employing transform-domain flow graphs is given. The theory is formulated in general terms which allow considerable freedom in receiver modeling. It is shown that the statistics of the acquisition time for the single-dwell and N-dwell systems are special cases of this unified approach. In the second part of this paper, the theoretical framework's application is illustrated in the evaluation of a matched-filter, fast decision rate noncoherent acquisition receiver. The results show the dynamic dependence of the mean acquisition time on system parameters.