Efficient computation of the ambiguity function and the Wigner distribution on arbitrary line segments
Date
1999Source Title
Proceedings - IEEE International Symposium on Circuits and Systems
Print ISSN
0271-4310
Publisher
IEEE, Piscataway, NJ, United States
Volume
IV
Pages
IV-171 - IV-174
Language
English
Type
ArticleItem Usage Stats
200
views
views
234
downloads
downloads
Abstract
Efficient algorithms are proposed for the computation of Wigner distribution and ambiguity function samples on arbitrary line segments based on the relationship of Wigner distribution and ambiguity function with the fractional Fourier transformation. The proposed algorithms make use of an efficient computation algorithm of fractional Fourier transformation to compute N uniformly spaced samples O(N log N) flops. The ability of obtaining samples on arbitrary line segments provides significant freedom in the shape of the grids used in the Wigner distribution or in ambiguity function computations.
Keywords
AlgorithmsFourier transforms
Sampling
Ambiguity function
Fractional Fourier transformations
Wigner distribution
Signal processing