By Topic

Analysis of errors in mixed fast Fourier transform algorithms with decimation in frequency for fixed point arithmetic

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
$33 $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)
K. Wolinski ; Warsaw Technical University, Institute of Telecommunication, Poland

The statistical model is assumed to determine errors a r i s i n g @ the computatlon of discrete Fourier transform with the use of mixed-radix FFT algorithm with decimation in frequency. The fixed point arithmetic operations on the numbers represented in two's complenunt code are considered. The formulae for calcu1ati.g the ,mean s q a r e value of errors in sny point of transform outpot for 'the operations of rounding with andwithout scaling, and chopping with and without scaling are given in the paper. Computer. simulation was carried out and general conclusions concerning mixed- -radix FFT algorithms with decimatiou in frequency were drawn.

Published in:

Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '82.  (Volume:7 )

Date of Conference:

May 1982