Accession Number:

AD0757787

Title:

A Class of Finite Computation Structures Supporting the Fast Fourier Transform

Descriptive Note:

Technical memo.

Corporate Author:

MASSACHUSETTS INST OF TECH CAMBRIDGE PROJECT MAC

Personal Author(s):

Report Date:

1973-03-01

Pagination or Media Count:

18.0

Abstract:

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.

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE