Filter Functions
From Qwiki
Consider a signal (or random process) y(t), filtered to form a new function u(t), which is a linear functional of y(t)
where g(τ) is the filter's kernel and depends only on the time difference τ = t − t' for a stationary filter (which is assumed here). In what follows, it will be convenient to work with the Fourier transform of the kernel
which carries the same information as g(τ). The usefulness of this quantity is readily apparent when we consider the convolution theorem of Fourier transforms: if the Fourier transform
exists, then the Fourier transform of the filter output
is given by
It follows then, that if the input y(t) is a random process with spectral density Sy(f), then the spectral density of the filter output is given by:
It is often the case that the easiest way to determine the quantity G(f) is to simply send e2iπft through the filter (rather than directly computing the Fourier transform):

which differs from G(f) by complex conjugation and a phase.
Bandwidth
The bandwidth of a filter is defined as

where f0 is the frequency at which
is maximal.
Some Examples
All pass filter: u(t) = y(t)

Differentiator: u(t) = dy / dt

Box Car Averager:

Finite Fourier Transform (bandpass filter):
![g(\tau) = \left\{\begin{matrix} \frac{1}{T} \cos{\left[2\pi f_0\tau\right]} &,& T>\tau>0 \\ 0&,&\textrm{else}\end{matrix}\right\} \quad , \quad G(f) = \frac{\sin{(\pi (f+f_0) T)}}{2\pi (f+f_0) T}e^{i \pi (f+f_0) T} + \frac{\sin{(\pi (f-f_0) T)}}{2 \pi (f-f_0) T}e^{i \pi (f-f_0) T} \quad , \quad \Delta f = 1/T](/images/math/0/f/4/0f4419dcc159bce5bf138c071e164f99.png)
Note that for
, the expression for | G(f) | simplifies to

which is like the filter function for a box car averager, but with the frequency shifted and the peak magnitude smaller by 1 / 2. Furthermore, the introduction of the frequency shift f0 means that the effective bandwidth is
versus
for a box car averager. This discrepancy is why homodyne measurements can be "twice as accurate" as heterodyne measurements.

