
doi: 10.1109/78.536672
handle: 11693/25742 , 11693/10836
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.
Signal, Eigenvalues and eigenfunctions, Approximation theory, Radon-wigner, Digital signal processing, T?me-frequency-distributions, Fractional Fourier transforms, Fourier transforms, Bandwidth, Phase, Representat?on, Wigner distribution, Order, Opt?cal Implementation, Numerical methods, Chirplets, Mathematical operators, Calculations, Tomography, Integral equations, Algorithms, Wavelet Transforms
Signal, Eigenvalues and eigenfunctions, Approximation theory, Radon-wigner, Digital signal processing, T?me-frequency-distributions, Fractional Fourier transforms, Fourier transforms, Bandwidth, Phase, Representat?on, Wigner distribution, Order, Opt?cal Implementation, Numerical methods, Chirplets, Mathematical operators, Calculations, Tomography, Integral equations, Algorithms, Wavelet Transforms
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1K | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 0.1% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 0.1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 1% |
