DFT Algorithms - Analysis and Implementation

Abstract

Efficient algorithms for 11 and 13-point DFT's are presented. A more efficient algorithm, compared to earlier published versions, for the computation of 9-point DFT is also included. The effect of arithmetic roundoff in implementing the prime factor and the nested algorithms for computing DFT with fixed point arithmetic is analyzed using a statistical model. Various aspects of the prime factor, the nested and the radix-2 FFT algorithms are compared. A processor-based hardware implementation of the prime factor algorithm is discussed.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1978
Accession Number
ADA058049

Entities

People

  • Allen M. Peterson
  • M. J. Narasimha
  • S. Shankar Narayan

Organizations

  • Stanford University

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Algorithms
  • Composite Materials
  • Computations
  • Computer Programming
  • Computers
  • Digital Filters
  • Digital Signal Processing
  • Electrical Engineering
  • Electronics Laboratories
  • Engineering
  • Error Analysis
  • Errors
  • Fast Fourier Transforms
  • Probability Density Functions
  • Random Variables
  • Signal Processing
  • Two Dimensional

Fields of Study

  • Engineering

Readers

  • Approximation Theory.
  • Parallel and Distributed Computing.