A compact matched filter for rapid code acquisition

In this paper a compact digital matched filter acquisition system is proposed and investigated. The proposed digital matched filter (DMF) achieves a mean acquisition time comparable to that obtained by the conventional DMF but allows an unlimited period of integration and some advantages in terms of probabilities of detection and false alarm. Therefore the proposed DMF requires a short device length and still provides a fast acquisition. The probabilities for detection and false alarm in the AWGN channel are derived and the mean acquisition time is evaluated as a measure of performance. Its performance is compared to that of the conventional DMF and serial search acquisition system. The numerical results show the trade-off between the acquisition time and the number of stages of digital matched filter.