Skip to content Skip to navigation

Connexions

You are here: Home » Content » Spectrum Analyzer: Introduction to Fast Fourier Transform

Navigation

Content Actions
  • Download module PDF
  • Add to ...
    Add the module to:
    • My Favorites
    • A lens
    • An external social bookmarking service
    • My Favorites (What is 'My Favorites'?)
      'My Favorites' is a special kind of lens which you can use to bookmark modules and collections directly in Connexions. 'My Favorites' can only be seen by you, and collections saved in 'My Favorites' can remember the last module you were on. You need a Connexions account to use 'My Favorites'.
    • A lens (What is a lens?)

      Definition of a lens

      Lenses

      A lens is a custom view of Connexions content. You can think of it as a fancy kind of list that will let you see Connexions through the eyes of organizations and people you trust.

      What is in a lens?

      Lens makers point to Connexions materials (modules and collections), creating a guide that includes their own comments and descriptive tags about the content.

      Who can create a lens?

      Any individual Connexions member, a community, or a respected organization.

    • External bookmarks
  • E-mail the authors

Recently Viewed

Spectrum Analyzer: Introduction to Fast Fourier Transform

Module by: Douglas L. Jones, Swaroop Appadwedula, Matthew Berry, Mark Haun, Jake Janovetz, Michael Kramer, Dima Moussa, Daniel Sachs, Brian Wade

Summary: 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. Recall that the FFT is an efficient algorithm for computing the Discrete Fourier Transform (DFT), a frequency-sampled version of the DTFT.

DFT

Xk=∑n=0N-1xnⅇ-ⅈ2πNnk X k n 0 N 1 x n 2 N n k (1)
where n∧k∈01…N-1 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 other exercises in which processing occurred on a sample-by-sample basis.

Comments, questions, feedback, criticisms?

Send feedback