O'Reilly logo

Signals and Systems by Smarajit Ghosh

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

11

Discrete Fourier Transform and Fast Fourier Transform

When both the time and the frequency variables are discrete, we use Discrete Fourier Transform (DFT). If x(n) represents the discrete time signal, X(ω) represents the discrete frequency transform function of x(n). The Fast Fourier Transform(FFT) is simply a class of special algorithms implementing the discrete Fourier transform and it saves considerable time in computation It is not a different transform from the DFT. It reduces considerable number of calculations of DFT. The aim of this chapter is to introduce DFT and FFT.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required