How does the command: real(ifft(fftshift(Y))*N) operate?
1 次查看(过去 30 天)
显示 更早的评论
Hello, I am interested in knowing how this form of the inverse FFT command which is
real(ifft(fftshift(Y))*N)
works and its complexity for a vector Y of N sample points, because I have seen some basic ifft commands as seen here but this one seems to involve ifft and fft together.
0 个评论
采纳的回答
Matt J
2021-4-20
编辑:Matt J
2021-4-20
All of those oeprations are O(N) except for the IFFT which is O(Nlog(N)). So the chain of operations is O(Nlog(N)) overall.It would be slightly more efficient to re-implement it as,
N*real(ifft(fftshift(Y)))
since then the multiplication with N only needs to operate on real numbers.
2 个评论
Matt J
2021-4-20
but this one seems to involve ifft and fft together.
No, it doesn't. But the FFT is also O(log(N)), so including an FFT step wouldn't increase the complexity either.
更多回答(0 个)
另请参阅
类别
在 Help Center 和 File Exchange 中查找有关 Fourier Analysis and Filtering 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!