Sheela
Sheela
Home
Add
Questions
Thinkers
Claims
People
Concepts
Jargon
Sources
Health
Predictions
Collections
Domain Landscape
Contribute
Review
Dedup
Topic requests
Settings
Help

← Jargon

Jargonmathematics· 3 claims· 1 episode

Discrete Fourier transform

A version of the Fourier transform adapted for finite, discrete (sampled) signals rather than infinite continuous signals; produces a discrete, finite frequency spectrum

As defined in The Most Underrated Algorithm


Where it comes up · 1
  • The Most Underrated Algorithm3 claims

Most important claims · 3 of 3Search all claims for “Discrete Fourier transform” →
  • The breakthrough in fast DFT computation came in 1963 at a meeting of the President's Science Advisory Committee where President John F. Kennedy was present along with Richard Garwin and John Tukey, and Tukey discovered how to compute discrete Fourier transforms with far fewer calculations while doodling during a boring meeting discussion.The Most Underrated Algorithm
  • The brute-force discrete Fourier transform requires N² complex multiplications to transform N data points, meaning a million-sample signal would require one trillion calculations, taking over three years on 1960s computers.The Most Underrated Algorithm
  • In a Discrete Fourier Transform, the frequency spectrum is also discrete and finite, with frequencies falling into a finite number of bins whose number and size are determined by the number of samples in the signal and how closely spaced the samples are.The Most Underrated Algorithm