A Class of Finite Computation Structures Supporting the Fast Fourier Transform

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1973
Accession Number
AD0757787

Entities

People

  • Richard J. Bonneau

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Coefficients
  • Computations
  • Contracts
  • Convolution
  • Department Of Defense
  • Efficiency
  • Equations
  • Fast Fourier Transforms
  • Massachusetts
  • Military Research
  • Numbers
  • Polynomials
  • Prime Numbers
  • Security
  • Sequences

Fields of Study

  • Mathematics

Readers

  • Approximation Theory.
  • Mathematical Modeling and Probability Theory.