Skip to content
Search

Fourier transform

lastmod 2026-01-11created 2014-10-1223 edits

The Fourier transform decomposes a function of time (e.g. a signal) into its frequencies. This is similar to expressing a musical chord by the amplitudes (loudness) of the notes that make it up. The Fourier transform of a function of time is a complex-valued function of frequency, whose absolute value represents how much of that frequency is present in the original function.

The Fourier transform is a linear transform that takes one function as an argument and transforms it into another function. The transformed function is generally called the frequency-domain representation of the original function.

Fast Fourier transform

The fast Fourier transform (FFT) is an efficient algorithm that quickly computes the discrete Fourier transform (DFT) and its inverse. FFT is used in many fields, from digital signal processing to algorithms for finding the roots of partial differential equations.

Discrete Fourier transform

The discrete Fourier transform (DFT) is the Fourier transform of a discrete input signal, used in fields such as digital signal analysis. The discrete Fourier transform can be computed quickly using the fast Fourier transform.

Documentation

  • Fourier_analysis_made_easy_-_part_1.pdf
  • Fourier_analysis_made_easy_-_part_2.pdf

Libraries

List of libraries:

See also

Favorite site

Project

Sample code

References


  1. Ktword_-_Fourier_Representaion.pdf ↩

  2. Ghebook.blogspot_-_Fourier_series.pdf ↩

  3. Ghebook.blogspot_-_Fourier_transform.pdf ↩

  4. Free_lunch_plan_-_Fourier_transform.pdf ↩

  5. Discrete_Fourier_Transform_in_C_Code.pdf ↩

author Zer0 sitemap