A Quick Fourier Transform Algorithm.

Abstract

A new highly efficient algorithm for calculation of Fourier coefficients on a digital computer is presented. For sample sizes up to 1024 points, this algorithm is competitive with the Fast Fourier Transform. For example, on a 5-microsec cycle time machine, a complete transform involving 1024 real data points is performed in 6.3 sec. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jul 02, 1970
Accession Number
AD0874435

Entities

People

  • John F. Kohne

Organizations

  • Navy Electronics Laboratory

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Coefficients
  • Computers
  • Computing Devices
  • Digital Computers
  • Fast Fourier Transforms

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Calculus or Mathematical Analysis
  • Electronics Engineering