-
# 从多项式乘法到快速傅里叶变换 | Miskcoo’s Space
计算多项式的乘法,或者计算两个大整数的乘法是在计算机中很常见的运算,如果用普通的方法进行,复杂度将会是 $\mathcal O(n^2)$ 的,还有一种分治乘法可以做到 $\mathcal O(n^{\log_23})$ 时间计算(可以看这里)。下面从计算多项式的乘法出发,介绍快速傅里叶变换(Fast Fourier Tran…
-
-
-
-
```
1. Description of the new feature
Fast Fourier Transform
2. Classes and or functions involved
M_Matrix
```
Original issue reported on code.google.com by `lmoff...@gmail.com` on 12 Nov 2010 at…
-
### Is your feature request related to a problem?
I've been wanting to make visualizers for music with gamemaker for a while and can't wrap my head around how to implement a Fast Fourier Transform ( …
-
## 参考実装
- https://ei1333.github.io/library/math/fft/fast-fourier-transform.hpp
## 依存するライブラリ
## その他
中分類 - fft
-
-
Add algorithms useful for vision / signal processing:
- [ ] Convolution (with implicit im2col)
- [ ] Conv transpose
- [ ] Fast Fourier Transform
-
Hi guys,
Are convolution algorithm or fast Fourier transform implemented to perform filtering or frequency analysis?
It could be of great interest.
Kind Regards,
Luis