Digital computation of the fractional Fourier transform
- 1 September 1996
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 44 (9) , 2141-2150
- https://doi.org/10.1109/78.536672
Abstract
An algorithm for efficient and accurate computation of the fractional Fourier transform is given. For signals with time-bandwidth product N, the presented algorithm computes the fractional transform in O(NlogN) time. A definition for the discrete fractional Fourier transform that emerges from our analysis is also discussed.Keywords
This publication has 39 references indexed in Scilit:
- Optimal filtering in fractional Fourier domainsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Radon transformation of time-frequency distributions for analysis of multicomponent signalsIEEE Transactions on Signal Processing, 1994
- Fractional Fourier transforms, wavelet transforms, and adaptive neural networksOptical Engineering, 1994
- Relationships between the Radon–Wigner and fractional Fourier transformsJournal of the Optical Society of America A, 1994
- Complex wave-field reconstruction using phase-space tomographyPhysical Review Letters, 1994
- Linear and quadratic time-frequency signal representationsIEEE Signal Processing Magazine, 1992
- ‘Chirplets’ and ‘warblets’: novel time–frequency methodsElectronics Letters, 1992
- Whistler analysis in the time-frequency plane using chirpletsJournal of Geophysical Research, 1992
- Adaptive chirplet representation of signals on time–frequency planeElectronics Letters, 1991
- Time-frequency distributions-a reviewProceedings of the IEEE, 1989