1. Home
  2. Dsp laboratory with ti tms320c
  3. Required labs
  4. Lab 4
  5. Lab 4: theory

Lab 4: theory

<< Chapter < Page
  Dsp laboratory with ti tms320c   Page 1 / 1
Chapter >> Page >
The Fast Fourier transform (FFT) is an efficient algorithm for computing the Discrete Fourier Transform. The FFT is a block-based algorithm.

Introduction

The Fast Fourier Transform ( FFT ) can be used to analyze the spectral content of a signal. Recallthat the FFT is an efficient algorithm for computing the Discrete Fourier Transform ( DFT ), a frequency-sampled version of the DTFT .

Dft

X k n 0 N 1 x n 2 N n k
where n k 0 1 N 1

Because the FFT is a block-based algorithm, its computation is performed at the block I/O rate, in contrast to otherexercises in which processing occurred on a sample-by-sample basis.
<< Chapter < Page Page > Chapter >>

Read also:

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Dsp laboratory with ti tms320c54x. OpenStax CNX. Jan 22, 2004 Download for free at http://cnx.org/content/col10078/1.2
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Dsp laboratory with ti tms320c54x' conversation and receive update notifications?

Ask