NAME:__________________________________

ECE 438
Exam 1 Solutions, 10/05/2006.
This is a closed-book exam, but you are allowed one standard (8.5-by-11) sheet of notes. No
calculators are allowed.
Total number of points: 50. This exam counts for 20% of your nal grade.
You have 75 minutes to complete EIGHT problems.
Be sure to fully and clearly explain all your answers except your answers to Problem 6.
There will not be any discussion of grades. All re-grade requests must be submitted in writing,
as stated in the course information handout.
Score Grader
1_______ _______
2_______ _______
3_______ _______
4_______ _______
5_______ _______
6_______ _______
7_______ _______
8_______ _______
Total score:_______
1
Formula Sheet
Discrete-Time Fourier Transform (DTFT)
1. Denition and the inverse transform formula.
X(e
j
) =

n=
x(n)e
jn
x(n) =
1
2
_

X(e
j
)e
jn
d
2. Upsampling by a factor L: X
u
(e
j
) = X(e
jL
).
3. Some transform pairs.
x(n) = e
j
0
n
X(e
j
) = 2

m=
(
0
+ 2m)
x(n) = cos(
0
n) X(e
j
) =

m=
((
0
+ 2m) +( +
0
+ 2m))
Continuous-Time Fourier Transform (CTFT)
1. Denition and the inverse transform formula.
X(f) =
_

x(t)e
j2ft
dt
x(t) =
_

X(f)e
j2ft
df
2. Multiplication in the time domain.
If y(t) = x(t)h(t) then Y (f) = X H(f) =
_

X(r)H(f r)dr
3. Some transform pairs.
x(t) =

m=
(t mT) X(f) =
1
T

m=

_
f
m
T
_
x(t) =
sin(at)
at
X(f) =
_
1/a, if a/2 f a/2
0 otherwise
Discrete Fourier Transform (DFT)
1. Denition and the inverse transform formula.
X(k) =
N1

n=0
x(n)e
j2kn/N
x(n) =
1
N
N1

k=0
X(k)e
j2kn/N
2. The DFT of the DFT. If x and X are N-periodic discrete-time signals, X is the N-point DFT of
x, and x

is dened by x

(n) = x(n) then the N-point DFT of the signal X is Nx

.
2
Problem 1 (5 points). The impulse response of a discrete-time LTI system is the signal u(n)u(n3)
where u(n) is the discrete-time unit step signal. Is this system BIBO stable? Fully justify your answer.
Solution. Since the system is LTI and its impulse response is absolutely summable, the system is
BIBO stable.
Problem 2 (5 points). Consider a discrete-time system which is described by the following input-
output equation:
y(n) = [x(n)]
2
+x(n 1).
Is this system linear? Fully justify your answer.
Solution. The system is nonlinear. The inputs (n) and 2(n) result in the outputs (n) +(n 1)
and 4(n) + 2(n 1), respectively. For a linear system, the response to 2(n) must be equal to two
times the response to (n).
3
Problem 3 (5 points). The frequency response of an LTI system is:
H(e
j
) = cos .
Find the response of this system to the following input signal:
x(n) = e
jn/2
for all integer n.
Fully justify your answer.
Solution. Since the input signal is an everlasting complex exponential of frequency = /2, the
response will be equal to the input signal multiplied by the frequency response at = /2, i.e., by
cos(/2) = 0. Therefore, the response is y(n) = 0 for all n.
Problem 4 (5 points). Let x(n) = (1)
n
. Find the discrete-time Fourier transform X
u
(e
i
) of the
following signal x
u
(n):
x
u
(n) =
_
x(n/2) if n is even,
0 if n is odd,
Either a formula or a fully labeled plot would be an acceptable answer. Fully justify your answer.
Solution. x
u
(n) is 1,0,-1,0, periodically repeated, which is cos(n/2). Therefore, using one of the
transform pairs from the formula sheet, we have:
X
u
(e
i
) =

m=
(( /2 + 2m) +( +/2 + 2m)) (1)
Alternatively, note that x(n) = e
jn
and therefore
X(e
j
) = 2

m=
( + 2m),
and
X
u
(e
i
) = X(e
j2
) = 2

m=
(2 + 2m) =

m=
( /2 +m),
which is an equivalent way of writing Eq. (1).
4
LPF 2
x(n)
y(n)
Problem 5 (5 points). The discrete-time system depicted above rst lters the input signal x(n)
with a low-pass lter (LPF), then downsamples the result by a factor of two. Assume that the
frequency response of the LPF is:
H(e
j
) =
_
1, ||

2
0,

2
< ||
Find the response y(n) of the system (i.e., of the entire system shown in the gure) to the following
input signal:
x(n) = cos
_

4
n
_
+ cos
_
3
4
n
_
.
Either a formula or a fully labeled plot would be an acceptable answer. Fully justify your answer.
Solution. Since the cuto frequency of the lter is /2 > /4, the sinusoid of frequency /4 will pass
through the lter. Moreover, since the frequency response of the lter in the passband is 1, this sinusoid
will be unchanged by the lter. The second sinusoid has frequency 3/4 which is in the stopband of
the lter and will therefore will be eliminated. The output of the lter will thus be x

(n) = cos(n/4).
When this signal is downsampled by a factor of two, the result is y(n) = x

(2n) = cos(n/2).
5
Problem 6 (10 points). For each statement below, answer true or false. Do not explain your
answers. No partial credit will be given for this problem.
(a) The impulse response of any BIBO stable LTI discrete-time system is a bounded signal.
(b) The running time of a computer program which computes the DFT of a signal using the FFT
algorithm, will be at most 1000 times slower for a 1048576-point signal than for a 1024-point
signal.
(c) The energy of the discrete-time signal (n) + 2(n 1) is 5.
(d) The discrete-time signal sin(n) is periodic.
(e) If the signal x(n) = 1 is ideally interpolated by a factor of 2, the resulting signal is
y(n) =
_
1, if n is even
0, if n is odd
(Recall that ideal interpolation by a factor of 2 consists of upsampling by a factor of 2, followed
by ideal low-pass ltering with the lter which has the following frequency response:
H(e
j
) =
_
2, ||

2
0,

2
< || )
Solution.
(a) Since the impulse is a bounded signal, the response of any BIBO stable system to it must be a
bounded signal, by denition of BIBO stability. Answer: true.
(b) Since the FFT is an O(N log N) algorithm, increasing the signal length by a factor of 1024 =
1048576/1024 will increase the execution time by a factor of more than 1024. Answer: false.
(c) The energy of this signal is 1
2
+ 2
2
= 5. Answer: true.
(d) As shown in class, in order for a discrete-time sinusoid to be periodic, its frequency has to be a
rational multiple of . Since the frequency of sin(n) is 1 and is not a rational multiple of , this
signal is not periodic. Answer: false.
(e) Using the formula sheet, the DTFT of x(n) = 1 = e
j0n
is
X(e
j
) = 2

m=
( + 2m).
The DTFT of the upsampled signal is therefore
X
u
(e
j
) = X(e
j2
) = 2

m=
(2 + 2m) =

m=
( +m)
After ltering, the component at frequency zero will stay since it is in the passband, and the
component at frequency will be removed since it is in the stopband. Moreover, the DC
component will be multiplied by 2:
Y (e
j
) = X
u
(e
j
)H(e
j
) = 2

m=
( + 2m) = X(e
j
).
Therefore the result of interpolation will be the original signal. Answer: false.
6
Problem 7 (10 points). We dene three continuous-time signals x(t), x
s
(t), and x
r
(t), as follows:
x(t) =
sin(8t)
t
,
x
s
(t) = x(t)

m=
(t m/6),
and x
r
(t) is the result of ltering x
s
(t) with an ideal low-pass lter whose frequency response is:
H(f) =
_
1/6 if 3 f 3
0 otherwise.
(a) Find X(f), the continuous-time Fourier transform of x(t). Either a formula or a fully labeled
plot would be an acceptable answer. Fully justify your answer.
(b) Find X
s
(f), the continuous-time Fourier transform of x
s
(t). Either a formula or a fully labeled
plot would be an acceptable answer. Fully justify your answer.
(c) Find X
r
(f), the continuous-time Fourier transform of x
r
(t). Either a formula or a fully labeled
plot would be an acceptable answer. Fully justify your answer.
(d) Find a time-domain expression for x
r
(t). Simplify as much as possible. Fully justify your answer.
Solution. Using the transform pair from the formula sheet, we have:
X(f) =
_
1, if 4 f 4
0 otherwise
To get the CTFT of x
s
we rst use the property that the multiplication in the time domain corresponds
to the convolution in the frequency domain. This means that X
s
(f) is the convolution of X(f) and
the Fourier transform of the periodic impulse train. Using another transform pair from the formula
sheet, we have:
X
s
(f) = X(f)
_
6

m=
(f 6m)
_
= 6

m=
X(f 6m)
=
_
6 if 6m2 < f < 6m+ 2 for any integer m
12 otherwise
Putting this through the low-pass lter H(f), we cut out all the frequencies outside of |f| 3, and
multiply the frequencies in the range |f| 3 by 1/6:
X
r
(f) =
_
_
_
1 if |f| < 2
2 if 2 |f| 3
0 otherwise.
This can be represented as the dierence between two box functions:
X
r
(f) =
_
2 if |f| 3
0 otherwise.

_
1 if |f| < 2
0 otherwise.
Using the given transform pairs, the inverse transforms for these box functions are 12sinc(6t) and
4sinc(4t), respectively, and therefore,
x
r
(t) = 12sinc(6t) 4sinc(4t).
7
Problem 8 (5 points). Let A be the 8 8 DFT matrix. In other words, the entry in the k-th row
and n-th column of A is:
A
kn
= e
j
2(k1)(n1)
8
, for k = 1, 2, . . . , 8 and n = 1, 2, . . . , 8.
Let matrix C be dened as follows: C = 8
219
A
438
. Find the matrix Ci.e., specify each entry C
kn
in the k-th row and n-th column of C, for k = 1, 2, . . . , 8 and n = 1, 2, . . . , 8.
Solution. This problem is solved by applying the following DFT property: the N-point DFT of the
N-point DFT of x(n) is Nx(n) if x(n) is viewed as an N-periodic signal. If the signal x(n) is viewed
as an N-dimensional vector
x =
_
_
_
_
_
_
_
_
_
x(0)
x(1)
x(2)
.
.
.
x(N 2)
x(N 1)
_
_
_
_
_
_
_
_
_
,
then the time-reversed signal x(n) corresponds to the following n-dimensional vector:
x

=
_
_
_
_
_
_
_
_
_
x(0)
x(1)
x(2)
.
.
.
x(N + 2)
x(N + 1)
_
_
_
_
_
_
_
_
_
=
_
_
_
_
_
_
_
_
_
x(0)
x(N 1)
x(N 2)
.
.
.
x(2)
x(1)
_
_
_
_
_
_
_
_
_
=
_
_
_
_
_
_
_
_
_
1 0 0 . . . 0 0
0 0 0 . . . 0 1
0 0 0 . . . 1 0
.
.
.
0 0 1 . . . 0 0
0 1 0 . . . 0 0
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
x(0)
x(1)
x(2)
.
.
.
x(N 2)
x(N 1)
_
_
_
_
_
_
_
_
_
.
Denoting by D the matrix above whose entries are zeros and ones, we have: x

= Dx. On the other

hand, note that the vector notation for the DFT of the DFT of x is A
2
x. Since this is equal to the
time-reversed version of x multiplied by N, i.e., to Nx

, we have: A
2
x = NDx, and so
D = N
1
A
2
. (2)
Moreover, A
4
corresponds to taking the DFT of the DFT of the DFT of the DFT. By the same
time-reversal property, this operation is equivalent to doing time reversal twice and multiplying by
N
2
. Therefore, for any x we have N
2
A
4
x = x, and so N
2
A
4
is the N N identity matrix. Now
we have all the ingredients for evaluating C:
C =
_
N
2
A
4
_
109
N
1
A
2
= I
109
D = D.
Thus C is equal to the matrix D:
C
kn
=
_
1 for k = n = 1 and for k +n = N + 2
0 for any other pair (k, n)
For N = 8,
C =
_
_
_
_
_
_
_
_
_
_
_
_
1 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1
0 0 0 0 0 0 1 0
0 0 0 0 0 1 0 0
0 0 0 0 1 0 0 0
0 0 0 1 0 0 0 0
0 0 1 0 0 0 0 0
0 1 0 0 0 0 0 0
_
_
_
_
_
_
_
_
_
_
_
_
8