Scribd
Upload
86 views

Homework I: Sampling: R. Nassif, ECE Department, AUB EECE 340, Signals and Systems

This document contains 4 homework problems related to signals and systems. Problem 1 asks to determine the Fourier transform and Nyquist rate for 3 signals. Problem 2 asks whether sampling theorems can exactly recover signals from sampled data under various constraints. Problem 3 involves sampling a signal with an impulse train and recovering the original signal. Problem 4 involves filtering a continuous signal with a discrete filter and sketching the signals at various points.

Uploaded by

KARIM
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
86 views

Homework I: Sampling: R. Nassif, ECE Department, AUB EECE 340, Signals and Systems

This document contains 4 homework problems related to signals and systems. Problem 1 asks to determine the Fourier transform and Nyquist rate for 3 signals. Problem 2 asks whether sampling theorems can exactly recover signals from sampled data under various constraints. Problem 3 involves sampling a signal with an impulse train and recovering the original signal. Problem 4 involves filtering a continuous signal with a discrete filter and sketching the signals at various points.

Uploaded by

KARIM
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Homework I: Sampling

EECE 340, Signals and systems


R. Nassif, ECE Department, AUB

Problem 1. [10pts] Determine the Fourier transform and the Nyquist rate for each of the
following signals:

(a) x(t) = 1 + cos(2000πt) + sin(4000πt);


sin(4000πt)
(b) x(t) = πt ;
 2
sin(4000πt)
(c) x(t) = πt .

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)?

(a) X(jω) = 0 for |ω| > 5000π;

(b) X(jω) = 0 for |ω| > 15000π;

(c) Re{X(jω)} = 0 for |ω| > 5000π;

(d) x(t) real and X(jω) = 0 for ω > 5000π;

(e) |X(jω)| = 0 for |ω| > 5000π.

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ω).

Hint: The DTFT of x[n] can be expressed in the following form:


+∞    +∞
jΩ 1 X Ω 1 X
X(e ) = Xp (jω)|ω= Ω = Xc j − kωs = Xc (j (Ω − 2πk) /T )
T T T T
k=−∞ k=−∞

where ωs = 2π/T . Based on the above relation, we can also conclude that:

Xp (jω) = X(ejΩ )|Ω=ωT

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=−∞

which completes the proof.

You might also like