2 ms·
The point being that by your definition of not, DFT is also NOT a Fourier transform. It's only a "transform" in that the two domains are similar (identical, mo
by dnautics 10y ago
The point being that by your definition of not, DFT is also NOT a Fourier transform. It's only a "transform" in that the two domains are similar (identical, mod complexity). That's quite confusing to engineers who only care about the results. Computationally, the first two are strictly speaking impossible, but effectively, your data come in being modeled as finite real-valued arrays that represent function values, (close enough to "bounded real domain") and need to come out as finite real-valued arrays, represented integer-indexed frequencies, and a DFT on your data will operationally give you that. This is much more realistically described as a discretized pseudo-fourier series.