Fast Fourier transform
id:
fast-fourier-transform-189-9788133
title:
Fast Fourier transform
text:
A fast Fourier transform (FFT) is an algorithm that computes the Discrete Fourier Transform (DFT) of a sequence, or its inverse (IDFT). Fourier analysis converts a signal from its original domain to a representation in the frequency domain and vice versa. The DFT is obtained by decomposing a sequence of values into components of different frequencies. This operation is useful in many fields, but computing it directly from the definition is often too slow to be practical. An FFT rapidly computes
brand slug:
wiki
category slug:
encyclopedia
description:
O(N log N) discrete Fourier transform algorithm
original url:
https://en.wikipedia.org/wiki/Fast_Fourier_transform
date created:
2002-02-25T15:51:15Z
date modified:
2024-09-09T11:48:37Z
main entity:
{"identifier":"Q623950","url":"https://www.wikidata.org/entity/Q623950"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/7/78/DIT-FFT-butterfly.svg","width":302,"height":298}
fields total:
13
integrity:
16