Contents

1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.1 Basic discrete signals 1
1.2 LTI systems 1

2 Discrete-time signals and systems . . . . . . . . . . . . . . 3

2.1 Convolution 3
2.2 Linear constant coefficient difference equations 3

3 Fourier series and transform . . . . . . . . . . . . . . . . . . . . 5

3.1 Fourier series 5
3.2 Fourier transform 5

4 Discrete Fourier transform . . . . . . . . . . . . . . . . . . . . . . 7

4.1 Discrete-time Fourier transform 7
4.2 Discrete Fourier transform 7
5 Z-transform . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
5.1 The region of convergence 9
5.2 The transfer function as the z-transform 9

6 Digital filter design . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11

6.1 IIR filter design 11
6.2 Bilinear transformation 11
 Chapter 1. Introduction

1.1 Basic discrete signals

Exercise 1.1.1 Sketch the following discrete-time signals

a. x(n) = cos(πn/4)
b. x(n) = cos(πn/2)
c. x(n) = (0.5)n u(n)
Exercise 1.1.2 Sketch the following discrete-time signals
a. x(n) = u(n) + u(n − 2) − 4u(n − 4)
b. x(n) = nu(n) + (n + 1)u(n − 2) + 2u(n − 4)
c. x(n) = δ(n) + δ(n − 2) − u(n) + u(n − 2)

1.2 LTI systems

Exercise 1.2.1 Specify the linearity of the following systems

a. y(t) = ex(t)
b. y(t) = (cos t)x(t)
Z t
c. y(t) = τ x(τ )dτ
0
2 Chapter 1. Introduction

Exercise 1.2.2 For each of the systems in exercise 1.2.1, determine whether
the system is time invariant or time varying.
Exercise 1.2.3 Suppose that x(t) is the input to a linear time-invariant sys-
tem with corresponding output y(t). Prove that the system has the following
properties:
Z t
a. An input x1 (t) = x(τ )dτ to the same system yields an output of
Z t 0

y1 (t) = y(τ )dτ

0
dx(t)
b. An input x1 (t) = to the same system yields an output of y1 (t) =
dt
dy(t)
dt
Exercise 1.2.4 Compute the unit-pulse response h(n) for all integers for
each of the following discrete-time systems:
a. y(n + 1) + y(n) = x(n)
b. y(n + 1) + 2y(n) = x(n + 1) − 2x(n)
 Chapter 2. Discrete-time signals
and systems

2.1 Convolution

Exercise 2.1.1 Convolve v(n) = (0.25)n u(n) with w(n) = u(n).

Exercise 2.1.2 Convolve v(n) = 2u(n) with w(n) = (0.5)n u(n).
Exercise 2.1.3 An LTI system has the following impulse response h(n) =
1, 2, 1.5, 3 where the underline locates n = 0 value. Find the output sequence
y(n) with the input sequence x(n) = {2, 1.5, −1, 4, −3}.

2.2 Linear constant coefficient difference equations

Exercise 2.2.1 A discrete-time system is given by the following input/output

difference equation

y(n + 2) + 0.75y(n + 1) + 0.125y(n) = x(n)

a. Compute y(n) for n = 0, 1, 2, 3 when y(−2) = −1, y(−1) = 2, and

x(n) = 0 for all n.
b. Compute y(n) for n = 0, 1, 2, 3 when y(−2) = 0, y(−1) = 0, and
x(n) = 1 for all n ≥ 2.
4 Chapter 2. Discrete-time signals and systems

Exercise 2.2.2 Determine whether the following discrete-time systems are

causal or noncausal
a. y(n) = x(n) + 2x(n + 1)
b. y(n) = nx(n)
 Chapter 3. Fourier series and
transform

3.1 Fourier series

Exercise 3.1.1 Determine the Fourier series of the following function


t/2, t ∈ [0, 2}
v(t) =
2 − t/2, t ∈ [2, 4}

3.2 Fourier transform

Exercise 3.2.1 A periodic signal with period T has Fourier coefficients cxk ,
that is,
∞
X 2π
x(t) = cxk ejkω0 t , ω0 = , −∞ < t < ∞
T
k=−∞

Compute the Fourier coefficients cvk for the periodic signal v(t) = x(t−1).
Exercise 3.2.2 Compute the Fourier transform of the following signals,
using the symbolic manipulator to perform the integrations
a. x(t) = 2e−4t cos(10t)u(t)
b. x(t) = 2te−2t u(t)
 Chapter 4. Discrete Fourier
transform

4.1 Discrete-time Fourier transform

Exercise 4.1.1 Compute the DTFT of the following discrete-time signal

x(n) = (0.5)n cos 4nu(n).
Exercise 4.1.2 Compute the DTFT of the following discrete-time signal
v(n) = n(0.5)n u(n).

4.2 Discrete Fourier transform

Exercise 4.2.1 Compute the rectangular form of the four-point DFT of

the following signals
a. x(n) = {1, 0, −1, 0}
b. x(n) = {1, 1, −1, −1}
c. x(n) = {−1, 0, 1, 2}
Exercise 4.2.2
Calculate the circular convolution of two 4-length sequences
x(n) = sin π2 n and h(n) = u(n) − u(n − 3).
Exercise 4.2.3 Calculate the circular convolution of two 4-length sequences
in exercise 4.2.2 using DFT.
 Chapter 5. Z-transform

5.1 The region of convergence

Exercise 5.1.1 Consider the following signal

x(n) = {6, 5, −2, 3}
a. Find the Z-transform X(z).
b. What is the region of convergence of X(z)?
Exercise 5.1.2 Consider the following signal
x(n) = {−2, 5, 1, 7, 9}
a. Find the Z-transform X(z).
b. What is the region of convergence of X(z)?
Exercise 5.1.3 Consider the following signal
x(n) = 2(0.5)n−1 u(n)
a. Find the Z-transform X(z).
b. What is the region of convergence of X(z)?

5.2 The transfer function as the z-transform

10 Chapter 5. Z-transform

Exercise 5.2.1 Consider a discrete-time system described by the following

difference equation

y(n) = y(n − 1) − 2y(n − 2) + x(n − 1) − 3x(n − 2)

Find the transfer function H(z).

Exercise 5.2.2 Find the transfer function of a linear time invariant system
if the input to the system is
 n
3
x(n) = 2 − u(n)
2

and the output is

 n  n
3 3
y(n) = u(n) + − u(n)
2 2
 Chapter 6. Digital filter design

6.1 IIR filter design

Exercise 6.1.1 Design a lowpass Butterworth filter to meet the following

specifications
ˆ Ωp = 5kHz.
ˆ Ωs = 10kHz.
ˆ Minimum pass-band magnitude is -10dB.
ˆ Minimum stop-band attenuation is -60dB.
Exercise 6.1.2 Design a 5th-order analog lowpass Butterworth, Chebyshev
filters with a cutoff frequency of 1MHz.
Exercise 6.1.3 Find the transfer function H(s) of a third-order analog
lowpass Butterworth filter that has a 10dB cutoff frequency of Ωc = 2kHz.

6.2 Bilinear transformation

Exercise 6.2.1 Consider the following first-order analog filter

s
H(s) =
s + 10
12 Chapter 6. Digital filter design

a. What is the type of the filter (lowpass, highpass, bandpass, or band-

stop)?
b. Design a digital equivalent filter H(z) using the bilinear transformation
method.