Digital Computation of Fractional Fourier Transform

By Zhou Min. 2002

474 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Chaotic Phenomena and Fractional-Order Dynamics in the Trajectory Control of Redundant Manipulators (2002, background): “However, other scientific areas are currently paying attention to the new concepts and we can refer the adoption of FDIs in biology [33], electronics [34], signal processing [35-36], system identification [37-39], diffusion and wave propagation [40-42], percolation [43], modelling and identification”
Maneuvering Target Detection via Radon-Fractional Fourier Transform-Based Long-Time Coherent Integration (2014, methodology): “Since the digital computation of FRFT is efficient and requires only a sequence of FFTs [30], the proposed RFRFT can be implemented by FFT, which can reduce the computational complexity and memory cost to a similar level of the traditional Doppler filter banks processing.”
Short-time Fourier transform: two fundamental properties and an optimal implementation (2003, methodology): “The FrFT computation algorithm is given in Table I [23], [27].”
Closed-form discrete fractional and affine Fourier transforms (2000, methodology): “In [5], a way to sample the continuous FRFT properly is introduced, and then, the resultant DFRFT will have the similar transform results as”