The discrete rotational Fourier transform

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.

[1]  J. McClellan,et al.  Eigenvalue and eigenvector decomposition of the discrete Fourier transform , 1972 .

[2]  Luís B. Almeida,et al.  The fractional Fourier transform and time-frequency representations , 1994, IEEE Trans. Signal Process..

[3]  B. Dickinson,et al.  Eigenvectors and functions of the discrete Fourier transform , 1982 .

[4]  John Sadowsky,et al.  Applications of weil representation theory to signal processing , 1989, Twenty-Third Asilomar Conference on Signals, Systems and Computers, 1989..

[5]  Luís B. Almeida.  An introduction to the angular Fourier transform , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.