The discrete fractional Fourier transformation
Date
1996Source Title
Proceedings of the IEEE-SP International Symposium on Time-Frequency and Time-Scale Analysis
Publisher
IEEE, Piscataway, NJ, United States
Pages
205 - 207
Language
English
Type
Conference PaperItem Usage Stats
38
views
views
28
downloads
downloads
Metadata
Show full item recordAbstract
Based on the fractional Fourier transformation of sampled periodic functions, the discrete form of the fractional Fourier transformation is obtained. It is found that only for a certain dense set of fractional orders such a discrete transformation is possible to define. Also, for its efficient computation a fast algorithm, which has the same complexity as the FFT, is given.
Keywords
AlgorithmsComputational complexity
Computational methods
Fractals
Signal processing
Signal theory
Discrete fractional Fourier transformations
Fractional Fourier transform
Sampled periodic functions
Fourier transforms