|
|
|
|
|
|
by simo_dax
2436 days ago
|
|
|
Each of these is certainly a complication, for example standard discrete-time Fourier transform is O(n^2) while the Fast Fourier Transform algorithm manages to do the same in O(nlogn), but I think the main difficulty here is that the direct transform is an integral (or series, depends if you're using continuous or discrete one) over time, which is a single real variable. The inverse is an integral over the complex variable, a+ib, and you need a whole 2D plane to represent it (the complex plane indeed), a single 1D line is not enough. So how do you take an integral of a complex value over a 2D plane? And here you start delving deep into theorems and convergence regions.. stuff that's quite difficult to grasp without having experience with complex calculus (and I don't) The inverse fourier trasnform, on the other hand, is limited to the imaginary axis of the complex plane (the exponent is a purely imaginary number), so you're restricting it to be monodimensional, hence the relative simplicity in reversing the transform Also, keep in mind that all of this assumes you have infinite samples, so you need to use some form of windowing which doesn't distort too much the signal |
|
|