Two fast algorithms of cross-ambiguity function for passive radar

Zhi Wen Gao*, Ran Tao, Tao Shan

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

16 Citations (Scopus)

Abstract

The computational burden of cross-ambiguity function is very large for measuring the time delay difference and the Doppler frequency shift of passive radar, which is difficult to meet the real-time requirements by the general algorithms. This paper proposes two fast algorithms of cross-ambiguity function for passive radar: the multi-stage decimation FFT algorithm and the pre-weighting multi-stage decimation FFT algorithm. The multi-stage decimation FFT algorithm decreases the length of the antialiasing filters and save the computational amount and the storage. The pre-weighting multi-stage decimation FFT algorithm avoids the cycle of the first-stage filter multiplication in different time delays and further increases the computational efficiency at the expense of the large storage. Experimental results show that the proposed algorithms can effectively increases the computational efficiency.

Original languageEnglish
Pages (from-to)669-672
Number of pages4
JournalTien Tzu Hsueh Pao/Acta Electronica Sinica
Volume37
Issue number3
Publication statusPublished - Mar 2009

Keywords

  • Cross-ambiguity function
  • Multi-stage decimation
  • Passive radar
  • Pre-weighting

Fingerprint

Dive into the research topics of 'Two fast algorithms of cross-ambiguity function for passive radar'. Together they form a unique fingerprint.

Cite this