Abstract
The purpose of this two-part paper is threefold: 1) Part I discusses the code-acquistion problem in some depth and 2) also provides a general extension to the approach of analyzing serial-search acquisition techniques via transform-domain flow graphs; 3) Part II illustrates the applicability of the proposed theoretical framework by evaluating a matchedfilter (fast-decision rate) noncoherent acquisition receiver as an example. The theory is formulated in a general manner which allows for significant freedom in the receiver modeling. The statistics of the acquisition time for the single-dwell [2], [3] andN-dwell [5] systems are shown to be special cases of this unified approach.

This publication has 17 references indexed in Scilit: