video thumbnail 7:38
FFT Example: Unraveling the Recursion

2020-11-15

[public] 29.1K views, 3.51K likes, 10.0 dislikes audio only

channel thumbReducible

This video is meant as further support to the main video on the FFT /youtube/video/h7apO7q16V0

We break down how the FFT evaluates a particular polynomial at the roots of unity by unraveling the recursive process completely.

0:00 Introduction

1:13 FFT Example Breakdown

Support: https://www.patreon.com/reducible

This video wouldn't be possible without the open source manim library created by 3blue1brown: https://github.com/3b1b/manim

Here is link to the repository that contains the code used to generate the animations in this video: https://github.com/nipunramk/Reducible

Music:

All music by Aakash Gandhi


The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever? by Reducible
/youtube/video/h7apO7q16V0
Introduction
/youtube/video/Ty0JcR6Dvis?t=0
FFT Example Breakdown
/youtube/video/Ty0JcR6Dvis?t=73
Patreon patreon.com
https://www.patreon.com/reducible
The Discrete Fourier Transform: Most Important Algorithm Ever? 24,427 views
/youtube/video/yYEMxqreA10
Reducible This channel is all about animating computer science concepts in a fun, interactive, and intuitive manner.
/youtube/channel/UCK8XIGR5kRidIw2fWqwyHRA