The discrete rotational Fourier transform

Authors:
B. Santhanam;J.H. McClellan
Affiliations:
Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA;-
Venue:
IEEE Transactions on Signal Processing
Year:
1996

Citing 0
Cited 11

Signal compression using discrete fractional Fourier transform and set partitioning in hierarchical tree

Signal Processing - Special section: Advances in signal processing-assisted cross-layer designs
Discrete fractional Fourier transform based on the eigenvectors of tridiagonal and nearly tridiagonal matrices

Digital Signal Processing
On discrete Gauss-Hermite functions and eigenvectors of the discrete Fourier transform

Signal Processing
DFT-commuting matrix with arbitrary or infinite order second derivative approximation

IEEE Transactions on Signal Processing
Mixed Fourier transforms and image encryption

SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Short-time fractional fourier transform and its applications

IEEE Transactions on Signal Processing
The discrete fractional Fourier transform based on the DFT matrix

Signal Processing
Efficient computation of DFT commuting matrices by a closed-form infinite order approximation to the second differentiation matrix

Signal Processing
Eigenvectors of the discrete Fourier transform based on the bilinear transform

EURASIP Journal on Advances in Signal Processing - Special issue on applications of time-frequency signal processing in wireless communications and bioengineering
Fractional Fourier transform as a signal processing tool: An overview of recent developments

Signal Processing
Fractional discrete Fourier transform of type IV based on the eigenanalysis of a nearly tridiagonal matrix

Digital Signal Processing

Quantified Score

Hi-index	35.69

Visualization

Abstract

We define a discrete version of the angular Fourier transform and present the properties of the transform that show it to be a rotation in time-frequency space, this new transform is a generalization of the DFT. Efficient algorithms for its computation can then be based on the FFT and the eigenstructure of the DFT