<< Chapter < Page | Chapter >> Page > |
We saw Parseval/Plancherel in the context of orthonormal basis expansions. This begs the question, do and just take signals and compute their representation in another basis?
Let's look at first:
Recall that is really just a function of , so if we replace with , we get
Does this seem familiar? If is a periodic function defined on , then is just computing (up to a reversal of the indicies) the continuous-time Fourier series of !
We said before that the Fourier series is a representation in an orthobasis, the sequence of coefficients that we get are just the weights of thedifferent basis elements. Thus we have and
What about ? In this case we are taking an and mapping it to an . represents an infinite set of numbers, and when we weight the functions by and sum them all up, we get back the original signal
Unfortunately, ( ) so technically, we can't really think of this as a change of basis.
However, as a unitary transformation, has everything we would ever want in a basis and more: We can represent any using , and since it is unitary, we have Parseval and Plancherel Theorems as well. On top of that, wealready showed that the set of vectors are eigenvectors of LSI systems – if this really were a basis, it would be called an eigenbasis .
Eigenbases are useful because once we represent a signal using an eigenbasis, to compute the output of a system we just need to know what itdoes to its eigenvectors (i.e., its eigenvalues). For an LSI system, represents a set of eigenvalues that provide a complete characterization of the system.
Notification Switch
Would you like to follow the 'Digital signal processing' conversation and receive update notifications?