Discrete Fourier Transform of an Arbitrary (Finite) Energy Signal |
||
Circuit | Control | Device | Microwave/RF, SI, EMC | Communication and Signal | Disclaimer | Download | Licensing | FAQ | Knowledge Base | About us |
||
Features
Rules and TheoriesThere are many variations of continuous Fourier transform definitions. But, they all fall into one of the two categories: Type 1:
where and typically . This applet utilizes a discrete Fourier transform (DFT) via the popular FFT algorithm to approximate the Fourier transform. For a given definition and choice of Cf, the forward Fourier transform is performed on a REAL time-domain (finite) energy signal x(t) evenly sampled at a span of
where N is a number that is power of 2. The inverse transform is carried out using the inverse FFT algorithm. The Applet and User's Guide
References[1] Alexander D. Poularikas, "The Transform and Applications Handbook", CRC Press, Boca Raton, 1996. [2] George Arfken, "Mathematical Methods for Physicists", Academic Press, San Diego, 1985. [3] William H. Press, Saul A. Teukolsky, Willaim T. Vetterling and Brian P. Flannery, "Numerical Recipes in C", Cambridge University Press, Cambridge, 1995. |
||
Copyright © 2000 - 2011 EE Circle Solutions. All rights reserved. |