Eight1911
/ radix-2-fft.py
Last active
March 28, 2022 20:54
Naive implementation of non-recursive radix-2 fast Fourier transform in Python.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import math | |
| # iterative cooley tukey fft for dyadics | |
| def fft(v): | |
| n, h = len(v), len(v) >> 1 | |
| old, new = v[:], [0] * n | |
| sublen, stride = 1, n | |
| while sublen < n: | |
| stride >>= 1 |