Aliasing of Sampled Continuous-Time Signals

GUIDE: Mathematics of the Discrete Fourier Transform (DFT). Aliasing of Sampled Continuous-Time Signals

It appears that you are using AdBlocking software. The cost of running this website is covered by advertisements. If you like it please feel free to a small amount of money to secure the future of this website.

<< Previous page  TOC  INDEX  Next page >>


Aliasing of Sampled Continuous-Time Signals

This section quantifies aliasing in the general case. This result is then used in the proof of Shannon’s Sampling Theorem in the next section.

It is well known that when a continuous-time signal contains energy at a frequency higher than half the sampling rate $F_s/2$, then sampling at $F_s$ samples per second causes that energy to alias to a lower frequency. If we write the original frequency as $f = F_s/2 + \, then the new aliased frequency is $f_a = F_s/2 - \, for $\. This phenomenon is also called “folding”, since $f_a$ is a “mirror image” of $f$ about $F_s/2$. As we will see, however, this is not a fundamental description of aliasing, as it only applies to real signals. For general (complex) signals, it is better to regard the aliasing due to sampling as a summation over all spectral “blocks” of width $F_s$.

Theorem. (Continuous-Time Aliasing Theorem) Let $x(t)$ denote any continuous-time signal having a Fourier Transform (FT)

\

Let
\

denote the samples of $x(t)$ at uniform intervals of $T_s$ seconds, and denote its Discrete-Time Fourier Transform (DTFT) by
\

Then the spectrum $X_d$ of the sampled signal $x_d$ is related to the spectrum $X$ of the original continuous-time signal $x$ by
\

The terms in the above sum for $m\ are called aliasing terms. They are said to alias into the base band$[-\. Note that the summation of a spectrum with aliasing components involves addition of complex numbers; therefore, aliasing components can be removed only if both their amplitudeand phase are known.

Proof. Writing $x(t)$ as an inverse FT gives

\

Writing $x_d(n)$ as an inverse DTFT gives
\

where $\ denotes the normalized discrete-time frequency variable.

The inverse FT can be broken up into a sum of finite integrals, each of length $\, as follows:

\


Let us now sample this representation for $x(t)$ at $t=nT_s$ to obtain
\


since $n$ and $m$ are integers.
Normalizing frequency as $\ yields
\

Since this is formally the inverse DTFT of $X_d(e^{j\ written in terms of $X(j\, the result follows.$\

<< Previous page  TOC  INDEX  Next page >>

 

© 1998-2017 – Nicola Asuni - Tecnick.com - All rights reserved.
about - disclaimer - privacy