Advertisement

Discrete Fourier Transform

  • James A. Storer

Abstract

The Fourier Transform has wide applications in scientific computing and engineering. Although it has a continuous version, we will consider only the discrete version (DFT) and present what is commonly known as the Fast Fourier Transform (FFT) algorithm. The DFT can replace a set of n values with another set of n values that represents the same information in a different way that may be easier to work with in a particular application. Later, after the work has been performed, the transformation can be reversed.

Keywords

Fast Fourier Transform Discrete Cosine Transform Discrete Fourier Transform Inverse Discrete Cosine Transform Fast Fourier Transform Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© J.A. Storer 2002

Authors and Affiliations

  • James A. Storer
    • 1
  1. 1.Department of Computer ScienceBrandeis UniversityWalthamUSA

Personalised recommendations