Line 31: Line 31:
  
 
<math>
 
<math>
y(n)=
+
y(n) =
 
\begin{cases}
 
\begin{cases}
 
x(n/D), & n/D \text{ is an integer} \\
 
x(n/D), & n/D \text{ is an integer} \\
Line 38: Line 38:
  
  
 +
</math>
 +
 +
<math>
 +
\begin{align}
 +
\ Y(e^{j\omega}) &= \sum_{n} x(n/D)e^{-j\omega n} \\
 +
&= \sum_{n} s_D(n)x(n/D)e^{-j\omega n} \\
 +
\end{align}
 
</math>
 
</math>

Revision as of 17:59, 12 October 2014


Frequency Domain View of Upsampling

A slecture by exchange student from UNAM, Mexico, Michel Olvera.

Partly based on the ECE438 Fall 2014 lecture material of Prof. Mireille Boutin.


OUTLINE

  1. Introduction
  2. Theory
  3. Examples
  4. Conclusion
  5. References

1. Introduction

Upsampling is the process of inserting zero-valued samples between the original samples of a signal to increase the sampling rate. One way to accomplish upsampling by an integer ratio of 1:D is to interpose D-1 zero samples between each pair of the input samples of the signal. This causes the spectrum of the original signal to repeat at multiples of the original sampling rate.

The process of upsampling doesn’t change the content of the input signal, and it only introduces the scaling of the time axis by a factor D. Consequently, the operation of upsampling is invertible, which means that it is possible to recover the input signal from samples of the output exactly.

In order to remove or at least attenuate the unwanted image spectra, a low pass filter must be placed immediately after upsampling. In the time domain, the effect is that the zero-valued samples introduced by the upsampler are filled with interpolated values.


Theory

$ y(n) = \begin{cases} x(n/D), & n/D \text{ is an integer} \\ 0, & \text{otherwise} \end{cases} $

$ \begin{align} \ Y(e^{j\omega}) &= \sum_{n} x(n/D)e^{-j\omega n} \\ &= \sum_{n} s_D(n)x(n/D)e^{-j\omega n} \\ \end{align} $

Alumni Liaison

Basic linear algebra uncovers and clarifies very important geometry and algebra.

Dr. Paul Garrett