DocumentCode
342162
Title
Efficient computation of the ambiguity function and the Wigner distribution on arbitrary line segments
Author
Özdemir, Ahmet Kemal ; Arikan, Orhan
Author_Institution
Dept. of Electr. & Electron. Eng., Bilkent Univ., Ankara, Turkey
Volume
4
fYear
1999
fDate
36342
Firstpage
171
Abstract
Efficient algorithms utilizing the Fractional Fourier Transformation (FrFT) are proposed for fast computation of the Ambiguity Function (AF) and the Wigner Distribution (WD) on arbitrary line segments. For a signal with time-bandwidth product N, the complexity of the algorithms is O(N log N)
Keywords
Fourier transforms; Wigner distribution; computational complexity; filtering theory; functions; signal processing; time-frequency analysis; Wigner distribution; algorithm complexity; ambiguity function; arbitrary line segments; efficient computation; fast computation; fractional Fourier transformation; Chirp; Distributed computing; Fast Fourier transforms; Fourier transforms; Grid computing; Kernel; Radar signal processing; Signal processing algorithms; Sonar; Time frequency analysis;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1999. ISCAS '99. Proceedings of the 1999 IEEE International Symposium on
Conference_Location
Orlando, FL
Print_ISBN
0-7803-5471-0
Type
conf
DOI
10.1109/ISCAS.1999.779969
Filename
779969
Link To Document