Floating Point Error Bound in the Prime Factor FFT.

Abstract

The prime factor FFT (PR FFT), developed by Kolba and Parks, makes use of recent computational complexity results by Winograd to compute the DFT with a fewer number of multiplications than that required by the FFT. Patterson and McClellan have derived an expression for the MSE in the PR FFT assuming finite precision fixed point arithmetic. In this paper we derive a bound on the MSE in the PR FFT assuming floating point arithmetic. In the course of the derivation an expression for the actual MSE is also presented, but is seen to be too complicated to be of practical use. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1980
Accession Number
ADA091696

Entities

People

  • Bede Liu
  • David C. Munson Jr.

Organizations

  • Princeton University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Acoustics
  • Air Force
  • Algorithms
  • Arithmetic
  • Computational Complexity
  • Computations
  • Computer Science
  • Computers
  • Convolution
  • Electrical Engineering
  • Engineering
  • Errors
  • Floating Point Operations
  • Precision
  • Signal Processing
  • Universities

Fields of Study

  • Engineering

Readers

  • Approximation Theory.
  • Computer Programming and Software Development.