An efficient Fourier transform algorithm for frequency domains of several decades using logarithmically spaced time samples

Abstract

Discrete Fourier transforms are derived which allow the use of nonequally spaced time-domain samples. It is shown that the use of equal spacings in the logarithmic time and frequency domains provides a very efficient transform algorithm. The applicability of this algorithm for the analysis of systems with moderate dynamic behavior over several frequency decades is demonstrated by examples. An error analysis is given.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>