Construct · 1 fields · 1 citations

fast Fourier transform: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Signal processing

an algorithm that computes the discrete Fourier transform in order N log N operations by recursive splitting.

In signal processing, fast Fourier transform refers to an algorithm that computes the discrete Fourier transform in order N log N operations by recursive splitting. This meaning comes from Cooley (1965) in Mathematics of Computation.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how fast Fourier transform sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

Fourier transform1 fields · 3 citationsanchor · a standalone construct order4 fields · 6 citationsjingle · one word, four constructs signal5 fields · 5 citationsjingle · one word, five constructs

References

Cooley, J. W., & Tukey, J. W. (1965). An algorithm for the machine calculation of complex Fourier series. Mathematics of Computation, 19(90), 297-301. https://doi.org/10.1090/s0025-5718-1965-0178586-1

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct