DocumentCode :
3359670
Title :
Fast computation of the ambiguity function
Author :
Wei-Qiang Zhang ; Tao, Ran ; Ma, Yong-Feng
Author_Institution :
Dept. of Electron. Eng., Beijing Inst. of Technol., China
Volume :
3
fYear :
2004
fDate :
31 Aug.-4 Sept. 2004
Firstpage :
2124
Abstract :
This paper addresses the problem of fast computation of the ambiguity function using a new method based on pre-weighted zoom FFT algorithm, which employs zoom FFT technique and performs the weighting process previously and thus gets ride of the extra computation. The computational complexity of the presented algorithm is compared with other methods and the simulation results are given. Both the theory and the simulations show that, pro weighted zoom FFT method has lower computational complexity, less memory need and negligible error, and can meet the need of real-time processing.
Keywords :
computational complexity; fast Fourier transforms; signal processing; ambiguity function; computational complexity; fast Fourier transform; fast computation; real-time processing; zoom FFT method; Algorithm design and analysis; Computational complexity; Costs; Filtering; Frequency; Grid computing; Narrowband; Radar applications; Sampling methods; Sonar applications;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signal Processing, 2004. Proceedings. ICSP '04. 2004 7th International Conference on
Print_ISBN :
0-7803-8406-7
Type :
conf
DOI :
10.1109/ICOSP.2004.1442195
Filename :
1442195
Link To Document :
بازگشت