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.
No takes yet. Share an insight, caveat, or question.
Santhanam et al. (1996) studied this question.