Skip to content
HomeVideos
AllLongsCategoriesPlaylists
BooksBlogsPodcasts
HistoryListsWatch laterLiked videosFollowing

The videos, books, blogs and podcasts Hacker News keeps recommending, all in one place.

VideosBooksBlogsPodcastsAboutPrivacySettings

Data from Hacker News, HackerTube, HackerBooks, HackerBlogs and Open Library. Credits · Not affiliated with Y Combinator.

HomeVideosBooksBlogsPodcasts
Ctrl K

    The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?

    Reducible

    7 HN recommenders · recommended in 9 months, 2021–2026

    YouTube

    28:23 · 2.3M views · Nov 14, 2020

    Reducible's visual walkthrough of the Fast Fourier Transform, motivated by polynomial multiplication. It shows how the FFT's key ideas can be discovered by asking the right questions.

    HN repeatedly calls it a fantastic explanation that made FFT click, with some rewatching it periodically.

    Mathematics & Theoretical CSAlgorithms & data structuresInformation theory & signal processing
    1. 26:33
      The Most Underrated AlgorithmVeritasium11M views • 4 years ago
    2. 19:42
      But what is the Fourier Transform? A visual introduction.3Blue1Brown13M views • 8 years ago
    3. 24:47
      But what is a Fourier series? From heat flow to drawing with circles | DE43Blue1Brown19M views • 7 years ago
    4. 18:07
      The more general uncertainty principle, regarding Fourier transforms3Blue1Brown2.3M views • 8 years ago
    5. 18:31
      Fourier Optics used for Optical Pattern RecognitionHuygens Optics103K views • 6 years ago
    6. 30:55
      [JSConfUS 2013] Steven Wittens: Making WebGL DanceJSConf56K views • 13 years ago
    7. 15:12
      JPEG DCT, Discrete Cosine Transform (JPEG Pt2)- ComputerphileComputerphile698K views • 11 years ago
    8. 23:53
      D/A and A/D | Digital Show and Tell (Monty Montgomery @ xiph.org)FL Studio647K views • 13 years ago
    9. 1:31:28
      Stanford Seminar: Beyond Floating Point: Next Generation Computer ArithmeticStanford Online33K views • 9 years ago
    10. 1:56:20
      Let's build GPT: from scratch, in code, spelled out.Andrej Karpathy8.2M views • 3 years ago
    11. 3:39
      (1/4) Intro/History: Introducing a 100-year-old mechanical computerengineerguy476K views • 11 years ago
    12. 36:31
      Hey Underscore, You're Doing It Wrong!InfoQ141K views • 13 years ago
    13. 17:40
      3D Gaussian Splatting! - ComputerphileComputerphile273K views • 2 years ago
    14. 45:00
      "Transducers" by Rich HickeyStrange Loop Conference116K views • 12 years ago
    15. 5:58
      MarI/O - Machine Learning for Video GamesSethBling12M views • 11 years ago
    16. 14:28
      Superpositions, Sudoku, the Wave Function Collapse algorithm.Martin Donald764K views • 6 years ago
    17. 11:15
      The hardest problem on the hardest test3Blue1Brown16M views • 8 years ago
    18. 29:43
      Pi hiding in prime regularities3Blue1Brown2.8M views • 9 years ago
    19. 20:08
      Fast Inverse Square Root — A Quake III AlgorithmNemean6M views • 5 years ago
    20. 1:02:15
      Lambda Calculus - Fundamentals of Lambda Calculus & Functional Programming in JavaScriptFullstack Academy228K views • 9 years ago

    9 comments from Hacker News

    1. @squaredotDec 2022· in “Understanding Convolutions in Probability: A Mad-Science Perspective”

      As the author mentions, convolutions for signal processing and convolutions for probability are essentially equivalent things in two different contexts. It is interesting that the same concept is behind the multiplication of polynomials. In the discrete case we have the parallel of the vectors representing ... the (discretized) probability density <-> the (discrete) signal intensity <-> the coefficients of the polynomial ... in the respective context. If we look at the discrete case, since the operation of convolution is computationally expensive (O(n^3)), people often rely on the Fast Fourier Transform Algorithm (FFT), that runs in O(n log(n)). An excellent and very enjoyable video on the FFT applied to the polynomial multiplication is this video .

      Strongly recommendsView on HN
    2. @tverbeureOct 2025· in “Discrete Fourier Transform”

      I almost always prefer text over video, but this video on the same subject is fantastic: this video . I watch it at least once every year. Also, the title of the blog post (and by extension this HN post) is IMO not really correct: it's not about the DFT but specifically about the FFT.

      Strongly recommendsView on HN
    3. @kippinitrealJan 2023· in “Ask HN: Concepts that clicked only years after you first encountered them?”

      That video did the same for me. I also like the reducible video for Fast Fourier Transforms as well as the Veratasium piece that shares some fun history. Reducible - FFTs the most ingenious algorithm ever this video Veritasium - The Most Important Algorithm of All Time [LINK]

      Strongly recommendsView on HN
    4. @tverbeureJul 2024· in “Convolutions, Fast Fourier Transform and polynomials (2022)”

      If you haven’t seen it yet, you should watch this video: this video It derives the FFT algorithm from polynomial multiplication and it’s fantastic . I rewatch it every 6 months or so.

      Strongly recommendsView on HN
    5. @withinboredomNov 2021· in “Ask HN: Most interesting, mildly impractical, well-written books on software?”

      Not a book, but I truly enjoy this guy’s videos: this video . I usually watch them while eating lunch. He does a truly fantastic job.

      Strongly recommendsView on HN