INEL 5309- 111 DSP I EXAM ONE

Prof. Domingo Rodrguez Wednesday, March 2, 2005

SOLUTION
Problem One:
(20 points) Obtain the DTFT of the signal s[n] = x[n] + cos(20 n)e + j n in
d

terms of the DFT of the signal x[n] which is X ( ) =

n =+

x[n]e

j n

n =

Answer to Problem One:

First, we use the linearity property of the DTDT to obtain

DTFT x [n] + cos(20 n)e + jd n = DTFT { x [n]} + DTFT cos(20 n)e + jd n

We then proceed to compute the DTFT of the first component of the right
hand side of the expression above:
DTFT { x [n]} =

n =+

x [n]e

j n

n =

*
n =+

j n
= x [ n]e

n =

*
*
*
n =+
n =+
n =+
j n
j n *
+ j n
x [ n]e
) = x[n]e
= ( x [n]e
n =
n
=

n =

n =+
m =+
*
+ j n
j m

=
x
[
n
]
e

x[m]e
= X ( )
n =
m =

We now proceed to compute the DTFT cos(20 n)e+ jd n .

We start by using the following identity describing a property of the DTFT:

DTFT {e + j n } =

k =+

2 ( + 2 k )

k =

To prove this identity, we proceed as follows:

k =+

IDTFT 2 ( + 2 k ) =
k =

+
1
2

k =+

2 ( + 2 k ) e + j n d
k
=

We continue the process by interchanging the summation and integral signs

+
1
2

k =+

( + 2 k ) e+ j n =
k
=

1
2

k =+

k =

2 ( + 2 k ) e

+ j n

+ j n
2 ( + 2 k ) e d

k =

k =+

1
2

+
d = ( ) e+ j n d = e + j n Q.E.D.

We rewrite the expression cos(20 n)e+ j n as follows

d

cos(20 n)e+ jd n =

1
2

e+ j0 n + 12 e j0 n e + jd n = 12 e

+ j (d +0 ) n

+ 12 e

+ j (d 0 ) n

; 0 = 20

We now let = (d + 0 ) and = (d 0 ) to obtain the following

1
2

+ j (d +0 ) n

+ 12 e

+ j (d 0 ) n

= 12 e + j n + 12 e + j n

INEL 5309- 111 DSP I EXAM ONE

Prof. Domingo Rodrguez Wednesday, March 2, 2005

SOLUTION
Taking the DTFT of 12 e

+ j n

+ 12 e+ j n results in the following

DTFT { 12 e+ j n + 12 e+ j n } = DTFT { 12 e+ j n } + DTFT { 12 e+ j n }

DTFT { 12 e + j n } + DTFT { 12 e + j n } =

k =+

k =+

k =

k =

( + 2 k ) + ( + 2 k )

We, thus, get our final expression for the desired Fourier transform

DTFT {s[n]} = S ( ) = DTFT x [ n] + cos(20 n)e + jd n = X * ( ) + DTFT cos(20 n)e + jd n

S ( ) = X * ( ) + DTFT cos(20 n)e + jd n = X * ( ) +

k =+

k =+

k =

k =

( + 2 k ) + ( + 2 k )

Problem Two:
2

2a.- (20 points) Compute the DFT of the signal x[n] = cos( 24 n ) , n Z 4

Answer to Problem 2a:

2

We first express x[n] = cos( 24 n ) , n Z 4 as x[n] = g[n]g[n], n Z 4 where g[n] is

just a discrete cosine signal; that is, g[n] = cos( 24 n ), n Z 4 :
cos( 24( 0) ) = +1

2 1
cos( 4( ) ) = 0
g=
,
2 ( 2 )
cos( 4 ) = 1

2 ( 3 )
cos( 4 ) = 0

+1 +1 1
0 0 0
2
x = g = = ,
1 1 1

0 0 0

Thus, we have x[n] = { x[0], x[1], x[2], x[3]} = {1, 0,1, 0} as the input signal. We
continue to compute the DFT as follows
n =3

X [k ] = x[n]e

2
kn
4

n=0

= x[o] + x[2]e j k = 1 + (1)e j k ; k Z 4

Evaluating for values of k Z 4 , we obtain

X [k ] = { X [0], X [1], X [2], X [3]} = {2, 0, 2, 0}

2b.- (20 points)

Compute the cyclic convolution of x[n] and h[n] if

x[n] = h[n] = cos( 24 n ) , n Z 4 and provide a matrix representation of the cyclic
convolution operation.
2

Answer to Problem 2b:

We write the equation for the cyclic convolution operation of x[n] and h[n] .
3

y[n] = x[k ]h n k 4 ; k Z 4
k =0

INEL 5309- 111 DSP I EXAM ONE

Prof. Domingo Rodrguez Wednesday, March 2, 2005

SOLUTION
We proceed to write the matrix representation of this operation
h[0]
h[1]
H4 x = y =
h[2]

h[3]

h[3]
h[0]
h[1]
h[2]

h[2]
h[3]
h[0]
h[1]

h[1] 1 1
h[2] 0 0

=
h[3] 1 1

h[0] 0 0

0
1
0
1

1
0
1
0

0 1 2
1 0 0

=
0 1 2

1 0 0

Problem Three:
3a.- (15 points) Determine if the following linear system is a filter:
T { x[n]} = x[ n]

Answer to Problem 3a:

Since the system is linear, we must determine if it is time invariant. If we
have the system equation T { x[n]} = y[n] , then, a system is time-invariant if
T { x[n n0 ]} = y[ n n0 ]

We proceed by computing the right hand side of the above equation

y[n n0 ] = x[ ( n n0 )] = x[ n + n0 ]

We compute the left hand side by first introducing an intermediate step.

Let T { x[n]} = x[n] . We then have
T { g[n]} = g[ n] = x[ n n0 ]

We conclude that the system is NOT A FILTER.

Answer to Problem 3b:

3b.- (10 points) Determine if the following system is a filter:
T { x[n]} = e x (t +1)+ x (t 1)

We can test for homogeneity, a necessary condition for linearity:

T {ax[n]} = aT { x[n]}

We first compute the right hand side of the identity

aT { x[n]} = ae x (t +1) + x ( t 1)

Let T {ax[n]} = g[n] . We then have

T { g[n]} = e g (t +1) + g (t 1) = e ax ( t +1) + ax (t 1)

We conclude that the system is NOT A FILTER.

INEL 5309- 111 DSP I EXAM ONE

Prof. Domingo Rodrguez Wednesday, March 2, 2005

SOLUTION
Problem Four:
(15 points) Classify
the following signals (digital, real, complex,
continuous, etc.) Name all the properties that the signal may possess.

Answer to Problem Four:

a).- x : \ ] 4 ; x(t ) = (t + 1) /(t + 1); t \
a).- The signal is CONTINUOUS and DIGITAL
b).- y L ( ] 8 ) ; y[n] = e

+ j 28 n

; n ]128

b).- The signal is DISCRETE and COMPLEX

c).- s L ( ] ) ; s[n] = n

; n]

c).- The signal is DISCRETE and DIGITAL

d).- g : ] 7 ] 7 ; g[n] = n 2

; n ]7

d).-The signal is DISCRETE and DIGITAL