Given a filter with input x(n) and output y(n), it is always possible to compute the Fourier transform of he input and of the output, say X(f) and Y(f). The ratio of these two quantities is called the transfer function. For now, let us denote it by T(f). Interestingly, we will see that the transfer function do not depend on x, and thus is a global characteristic of the system. More than that, we will see that the transfer function is intimately linked to the impulse response of the system.
Convolution enables to express the output of a filter characterized by its impulse response. Consider a system with impulse response h(n) and an input x(n)=X0ej2πf0n. Its output is given by y(n)=∑mh(m)X0 ej2πf0(n−m)=X0ej2πf0n∑mh(m)e−j2πf0m. We recognize above the expression of the Fourier transform of h(m) at the frequency f0: H(f0)=∑mh(m)e−j2πf0m. Hence, the output can be simply written as y(n)=X0ej2πf0nH(f0). For a linear system excited by a complex exponential at frequency f0 , we obtain that output is the same signal, up to a complex factor H(f0). This gives us another insight on the interest of the decomposition on complex exponentials: they are eigen-functions of filters, and H(f0) plays the role of the associated eigenvalue.
Consider now an arbitrary signal x(n). It is possible to express x(n) as an infinite sum of complex exponentials (this is nothing but the inverse Fourier transform); x(n)=∫[1]X(f)ej2πfndf. To each component X(f)ej2πfn corresponds an output X(f)H(f)ej2πfn, and, by superposition, y(n)=∫[1]X(f)H(f)ej2πfndf. Thefore, we see that the Fourier transform of the output, Y(f), is simply Y(f)=X(f)H(f). The time domain description, in terms of convolution product, becomes a simple product in the Fourier domain. [x∗h](n)⇌ X(f)H(f). It is easy to check that reciprocally, x(n)h(n)⇌[X∗H](f). Try to check it as an exercise. You will need to introduce a convolution for function of a continuous variable, following the model of the convolution for discrete signals.
Begin with the Fourier transform of x(n)y(n), and replace the signals by their expression as the inverse Fourier transform:
FT[x(n)y(n)]=∑nx(n)y(n)e−j2πfn=∑n∫X(f1)ejπf1ndf1∫Y(f2)ejπf2ndf2e−j2πfn=∫∫X(f1)Y(f2)∑nejπf1nejπf2ne−j2πfndf1df2It remains to note that the sum of exponentials is nothing but the Fourier transform of the complex exponential ejπ(f1+f2)n, and thus that ∑nejπf1nejπf2ne−j2πfn=δ(f−f1−f2). Therefore, the double integral above reduces to a simple one, since f2=f−f1, and we obtain FT[x(n)y(n)]=∫X(f1)Y(f−f1)df1=[X∗Y](f).
(Another proof is possible, beginning with the inverse Fourier transform of the convolution [X∗Y](f), and decomposing the exponential so as to exhibit the inverse Fourier transform of x(n) and y(n)). Try it.
The transform of a convolution into a simple product, and reciprocally, constitutes the Plancherel theorem: [x∗y](t)⇌X(f)Y(f),x(t)y(t)⇌[X∗Y](f).
This theorem has several important consequences.
The Fourier transform of x(n)y(n)∗ is x(n)y(n)∗⇌∫[1]X(u)Y(f−u)∗du,
since FTy∗(n)=Y∗(−f). Therefore, FTx(n)y(n)∗=∫[1]X(u)Y(u−f)∗du, that is, for f=0, +∞∑−∞x(n)y∗(n)=∫[1]X(u)Y∗(u)du. This relation shows that the scalar product is conserved in the different basis for signals. This property is called the Plancherel-Parseval theorem. Using this relation with y(n)=x(n), we have +∞∑−∞|x(n)|2=∫[1]|X(f)|2df, which is a relation indicating energy conservation. It is the Parseval relation.