[go: up one dir, main page]

0% found this document useful (0 votes)
81 views2 pages

Exam II Inel5309 f06

Download as pdf or txt
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 2

INEL 5309 080 DSP I November 12, 2006

PARTIAL EXAM II Due Date: November 17, 2006, before 11:59PM


Prof. Domingo Rodrguez

Name:____________________________________ID. No.___________

Problem One (20 points): Properties of the DTFT


Obtain the DTFT of the signal s[n] x[n] cos(20 n)e j n in terms of the
d

DTFT of

x[n] which is given by

X ( )

x[n]e

j n

. Please, show all

works.

Problem Two:
a.- (10 points) Use two delayed unit delta sequences (you select the value of
n0 ) [ n n0 ], n Z 4 (on the right hand side of the identity) and two
complex exponential sequences (you select the value of k0 )
j

2nk 0

4 , n Z , (on the left hand side of the identity) to establish the


e
4
following identity known as the frequency-domain cyclic convolution
theorem:

DFTx[n] v[n] 14 DFTx[n] 4 DFTv[n]

Here, the symbol " " indicates Hamadard or point-by-point multiplication.


The symbol " " indicates cyclic or circular convolution. Remember and try
to use the following identities to solve this problem:
DFT s[n] [ n n0 4 ] e

2 kn0
4

; n, k Z 4

2 nk0
j

DFT g[n] e 4 [ k k0 4 ]; n, k Z 4

b.- (10 points) Compute the cyclic convolution of the given discrete signals
x[n] [n n1 ], n1 5, n Z8 and h[n] [n n0 ], n0 4, n Z8 . Please, show all
work.
c.- (10 points) Use "Problem One b" above to establish the relationship
below in matrix form. Both sides of the identity must be expressed in matrix
form!

x[n] 8 h[n] DFT-1DFTx[n] DFTh[n]

Again, here, the symbol " " indicates Hamadard or point-by-point


multiplication. The symbol " " indicates cyclic or circular convolution.

INEL 5309 080 DSP I November 12, 2006


PARTIAL EXAM II Due Date: November 17, 2006, before 11:59PM
Prof. Domingo Rodrguez

Name:____________________________________ID. No.___________

Problem Three (25 points): Filtering Operation


The

has the impulse response


h[n ] 1,1,1,1,1,1,1,1, n Z 8 . Use the DFT to compute the cyclic
convolution of the signal h[n ] 1,1,1,1,1,1,1,1, n Z 8 and the input
cyclic harmonic filter

signal x[n ] e

THARM

2nk0
8

, n Z 4 ; k 0 4 . Show all works in detail.


1

Note: The IDFT is given by FN 1 FN where FN


N

is the matrix

representation of the DFT and * denotes complex conjugation.

Problem Four (25 points total)


(4a.- 10 points) The signal v[n] is result of the sum of two delayed unit
deltas resulting in v[n] [n] [n 3], n Z N . This signal v[n] is used as
input to a signal shifting system G represented by the matrix G4 below.
The output g[n] of the system is obtained by multiplying the matrix
representing the system times the input sequence, expressed in columnvector form. Compute the DTFT of the input signal v[n] and the DFT of the
output signal g[n] of the given system G if the DTFT of any sequence, say
x[n] , of length N is given by:
N 1

DTFT x[n] X e j x[n]e j n ; R


n 0

0
0
G4
1

0
0
0
1

1
0
0
0

0
1
0

(4b.- 15 points) Repeat part 4a of this problem if the input signal is


changed to v[n ] [n ] [n 3] [n 4] [n 7] and the system matrix G4 is
substituted by the DFT matrix of order 8 8 .

You might also like