Scribd
Upload
13 views1 page

HW 5

This document contains 5 questions related to signals and systems. Question 1 asks to calculate the inverse DTFT of a given function. Question 2 expresses the DFT of a sequence as a linear combination of its even and odd parts. Question 3 computes the DFT of a given vector using the approach in Question 2. Question 4 relates the Fourier series coefficients of a DTFT to the original time domain sequence. Question 5 involves properties of the DFT matrix including its relation to the identity matrix.

Uploaded by

dream test
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views1 page

HW 5

This document contains 5 questions related to signals and systems. Question 1 asks to calculate the inverse DTFT of a given function. Question 2 expresses the DFT of a sequence as a linear combination of its even and odd parts. Question 3 computes the DFT of a given vector using the approach in Question 2. Question 4 relates the Fourier series coefficients of a DTFT to the original time domain sequence. Question 5 involves properties of the DFT matrix including its relation to the identity matrix.

Uploaded by

dream test
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

IERG 2051 & ENGG 2030

Signals and Systems


Problem Set 5
Due date: 18 Nov 2013
Question 1:
Calculate the inverse DTFT of X(ejω ) defined as
1
X(ejω ) =
(1 − ae−jω )2

where |a| < 1.


Question 2:
Let
DF T
(x[0], x[1], x[2], · · · , x[2N − 2], x[2N − 1]) ←→ (X[0], X[1], . . . , X[2N − 1]).

Let y[n] = x[2n], n = 0, .., N − 1 be the even part of x[n].


DF T
(y[0], y[1], · · · , y[N − 2], y[N − 1]) ←→ (Y [0], Y [1], . . . , Y [N − 1]).

Let z[n] = x[2n + 1], n = 0, .., N − 1 be the odd part of x[n].


DF T
(z[0], z[1], · · · , z[N − 1], z[N − 1]) ←→ (Z[0], Z[1], . . . , Z[N − 1]).

Note: For k ≥ N, Y (k) is defined as Y (k − N ) (its periodic extension), and similarly for Z(k).

Express X(k) as a linear combination of Y (k) and Z(k), for k = 0, ..., 2N − 1.

Question 3:
Compute the DFT of the following vector

[1, −1, 2, −2, −1, 1, −2, 2].


2π 1
Note that ej 8 = √
2
(1 + j).
(Hint: Use the ideas of splitting into even and odd recursively, as in the previous question, to simplify
your computations.)

Question 4:
The DTFT of a sequence x[n] is X(jω). Since X(jω) is periodic we can compute a Fourier series
jωk
P
representation for it as X(jω) = k ak e . Then compute the relation between the sequences ak
and x[n].

Question 5:
Let x = [x(0) · · · x(N − 1)]T be a discrete sequence. Let X = [X(0) · · · X(N − 1)]T be its discrete
Fourier transform. [4+5+6+5 marks]
j2π
i. If X = Ax, where A is a N × N matrix; express A ≡ [akn ] in terms of ωN = e− N .
1
ii. Prove that N
AA† †
= IN , where A - the conjugate transpose; IN - the identity matrix.
1
iii. Let y = N
AAx, then compute y(i), 0 ≤ i ≤ N − 1.
iv. Prove that N12 A4 = IN where IN is the identity matrix.

You might also like