Performance Analysis for the Expanding Search PN Acquisition Algorithm
- 1 March 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 30 (3) , 424-435
- https://doi.org/10.1109/tcom.1982.1095482
Abstract
An approach is presented for approximating the cumulative probability distribution of the acquisition time of the serial PN search algorithm. The results are applicable to variable as well as fixed dwell time systems. The theory is developed for the case where some a priori information on the PN code epoch is available (reacquisition problem or acquisition of very long codes). The special case of a search over the whole code is also treated. The accuracy of the approximation is demonstrated by comparing with published exact results for the fixed dwell time algorithm.Keywords
This publication has 3 references indexed in Scilit:
- Statistical Performance of Single Dwell Serial Synchronization SystemsIEEE Transactions on Communications, 1980
- Acquisition Time Performance of PN Spread-Spectrum SystemsIEEE Transactions on Communications, 1977
- A Unified Analysis of Pseudonoise Synchronization by Envelope CorrelationIEEE Transactions on Communications, 1977