0% found this document useful (0 votes)
4 views12 pages

DFT Properties_Tutorial _Answers

The document contains tutorial problems related to the Discrete Fourier Transform (DFT) for the Department of Electronics and Communication Engineering at KGiSL Institute of Technology. It includes computations for DFT of sequences, circular convolution using DFT, and properties such as time reversal and circular time shift. The solutions to the problems are provided, demonstrating the application of DFT in various scenarios.

Uploaded by

smartmukil005
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
0% found this document useful (0 votes)
4 views12 pages

DFT Properties_Tutorial _Answers

The document contains tutorial problems related to the Discrete Fourier Transform (DFT) for the Department of Electronics and Communication Engineering at KGiSL Institute of Technology. It includes computations for DFT of sequences, circular convolution using DFT, and properties such as time reversal and circular time shift. The solutions to the problems are provided, demonstrating the application of DFT in various scenarios.

Uploaded by

smartmukil005
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

KGiSL Institute of Technology

(An Autonomous Institution)


Affiliated to Anna University, Approved by AICTE, Recognized by UGC,
Accredited by NAAC & NBA (B.E-CSE,B.E-ECE, [Link]-IT),
365, KGiSL Campus, Thudiyalur Road, Saravanampatti, Coimbatore – 641035.

Department of Electronics and


Communication Engineering
Properties of DFT – Tutorial(Answers)

[Link]
Dean and Professor
Tutorial Problems
1. Compute the 4-point DFT of the sequence x(n)=(1, 1, 2,
2). Also, find Y(k) if y(n)=x((-n))N , 0 ≤ k ≤ 3.

2. If the DFT of a 4-point sequence x(n) is {-2, 3-3j, 0,


3+3j}, compute the DFT of the sequence x((n-2))4.

3. The first five points of the 8-point DFT of a real valued


sequence are {28, -4+9.657j, -4+4j, -4+1.657j, 0}.
Determine remaining three points of the DFT.

4. Compute the circular convolution of the following two


sequences using DFT.x1(n) = {1,3,5,7} and x2(n) =
{1,2,2,1}. Verify the result using time domain method.

Department of ECE
Problem-1
The DFT of x[n] = {1, 1,2, 2}
 X (0)  1 1 1 1   x(0)  1 1 1 1  1 
 X (1)  1  j  1 j   x(1)  1  j 1 j  1 
     
 X ( 2)  1  1 1  
 1 x( 2)  1  1 1  1   2
       
 X (3)  1 j  1  j   x(3)  1 j 1  j   2
 (1 1)  (1 1)  (1 2)  (1 2)   11 2  2   6 
(1 1)  (  j  1)  ( 1 2)  ( j  2)  1  j  2  2 j   1  j
    
 (1 1)  ( 1 1)  (1 2)  ( 1 2)   1 1  2  2   0 
     
(1 1)  ( j  1)  ( 1 2)  (  j  2)  1  j  2  2 j    1  j

Ans: X(k) = {6, -1+j, 0, -1-j}

Department of ECE DFT part-II 3


Time Reversal
Therefore, X(k) = {6, -1+j, 0, -1-j}

As y(n)=x((-n))N , 0 ≤ k ≤ 3, Using time reversal property

DFT{y(n)} = DFT{x((-n))N}

Y(k)=X((-k))N = {6, -1-j, 0, -1+j}

Department of ECE
Problem-2
If the DFT of a 4-point sequence is {-2, 3-3j, 0, 3+3j}.The DFT of the
sequence x((n-2))4.
Using circular time shift property, DFT{x((n-l))N} = e-j2πkl/N.X(k)
Therefore, DFT{x((n-2))4} = e-j2πk2/4.X(k)= e-j4πk/4.X(k) =e-jπk.X(k)
k=0, e-jπ(0).X(0) = e0x10 = 1x(-2) =-2
k=1, e-jπ(1).X(1) = e-jπx(2-2j) = (cosπ-jsinπ)x(-2+2j) = (-1-j0)x(3-3j)
= -3+3j
k=2, e-jπ(2).X(2) = e-j2πx(2) = (cos2π-jsin2π)x(2) = (1-j0)x(0)
=0
k=3, e-jπ(3).X(3) = e-j3πx(3) = (cos3π-jsin3π)x(3)
= (-1)x(3+3j) = -3-3j
Therefore, DFT{x((n-2))4} = {-2, -3+3j, 0, -3-3j}

Department of ECE
Problem-3
Problem: The first five points of the 8-point DFT of a real valued
sequence are {28, -4+9.657j, -4+4j, -4+1.657j,
0}. Determine remaining three points of the DFT.

The first 5 points are, X(0) =28, X(1) = -4+9.657j, X(2) =-4+4j,
X(3) = -4+1.1.657j, X(4) = 0

Department of ECE
Conjugate Symmetry
Using complex conjugate property: X(k) = X*(N-k)

X(5) = X*(8-5) = X*(3) = -4-1.657j

X(6) = X*(8-6) = X*(2) = -4-4j

X(7) = X*(8-7) = X*(1) = -4-9.657j

Therefore, the remaining three points are {-4-1.657j,-4-4j,


-4-9.657j}

Department of ECE
Problem-4
Problem: Compute the circular convolution of the following
two sequences using DFT.x1(n) = {1,3,5,7} and x2(n) =
{1,2,2,1}. Verify the result using time domain method.

Using circular convolution property,


DFT{x1(n) ⨂ x2(n)} = X1(k).X2(k)
Therefore, x1(n) ⨂ x2(n) = IDFT { X1(k).X2(k)}
X 1 ( k )  DFT {x1 (n)}
 X 1 (0)  1 1 1 1   x1 (0)  1 1 1 1  1 
 X (1)  1  j 1 j   x (1)  1  j 1 j   3
 1   1   
 X 1 (2)  1 1 1  1 x1 (2)  1
  1 1  1  5 
       
 1
X (3)  1 j 1  j   x1 (3)  1 j 1  j  7 
Department of ECE
 1  3  5  7   16 
1  3 j  5  7 j    4  4 j 
  
 1 3  5  7    4 
   
1  3 j  5  7 j    4  4 j 
X 1 ( k )  {16,  4  4 j ,  4,4  4 j}
X 2 ( k )  DFT {x2 ( n)}
 X 2 (0)  1 1 1 1   x2 (0)  1 1 1 1  1 
 X (1)  1  j  1 j   x (1)  1  j 1 j   2
 2   2   
 X 2 ( 2)  1  1 1  1   x2 ( 2)  1 1 1  1   2
       
 X 2 (3)  1 j  1  j   x2 (3)  1 j 1  j  1 
 1 2  2 1   6 
1  2 j  2  j    1  j 
  
 1  2  2 1   0 
   
1  2 j  2  j   1  j 
X 2 ( k )  {6,  1  j ,0,  1  j}

Department of ECE
Let Y ( k )  X 1 ( k ). X 2 ( k )  {16  6, ( 4  4 j )  ( 1  j ),  4  0, ( 4  4 j )  ( 1  j )}
 {96, 8, 0, 8}
IDFT X 1 ( k ). X 2 ( k )  IDFT Y ( k )
* *
 y (0)   1 1 1 1  Y * (0)    1 1 1 1  96 
 y (1)    *    8 
  1  1  j 1 j  Y (1)     1
1  j 1 j 
  
 y ( 2)  N  1 1 1  1  Y * ( 2)   4  1 1 1  1  0  
          
 y ( 3)  
 1 j 1  j Y *
(3) 
 
 1 j 1  j  8 
*
  96  8  0  8   112  28
     
1  96  8 j  0  8 j   1  96  24
  
4   96  8  0  8   4  80  20
     

 96  8 j  0  8 j   96  24

Therefore, x1(n) ⨂ x2(n) = {28,24,20,24}

Department of ECE
• Verification using time domain method
y(n)=x1(n) ⨂ x2(n)
 x1 (0) x1 (3) x1 ( 2) x1 (1)   x2 (0) 
 x (1) x1 (0) x1 (3) x1 ( 2)   x (1) 
 1  2 
 x1 ( 2) x1 (1) x1 (0) x1 (3)   x2 ( 2) 
  
 x1 (3) x1 ( 2) x1 (1) x1 (0)   x2 (3) 
1 7 5 3 1  1  14  10  3  28
3 1 7 5 2  3  2  14  5   24
      
5 3 1 7  2  5  6  2  7   20
      
7 5 3 1  1   7  10  6  1   24

Department of ECE

You might also like