Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Fast Fourier Transform for Step-Like Functions: The Synthesis of Three Apparently Different Methods

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)

In 1965 Cooley and Tukey published an algorithm for rapid calculation of the discrete Fourier transform (DFT), a particularly convenient calculating technique, which can well be applied to impulse-like functions whose beginning and end lie at the same level. Independently, various propositions were made to overcome the truncation error which arises, if a step-like function, i.e. one whose end level differs from its starting level, is treated in the same way. It was argued that they behave differently under the influence of noise, band-limited violation, and other experimental inconveniences. The aim of this paper is to show that the three widely and satisfactorily used techniques of Samulon, Nicolson, and Gans, which originate from apparently different ideas, are exactly the same. An extended DFT and fast Fourier transform (FFT) formula is deduced which is adapted as well to impulse-like as to step-like functions.

Published in:

Instrumentation and Measurement, IEEE Transactions on  (Volume:29 ,  Issue: 1 )