By Topic

Error analysis and comparison of FFT implementation structures

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Meyer, R. ; Lehrstuhl fur Nachrichtentech., Erlangen-Nurnberg Univ., West Germany

A statistical model for roundoff errors is used to predict the output noise of most common forms of the fast Fourier transform (FFT) algorithm, the radix-2 and radix-4, with both decimation-in-time (DIT) and decimation-in-frequency (DIF). Two's complement fixed-point data representation with either truncation, rounding, or convergent rounding is treated. The mean values and the variances of the error for the individual frequency points are derived from three radix-2-DIT butterflies, which differ in type and location of quantizations and are normally used in most integrated signal processors. Results for fixed-point and block floating-point FFTs are presented and compared with other approaches to error reduction that yield maximal speed and accuracy in a given architecture

Published in:

Acoustics, Speech, and Signal Processing, 1989. ICASSP-89., 1989 International Conference on

Date of Conference:

23-26 May 1989