Digital Signal Processing: A Computer-Based Approach
Digital Signal Processing: A Computer-Based Approach
The DRFT-a rotation in time-frequency space
ICASSP '95 Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02
Discrete Fractional Fourier Transform Based on New Nearly Tridiagonal Commuting Matrices
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
The discrete fractional Fourier transform
IEEE Transactions on Signal Processing
Closed-form discrete fractional and affine Fourier transforms
IEEE Transactions on Signal Processing
The fractional Fourier transform and time-frequency representations
IEEE Transactions on Signal Processing
Digital computation of the fractional Fourier transform
IEEE Transactions on Signal Processing
Relations between fractional operations and time-frequencydistributions, and their applications
IEEE Transactions on Signal Processing
| Hi-index | 0.00 |
The Fractional Fourier transform (FRFT), which provides generalization of conventional Fourier Transform was introduced many years ago in mathematics literature by Namias. In this paper, definition, properties of fractional Fourier transform and its relationship with other transforms is discussed. Various definitions of discrete version of FRFT and their comparison is presented. FRFT falls under the category of Linear time frequency representations. Some of the applications of FRFT such as detection of signals in noise, image compression, reduction of side lobe levels using convolutional windows, and time-frequency analysis are illustrated with examples. It has been observed that FRFT can be used in more effective manner compared to Fourier transform with additional degrees of freedom.