A Class of Finite Computation Structures Supporting the Fast Fourier Transform
MASSACHUSETTS INST OF TECH CAMBRIDGE PROJECT MAC
Pagination or Media Count:
The paper presents several results relating modular arithmetic schemes and the Fast Fourier transform. In particular, the classes of modular rings of integers in which the FFT may be computed is completely characterized by the prime decomposition of the modulus. Also, an extension of this result for computation structures similar to modular rings of integers yields a sufficiency hypothesis for the computation of FFT.
- Theoretical Mathematics