# 0.3 Sampling, up--sampling, down--sampling, and multi--rate  (Page 3/5)

 Page 3 / 5

## Fourier series coefficients from the dft

If the signal to be analyzed is periodic, the Fourier integral in [link] does not converge to a function (it may to a distribution). This function is usually expanded in a Fourier series to define itsspectrum or a frequency description. We will sample this function and show how to approximately calculate the Fourier series coefficients usingthe DFT of the samples.

Consider a periodic signal $\stackrel{˜}{f}\left(t\right)=\stackrel{˜}{f}\left(t+P\right)$ with $N$ samples taken every $T$ seconds to give $\stackrel{˜}{Tn}\left(t\right)$ for integer $n$ such that $NT=P$ . The Fourier series expansion of $\stackrel{˜}{f}\left(t\right)$ is

$\stackrel{˜}{f}\left(t\right)=\sum _{k=-\infty }^{\infty }C\left(k\right)\phantom{\rule{0.166667em}{0ex}}{e}^{2\pi kt/P}$

with the coefficients given in [link] . Samples of this are

$\stackrel{˜}{f}\left(Tn\right)=\sum _{k=-\infty }^{\infty }C\left(k\right)\phantom{\rule{0.166667em}{0ex}}{e}^{2\pi kTn/P}=\sum _{k=-\infty }^{\infty }C\left(k\right)\phantom{\rule{0.166667em}{0ex}}{e}^{2\pi kn/N}$

which is broken into a sum of sums as

$\stackrel{˜}{f}\left(Tn\right)=\sum _{\ell -\infty }^{\infty }\sum _{k=0}^{N-1}C\left(k+N\ell \right)\phantom{\rule{0.166667em}{0ex}}{e}^{2\pi \left(k+N\ell \right)n/N}=\sum _{k=0}^{N-1}\left[\sum _{\ell -\infty }^{\infty },C,\left(k+N\ell \right)\right]\phantom{\rule{0.166667em}{0ex}}{e}^{2\pi kn/N}.$

But the inverse DFT is of the form

$\stackrel{˜}{f}\left(Tn\right)=\frac{1}{N}\sum _{k=0}^{N-1}F\left(k\right)\phantom{\rule{0.166667em}{0ex}}{e}^{j2\pi nk/N}$

therefore,

$\mathcal{DFT}\left\{\stackrel{˜}{f}\left(Tn\right)\right\}=N\sum _{\ell }C\left(k+N\ell \right)=N\phantom{\rule{0.166667em}{0ex}}{C}_{p}\left(k\right).$

and we have our result of the relation of the Fourier coefficients to the DFT of a sampled periodic signal. Once again aliasing is a result ofsampling.

## Shannon's sampling theorem

Given a signal modeled as a real (sometimes complex) valued function of a real variable (usually time here), we define a bandlimited function as anyfunction whose Fourier transform or spectrum is zero outside of some finite domain

$|F\left(\omega \right)|=0\phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.277778em}{0ex}}\text{for}\phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.277778em}{0ex}}|\omega |>W$

for some $W<\infty$ . The sampling theorem states that if $f\left(t\right)$ is sampled

${f}_{s}\left(n\right)=f\left(Tn\right)$

such that $T<2\pi /W$ , then $f\left(t\right)$ can be exactly reconstructed (interpolated) from its samples ${f}_{s}\left(n\right)$ using

$f\left(t\right)=\sum _{n=-\infty }^{\infty }{f}_{s}\left(n\right)\phantom{\rule{0.166667em}{0ex}}\left[\frac{sin\left(\pi t/T-\pi n\right)}{\pi t/T-\pi n}\right].$

This is more compactly written by defining the sinc function as

$\text{sinc}\left(x\right)=\frac{sin\left(x\right)}{x}$

which gives the sampling formula Equation 53 from Least Squared Error Design of FIR Filters the form

$f\left(t\right)=\sum _{n}{f}_{s}\left(n\right)\phantom{\rule{0.166667em}{0ex}}\text{sinc}\left(\pi t/T-\pi n\right).$

The derivation of Equation 53 from Least Squared Error Design of FIR Filters or Equation 56 from Least Squared Error Design of FIR Filters can be done a number of ways. One of the quickest uses infinite sequences of delta functions and will bedeveloped later in these notes. We will use a more direct method now to better see the assumptions and restrictions.

We first note that if $f\left(t\right)$ is bandlimited and if $T<2\pi /W$ then there is no overlap or aliasing in ${F}_{p}\left(\omega \right)$ . In other words, we can write [link] as

$f\left(t\right)=\frac{1}{2\pi }{\int }_{-\infty }^{\infty }F\left(\omega \right)\phantom{\rule{0.166667em}{0ex}}{e}^{j\omega t}\phantom{\rule{0.166667em}{0ex}}d\omega =\frac{1}{2\pi }{\int }_{-\pi /T}^{\pi /T}{F}_{p}\left(\omega \right)\phantom{\rule{0.166667em}{0ex}}{e}^{j\omega t}\phantom{\rule{0.166667em}{0ex}}d\omega$

but

${F}_{p}\left(\omega \right)=\sum _{\ell }F\left(\omega +2\pi \ell /T\right)=T\sum _{n}f\left(Tn\right)\phantom{\rule{0.166667em}{0ex}}{e}^{-j\omega Tn}$

therefore,

$f\left(t\right)=\frac{1}{2\pi }{\int }_{-\pi /T}^{\pi /T}\left[T,\sum _{n},f,\left(Tn\right),\phantom{\rule{0.166667em}{0ex}},{e}^{-j\omega Tn}\right]{e}^{j\omega t}\phantom{\rule{0.166667em}{0ex}}d\omega$
$=\frac{T}{2\pi }\sum _{n}f\left(Tn\right){\int }_{-\pi /T}^{\pi /T}{e}^{j\left(t-Tn\right)\omega }\phantom{\rule{0.166667em}{0ex}}d\omega$
$=\sum _{n}f\left(Tn\right)\phantom{\rule{0.166667em}{0ex}}\frac{sin\left(\frac{\pi }{T}t-\pi n\right)}{\frac{\pi }{T}t-\pi n}$

which is the sampling theorem. An alternate derivation uses a rectangle function and its Fourier transform, the sinc function, together withconvolution and multiplication. A still shorter derivation uses strings of delta function with convolutions and multiplications. This isdiscussed later in these notes.

There are several things to notice about this very important result. First, note that although $f\left(t\right)$ is defined for all $t$ from only its samples, it does require an infinite number of them to exactly calculate $f\left(t\right)$ . Also note that this sum can be thought of as an expansion of $f\left(t\right)$ in terms of an orthogonal set of basis function which are the sinc functions. One can show that the coefficients in this expansion of $f\left(t\right)$ calculated by an inner product are simply samples of $f\left(t\right)$ . In other words, the sinc functions span the space of bandlimited functions with avery simple calculation of the expansion coefficients. One can ask the question of what happens if a signal is “under sampled". What happens ifthe reconstruction formula in Equation 12 from Continuous Time Signals is used when there is aliasing and Equation 57 from Least Squarred Error Design of FIR Filters is not true. We will not pursue that just now. In any case, there are many variations and generalizations of this result thatare quite interesting and useful.