Tutorial No 2 Solution

Department of Electronics and Telecommunication Engineering
Yeshwantrao Chavan College of Engineering Nagpur

ET317: Digital signal Processing
Tutorial No: 2: Discrete Time Fourier Transform

Course Instructors: Prof. V. R. Gupta, E.T. Department, YCCE, Nagpur.

Q. 1) Compute the DFT of each the following finite length sequences considered to be of length N
(Where N is even).
a) [ ] [ ] x n n o =
b)
0 0
[ ] [ ] 0 1 x n n n n N o = s s
c)
1, 0 1
[ ]
0, 0 1
n even n N
x n
n odd n N
s s
=

s s

d)
1, 0 ( / 2) 1
[ ]
0, ( / 2) 1
n N
x n
N n N
s s
=

s s

e)
, 0 1
[ ]
0,
n
a n N
x n
otherwise
s s
=

Solution: Q. 1a)

We know that the N-point DFT of a Discrete Time Sequence ( ) x n is given by the formula

1
2
0
( ) ( ) 0,1, 2,........., 1
N
j kn
N
n
X k x n e for k N
t

=
= =

Given:
1 0
( ) ( )
0
n
x n n
elsewhere
o
=
= =

Therefore

1
2
0
( ) ( )
( ) 1 0,1, 2,.........., 1
N
j kn
N
n
X k n e
X k for k N
t
o

=
=
= =

Thus we got the important DFT pair as given below

( ) n o
1
DFT
N-point


Solution: Q. 1b)

1
2
0
( ) ( ) 0,1, 2,........., 1
N
j kn
N
n
X k x n e for k N
t

=
= =

Given:
0
0
1
( ) ( )
0
n n
x n n n
elsewhere
o
=
= =

Therefore

0
1
2
0
2
( ) ( )
( ) 0,1, 2,.........., 1
N
j kn
N
n
j kn
N
X k n e
X k e for k N
t
t
o
=
= =

Thus we got the important DFT pair as given below

Solution: Q. 1c)

Given:
1, 0 1
[ ]
0, 0 1
n even n N
x n
n odd n N
s s
=

s s


1
2
0
( ) ( ) 0,1, 2,........., 1
N
j kn
N
n
X k x n e for k N
t

=
= =

( ) n o

0
2 j kn
N
e
t

DFT
N-point


In this question ( ) x n is only present for the even values of n and the sequence ( ) x n is zero for odd values of
n. Hence the length of the sequence is
2
N
. Thus the formula for computing the DFT of this sequence will be as
follows:

2
1
2
2
0
( ) (2 ) 0,1, 2,.........., 1
N
N
j kn
n
X k x n e for k N
t

=
= =

As it is given that, the value of the sequence is 1 for even values of n thus the above equation can be
written as

1
2 4
0
2
( )/
( ) 0,1, 2,.........., 1
1
( )
1
N
j kn
N
n
j k
j k N
X k e for k N
e
X k
e
t
t
t
= =

Thus,
2
2
0,
( )
0
N
N
k
X k
elsewhere
=
=

Solution: Q. 1d)

Given:
1, 0 ( / 2) 1
[ ]
0, ( / 2) 1
n N
x n
N n N
s s
=

s s


1
2
0
( ) ( ) 0,1, 2,........., 1
N
j kn
N
n
X k x n e for k N
t

=
= =



Thus
1
2 2
0
( ) 0,1, 2,........., 1
N
j kn
N
n
X k e for k N
t
=
= =

(2 )/
1
( ) 0,1, 2,........., 1
1
j k
j k N
e
X k for k N
e
t
t
= =

2
(2 )/
0
2
( )
1
0 , 0 ( 1)
N
j k N
k
X k k odd
e
k even k N
t
=
s s

Solution: Q. 1e)

Given:
, 0 1
[ ]
0,
n
a n N
x n
otherwise
s s
=


1
2
0
( ) ( ) 0,1, 2,........., 1
N
j kn
N
n
X k x n e for k N
t

=
= =

Thus,

1
2
0
( ) 0,1, 2,........., 1
N
j kn
n
N
n
X k a e for k N
t

=
= =

1
2
0
( ) 0,1, 2,........., 1
n
N
j k
N
n
X k ae for k N
t

=
| |
= =
|
\ .

2
(2 )/
1
( ) 0,1, 2,........., 1
1
N j k
j k N
a e
X k for k N
ae
t
t
= =

(2 )/
1
( ) 0,1, 2,........., 1
1
N
j k N
a
X k for k N
ae
t
= =



Q. 2) Consider the complex sequence
0
, 0 1
[ ]
0,
j n
e n N
x n
otherwise
e
s s
=

a) Find the Fourier transform X(e
jw
) of x[n].
b) Find the N-point DFT X[k] of the finite-length sequence x[n].
c) Find the DFT of x[n] for the case
0
0
2 k
N
t
e = , where k
0
is an integer.

Solution: Q. 2a)
The Fourier transform X(e
jw
) of x[n] is given by the formula.

( ) ( )
j j n
n
X e x n e
e e
=
=

0
1
0
( )
N
j n j j n
n
X e e e
e e e

=
=

0
1
( )
0
( )
N
j n j
n
X e e
e e e

=
=

0
0
( )
( )
1
( )
1
j N
j
j
e
X e
e
e e
e
e e

0
0
0
0
0
0
( )
2
( )
( )
2
2
( )/ 2
( )/ 2
( )/ 2
1
( )
1
N
j
N
N
j
j
j
j
j
j
e
e
e
X e
e
e
e
e e
e e
e e
e
e e
e e
e e

(
(
(
=
(
(
(

0 0
0
0
0 0
( ) ( )
2 2
( )
( )/ 2
2
( )/ 2 ( )/ 2
( )
N N
j j
N
j
j j
j j
e e
X e e e
e e
e e e e
e e
e e e
e e e e

(
| |

(
=
|
(
\ .
(



0 0
0
0 0
( ) ( )
1
2 2
( )
2
( )/ 2 ( )/ 2
( )
N N
j j
N
j
j
j j
e e
X e e
e e
e e e e
e e
e
e e e e

| |

|
\ .

(
| |

(
= |
( |

\ .
(

0
1
0
( )
2
0
2sin ( )
2
( )
( )
2sin
2
N
j
j
N
X e e
e e
e
e e
e e
| |

|
\ .
(
| |
|
(
| |
\ .
( = |
|

| |
(
\ .
|
(
\ .

0
1
0
( )
2
0
sin ( )
2
( )
( )
sin
2
N
j
j
N
X e e
e e
e
e e
e e
| |

|
\ .
(
| |
|
(
| |
\ .
( = |
|

| |
(
\ .
|
(
\ .

Solution: Q. 2b)

Given:
0
, 0 1
[ ]
0,
j n
e n N
x n
otherwise
e
s s
=


1
2
0
( ) ( ) 0 1
N
j kn
N
n
X k x n e for k N
t

=
= s s

0
1
2
0
( ) 0 1
N
j kn
j n
N
n
X k e e for k N
t
e

=
= s s

0
1
2
0
( ) 0 1
n
N
j k
j
N
n
X k e e for k N
t
e

=
| |
= s s
|
\ .

0
2
1
0
( ) 0 1
n
k
N
j
N
n
X k e for k N
t
e
( | |

| (
\ .
=
| |
| = s s
|
\ .



0
0
2
2
1
( )
1
k
j N
N
k
j
N
e
X k
e
t
e
t
e
( | |

| (
\ .
( | |

| (
\ .

0
0
0
0 0
0
2
2
2
2
2
2
2 2
2 2
2
2
1
( )
1
k N
j
N
k N
k N
j
j
N
N
j k j k
N N
j k
N
e
e
e
X k
e e
e
t
e
t
t
e
e
t t
e e
t
e
( | |

| (
\ .
( | |
( | |

| (
| (
\ .
\ .
( ( | | | |

| | ( (
\ . \ .
( | |

| (
\ .
(
(
(
(
=
(
(
(

0 0
0 0
0 0
2 2
2 2
2 2
2 2
2 2
2 2
( )
k N k N
j j
k N j k
N N
j
N N
j k j k
N N
e e
X k e e
e e
t t
e e
t t
e e
t t
e e
( ( | | | |

| | ( (
( ( | | | |
\ . \ .

| | ( (
\ . \ .
( ( | | | |

| | ( (
\ . \ .
(
| |
(
| =
(
|
\ . (

0
2 1 0
2
0
2
2sin
2
( )
1 2
2sin
2
k N
j
N
k N
N
X k e
k
N
t
e
t
e
t
e
( | | | |

| | (
\ . \ .
(
| |
(
| |
( | |
(
| |
\ .

\ .
(
| =
( |
| |
(
| |
\ .

(
| |
(
\ . (
\ .

0
2 1 0
2
0
2
sin
2
( )
1 2
sin
2
k N
j
N
k N
N
X k e
k
N
t
e
t
e
t
e
( | | | |

| | (
\ . \ .
(
| |
(
| |
( | |
(
| |
\ .

\ .
(
| =
( |
| |
(
| |
\ .

(
| |
(
\ . (
\ .

Note that
2
( ) ( )
j
k
N
X k X e
e
t
e=
=

Solution: Q. 2c)
Here we need to compute the DFT of x[n] for the case
0
0
2 k
N
t
e = , where k
0
is an integer. To find this we
need to replace
0
0
2 k
N
t
e = in the solution of Q. 2b)



1
2
0
( ) ( ) 0 1
N
j kn
N
n
X k x n e for k N
t

=
= s s

0
1
2 2
0
( ) 0 1
N
j k n j kn
N N
n
X k e e for k N
t t

=
= s s

0
1
2 ( )
0
( ) 0 1
N
j k k n
N
n
X k e for k N
t

=
= s s

0
0
2 ( )
2 ( )
1
( )
1
j k k
k k
j
N
e
X k
e
t
t

( )
( )
0
2 1
( )
0 2
0
sin ( )
( )
sin ( ) /
N
j k k
N
k k
X k e
k k N
t
t
t
| |

|
\ .
| |
(
= |
(
|

\ .

Q. 3) Find the N-point DFT of the following finite duration sequence of length L (N>=L)

, 0 1
[ ]
0,
A n L
x n
otherwise
s s
=

Solution: Q. 3)

Given:
, 0 1
[ ]
0,
A n L
x n
otherwise
s s
=


1
2
0
( ) ( ) 0 1
N
j kn
N
n
X k x n e for k N
t

=
= s s

1
2
0
( ) 0 1
L
j kn
N
n
X k Ae for k N
t

=
= s s



1
2
0
( )
L
j kn
N
n
X k A e
t

=
=

2 /
2
1
( )
1
j kL N
k
j
N
e
X k A
e
t
t
(
=
(

( 1)/
sin( / )
( )
sin( / )
j L N
kL N
X k Ae
k N
t
t
t

(
=
(

Q. 4) Compute the DFT of the following sequence x(n)= [0, 1, 2, 1] and check the validity of your
answer by calculating its IDFT.
Try to solve this question by your own.

Q. 5) Let ( )
j
X e
e
denote the Fourier transform of the sequence
1
[ ] ( )
2
n
x n u n
| |
=
|
\ .
. Let [ ] y n denote
a finite duration sequence of length 10; i.e., [ ] 0, 0, [ ] 0, 10. y n n and y n n = < = > The 10-point
DFT of [ ] y n , denoted by [ ] Y k , corresponds to 10 equally spaced samples of ( )
j
X e
e
i.e.,
2 /10
[ ] ( )
j k
Y k X e
t
= . Determine [ ] y n .

Solution: Q. 5)

We know that, Fourier transform of the sequence
1
[ ] ( )
2
n
x n u n
| |
=
|
\ .
is given by
( ) ( )
j j n
n
X e x n e
e e
=
=

0
1
( )
2
n
j j n
n
X e e
e e
=
| |
=
|
\ .

0
1
( )
2
n
j j
n
X e e
e e
=
| |
=
|
\ .



1
( )
1
1
2
j
j
X e
e
e
e
=

To find [ ] Y k , will take 10 equally spaced samples of ( )
j
X e
e

2 /10
( ) ( ) , 0 9
j
k
Y k X e k
e
e t =
= s s

Thus we have the 10-point DFT of [ ] y n

(2 /10)
1
( ) , 0 9 (1)
1
1
2
j k
Y k k
e
t
= s s

But here we are asked to find [ ] y n . So we need to take IDFT of ( ) Y k . But here I will use the formula of
DFT which will give us the relationship between [ ] y n and ( ) Y k

2
10
9
0
( ) [ ] 0 9 (2)
j kn
n
Y k y n e k
t
=
= s s

Recall that
point DFT
(2 / )
1
(3)
1
N
N n
j k N
a
a
ae
t

So, by comparing equation number 1, 2 and 3, we may infer that
10
1
2
[ ] , 0 9
1
1
2
n
y n n
| |
|
\ .
= s s
| |
|
\ .



Solve the following questions
Q. 1) Determine the 8-point DFT of the sequence
1 0 3
[ ]
0
n
x n
otherwise
s s

Q. 2) Determine the 8-point DFT of the sequence [ ] {1, 2, 3, 4} x n =
[ ] cos
5
n
x n
t
| |
=
|
\ .

1
[ ] 2 ( ) 4 ( 1) 2 ( 2) 4 ( 3) x n n n n n o o o o = +

2
[ ] ( ) 6 ( 1) 3 ( 3) x n n n n o o o = + +

Unsolved Problems from the book: Digital signal processing: Principles, Algorithms, and
Applications by J ohn G. Proakis & D. G. Manolakis, Fourth Edition.
Chapter No. 7
Problem Nos.: 7.1, 7.5, 7.6, 7.12, 7.16, 7.17, 7.23


Some Basic Formulas are required for solving these numerical which are as follows:

2
2
1
2
0
1
0
1
2
0
1
0
: ( ) ( ) 0 1
( ) ( ) 0 1; ,
1
: ( ) ( ) 0 1
1
( ) ( ) 0 1; ,
j
N
j
N
N
j kn
N
n
N
kn
N N
n
N
j kn
N
n
N
kn
N N
n
DFT X k x n e for k N
OR
X k x n W for k N where W e
IDFT x n X k e for n N
N
OR
x n X k W for k N where W e
N
t
t
t
t
=
= s s
= s s =
= s s
= s s =

2
1 2
1
1 2
1
1 1
1
1
N
n
N N
N
N N for a
a
a a
for a
a
+
+ + =
=

=

1
0
1
1
1
1
N
n
N
N for a
a
a
for a
a
=

=

cos sin
i
e i
u
u u
=

2
cos(2 ) sin(2 ) cos(2 ) 1 for all the valuesof
sin(2 ) 0 for all the valuesof
j k
e k i k k k
k k
t
t t t
t
= = =
=
1
cos( ) sin( ) cos( )
1
sin( ) 0 for all the values of
j k
for k even
e k i k k
for k odd
k k
t
t t t
t

= = =

Tutorial No 2 Solution

Enviado por

Dados do documento

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

Tutorial No 2 Solution

Enviado por

Direitos autorais:

Formatos disponíveis

Department of Electronics and Telecommunication Engineering

Yeshwantrao Chavan College of Engineering Nagpur

Você também pode gostar