Introduction to a Fast Fourier Transform Algorithm
An introduction to the discrete Fourier transform and how one goes about computing it in practice. We examine the radix-2 Cooley-Tukey algorithm for computing a DFT in O(N logN) computational complexity. This video is part of the AstroBaki (https://casper.berkeley.edu/astrobaki) website's coverage of the the topic (https://casper.astro.berkeley.edu/ast....
Also, check out my novel!
https://www.aaronrparsons.com/books-p...