Jump to content

Category:FFT algorithms

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Mfrosz (talk | contribs) at 17:38, 9 August 2006 (Correction: log -> <math>log_2</math>, and specification of <math>N</math>). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This category is for fast Fourier transform (FFT) algorithms, i.e. algorithms to compute the discrete Fourier transform (DFT) in $O\left(N\log _{2}N\right)$ time (or better, for approximate algorithms), where $N$ is the number of discrete points.

Pages in category "FFT algorithms"

The following 17 pages are in this category, out of 17 total. This list may not reflect recent changes.

B

C

F

G

Goertzel algorithm

I

Irrational base discrete weighted transform

P

Prime-factor FFT algorithm

R

Rader's FFT algorithm

S

T

Twiddle factor

V

Vector-radix FFT algorithm

Retrieved from "https://en.wikipedia.org/w/index.php?title=Category:FFT_algorithms&oldid=68650388"