更新时间:2023-02-26 20:22:07
对于一维FFT,它是O(m log m)
.
For a 1D FFT it's O(m log m)
.
对于2D FFT,您必须在每个轴上执行m x 1D FFT,因此O(2 m^2 log m)
= O(m^2 log m)
.
For a 2D FFT you have to do m x 1D FFTs in each axis so that's O(2 m^2 log m)
= O(m^2 log m)
.
现在来我这里转机还为时过早n >= 3
,但我想可能是:
It's too early in the morning here to get my head round n >= 3
but I'm guessing it's probably:
O(m^n log m)