Sampling: Continuous-to-discrete
What is Sampling?
Sampling is the process of converting a continuous-time signal into a discrete time signal.
Sampling is accomplished by multiplying a continuous-time signal
with an impulse train, a periodic sequence of impulses with a fundamental period
such that
![Rendered by QuickLaTeX.com \[\delta_{T_s}(t) = \sum_{k=-\infty}^{\infty} \delta(t - k T_s) \; .\]](https://smartdata.ece.ufl.edu/wp-content/ql-cache/quicklatex.com-1ab76ed4cff1aa76ce1ab57fc1c8da46_l3.png)
![Rendered by QuickLaTeX.com \[x_s(t) = x(t) \delta_{T_s}(t) = \sum_{k=-\infty}^{\infty} x(k T_s) \delta(t - k T_s) \; .\]](https://smartdata.ece.ufl.edu/wp-content/ql-cache/quicklatex.com-0e3428fdf270e38d07a9e32a8dba4345_l3.png)



Fourier Series/Transform of an impulse train
To answer this question, we look at the Fourier series/transform of the impulse train. Since
is periodic, we use the Fourier series. When we plug
into the Fourier analysis equation, we get
![]()

We refer to
as the [angular] sampling frequency.
Since the Fourier series coefficients are defined by
, the Fourier transform has a value of
(the
is introduced because we are in the angular frequency domain) at
times the fundamental angular frequency, i.e.
, where
is an any integer. Therefore, in the continuous-frequency, we get a pulse train with spacing of
,
![]()
Therefore, the Fourier transform of an infinite pulse train with period
(i.e.,
is a infinite pulse train with spacing
(i.e.,
).


Apply multiplication property
To determine the Fourier transform of
, we apply the multiplication property. That is, multiplication in time is equivalent to convolution in frequency. We get the relationship
![Rendered by QuickLaTeX.com \begin{align*} x(t) \delta_{T_s}(t) &\stackrel{\mathcal{F}}{\longleftrightarrow}& \frac{1}{2 \pi} \left[ X(\Omega) * \left( \frac{2 \pi}{T_s} \delta_{\Omega_s}(\Omega) \right) \right] \\ x(t) \delta_{T_s}(t) &\stackrel{\mathcal{F}}{\longleftrightarrow}& \frac{1}{T_s} \sum_{k=-\infty}^{\infty} X(\Omega - k \Omega_s) \end{align*}](https://smartdata.ece.ufl.edu/wp-content/ql-cache/quicklatex.com-ecfa404724a92e0079862cb73643352f_l3.png)
Therefore, sampling in time results in the sum of shifted replicas of the frequency domain representation
.




The sampling theorem
We can now answer our question, does the sampling process uniquely preserve all information about our signal? The answer is: yes, but under certain conditions.
Let the Fourier transform of
be
with a largest angular frequency
. That is
![]()
![Rendered by QuickLaTeX.com \[X_{s}(\Omega) = \frac{1}{T_s} \sum_{k=-\infty}^{\infty} X(\Omega - k \Omega_s) \; .\]](https://smartdata.ece.ufl.edu/wp-content/ql-cache/quicklatex.com-f8aa1896c722c53825ac2d7d57ead5b8_l3.png)
If the bandwidth of the
,
, and
never overlap, then the original frequency information is remains changed. That is, to preserve all information about the original signal, we require
![]()

Therefore, the sampling frequency, or sampling rate, must be two times larger than the maximum frequency in the signal. This is known as the sampling theorem or sampling criteria. The frequency
or
is known as the Nyquist sampling rate.