Generalizes MA-CDFRFT to general M-periodic transforms and halves FFT computations via symmetries for efficient implementation.
Computation of an eigendecomposition- based discrete fractional Fourier transform with reduced arith- metic complexity,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SP 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Multiangle Discrete Fractional Periodic Transforms
Generalizes MA-CDFRFT to general M-periodic transforms and halves FFT computations via symmetries for efficient implementation.