On Multiangle Discrete Fractional Periodic Transforms
Abstract
The efficient multiangle centered discrete fractional Fourier transform (MA-CDFRFT) [1] has proven to be a useful tool for time-frequency analysis; in this paper, we generalize the MA-CDFRFT to general M -periodic transforms, which, among others, include the standard discrete Fourier, discrete sine, discrete cosine, Hadamard and discrete Hartley transform. Furthermore, we exploit the symmetries inherent to the MA-CDFRFT and our novel multiangle standard discrete fractional Fourier transform (MA-DFRFT) to halve the number of FFTs needed to compute these transforms, which paves the way for applications in resource-constrained environments.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.