2 ms·
Every one of these transforms has the same basic "trick". It turns out you can represent a function "f" as weighted sum of a bunch of other functions "e_n". T
by ska 10y ago
Every one of these transforms has the same basic "trick". It turns out you can represent a function "f" as weighted sum of a bunch of other functions "e_n". That is, by adding (the right) bunch of other functions together, each scaled by a number "a_n"
so f = sum_n a_n*e_n
It's not at all obvious you can find any set of "e_n" so that this works, but it turns out you can. Not only that, but there are many ways to do it!
It turns out the set of functions has some very particular properties - without details, scaled sin & cos work (in complex variable, you get the FT), but so do step functions (Haar basis) and weirder functions (Wavelets), as well as many others if you relax some constraints (Frame theory, things don't have to be a basis any more. This is useful but has consequences like energy may not be conserved). Calculating "a_n" scalars takes a little of the details too, but is straightforward in practice.
The discretization of many of these things is quite useful in practice, but they all have continous variable equivalents. The DCT is basically a "trick" too, use twice as many samples as the DFT, but use only the real part (no complex numbers).