Homework I: Sampling: R. Nassif, ECE Department, AUB EECE 340, Signals and Systems
Homework I: Sampling: R. Nassif, ECE Department, AUB EECE 340, Signals and Systems
Homework I: Sampling: R. Nassif, ECE Department, AUB EECE 340, Signals and Systems
Problem 1. [10pts] Determine the Fourier transform and the Nyquist rate for each of the
following signals:
Problem 2. [10pts] A signal x(t) with Fourier transform X(jω) undergoes impulse-train sam-
pling to generate:
+∞
X
xp (t) = x(nT )δ(t − nT )
n=−∞
where T = 10−4 s. For each of the following sets of constraints on x(t) and/or X(jω), does the
sampling theorem guarantee that x(t) can be recovered exactly from the sampled signal xp (t)?
Problem 3. [15pts] Consider the system in the figure below in which the sampling signal is an
impulse train with alternating sign. The Fourier transform of the input signal is indicated in
the figure.
1
(a) For ∆ < π/(2ωM ), sketch the Fourier transform of xp (t);
(b) For ∆ < π/(2ωM ), determine a system that will recover x(t) from xp (t);
(c) What is the maximum value of ∆ in relation to ωM for which x(t) can be recovered from
xp (t)?
Problem 4. [15pts] Consider the following system for filtering a continuous-time signal using
a discrete-time filter. If Xc (jω) and H(ejΩ ) are as shown in the figure below, with 1/T = 20
kHz, sketch Xp (jω), X(ejΩ ), Y (ejΩ ), Yp (jω), and Yc (jω).
where ωs = 2π/T . Based on the above relation, we can also conclude that:
Proof:
∞ ∞
F
X X
xp (t) = xc (nT )δ(t − nT ) ←→ Xp (jω) = xc (nT )e−jωT n
k=−∞ n=−∞
| {z }
exp. 1
∞ ∞
DTFT
X X
x[n] ←→ X(ejΩ ) = x[n]e−jΩn = xc (nT )e−jΩn
n=−∞ n=−∞
| {z }
exp. 2
By comparing exp. 1 and exp. 2, we find that:
∞
1 X
X(ejΩ ) = Xp (jω)|ω= Ω = Xc (j(ω − kωs ))|ω= Ω
T T T
k=−∞