, we use the branch gains of Table 1.1 together with the relation of (1.153) in (1.228), whereupon performing the required PN Sync Search Procedures and Sweep Strategies differentiation and evaluating the result at Z = 1 gives (1.229) which for large V reduces to (1.230) Consider now another variation of the class of z-search strategies, namely, the broken/center Z. search. This is similar to the continuous/center Z, with the exception that the same cells are not searched twice in a row. Instead, when one of the two boundaries is reached, the local code is quickly rewound to the center and the search continues in the opposite direction. Clearly, for a priori distributions which are peaked around the center, an improvement in acquisition performance should be expected with respect to the continu- ous/center Z. strategy. The magnitude of this improvement will be demon- strated shortly by comparing the mean acquisition time performance of the broken/ and continuous/center Z search strategies for the triangular a priori distribution. First, however, we present the generating function U(z) for the broken/center Z which is obtained from its circular state diagram by steps identical to those used in arriving at (1.226). As in our previous discussions, letting T, denote the reset penalty time required to rewind the code, U(z) is found to be (1.231) For the triangular a priori distribution, (1.231) evaluates to (1.232) Pseudonoise Code Acquisition in Direct-Sequence Receivers Once again applying the necessary differentiation to arrive at (1.232) the mean acquisition time of a single dwell system, we obtain from (1.232) the result (1.233) which for large V reduces to (1.234) To illustrate the improvement in mean acquisition time performance by using a broken/ rather than a continuous/center Z search, we can take the ratio of the latter terms in (1.230) and (1.234) since, for large enough v, the first terms in these equations can be ignored. Thus, to a good approximation (1.235) Figure 1.37 is a plot of this mean acquisitio