THE APPLICABILITY OF SPECIAL PURPOSE COMPUTERS TO FAST FOURIER TRANSFORMS.

Abstract

The Fast Fourier Transform is an algorithm for the computation of Discrete Fourier Transforms in less time than allowed by any other algorithm available. The use of special purpose digital machines to reduce those times even further is of interest for real time spectral analysis. The main principles of Fast Fourier Transforms are presented. The design of a full-parallel eight sample processor is presented as a point of reference for comparison with serial and serial-parallel hybrid machines. Carry-Save Addition is introduced and used as the primary arithmetic logic. (Author)

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1967
Accession Number
AD0831651

Entities

People

  • David Hugh Adams

Organizations

  • Naval Postgraduate School

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Arithmetic
  • Computational Complexity
  • Computations
  • Computers
  • Discrete Fourier Transforms
  • Fast Fourier Transforms
  • Fourier Transformation
  • Mathematical Analysis
  • Mathematics

Readers

  • Computer Engineering
  • Image Processing and Computer Vision.