Prof. Rani Alex Sense Vit - CC

DFT
Prof. Rani Alex

SENSE
VIT -CC
Sampling the Fourier Transform
Consider an aperiodic sequence with a Fourier transform
x[n] DTFT
 X e j  
Assume that a sequence is obtained by sampling the DTFT
~
 
Xk   X e j 
 X e j2 / Nk
  2  / Nk

Since the DTFT is periodic resulting sequence is also periodic
We can also write it in terms of the z-transform
~
 
Xk  Xz z  e2  /Nk  X e j2 / Nk
The sampling points are shown in figure

~ could be the DFS of a sequence
Xk  ~ 1 N1 ~
Write the corresponding sequence x[n]   Xk e j2  / N kn
N k 0
Sampling the Fourier Transform cont’d
The only assumption made on the sequence is that DTFT exist
~
    xme 
Xk   X e j2 / Nk  1 N1 ~

Xe j  jm ~
x[n]   Xk e j2  / Nkn
m   N k 0
Combine equationNto get
~ 1 1 
 
x[n]     xme j2  / Nkm e j2 / Nkn
N k  0 m   

 1 N1 j2  / Nk nm  
~
  xm  e    xmp n  m
m   N k  0  m  
Term in the parenthesis is
~ 1 N1 j2  / Nk n m 
p n  m   e   n  m  rN
N k 0 r  
So we get  
x [n]  xn   n  rN  
~
 xn  rN 
r   r  
• Samples of the DTFT of an aperiodic sequence
• can be thought of as DFS coefficients
• of a periodic sequence
• obtained through summing periodic replicas of original sequence
• If the original sequence
• is of finite length
• and we take sufficient number of samples of its DTFT
• the original sequence can be recovered by
~x n 0  n  N  1
xn  
 0 else
• It is not necessary to know the DTFT at all frequencies
• To recover the discrete-time sequence in time domain
• Discrete Fourier Transform
• Representing a finite length sequence by samples of DTFT
DFT
 j ( 2 / N )
Notation WN  e
 N 1
 X (k )WN kn 0  n  N 1
Synthesis x ( n)   k  0
Both have
Period N
0 otherwise
 N 1
Analysis  x(n)WNkn 0  n  N 1
X (k )   n 0
0 otherwise
DFT using Matrix method
F(k) is the DFT of f(n) then,
Example
Calculate DFT of f(n) using matrix method

Example contd..
𝑊4 = 𝑒 −𝑗2𝜋/4 𝑤41 = 𝑒 −𝑗2𝜋/4 =𝑒 −𝑗𝜋/2 =-j 𝑤41 = 𝑒 −𝑗2𝜋∗3/4 =

𝑤42 = 𝑒 −𝑗2𝜋∗2/4 =𝑒 −𝑗𝜋 =-1
𝑒 𝑗𝜋/2 =j
Inverse Discrete Fourier Transform
𝑓(0) 𝐹(0)
𝑓(1) 𝐹(1)
𝑓(2) 1 ∗ 𝐹(2)
= 𝐷 where D is the NxN matrix
𝑓(3) N 𝐹(3)
…. …. 𝐴 = 𝜋𝑟
𝑓(𝑁) 𝐹(𝑁)
Properties of DFT
Linearity
x1 (n)  X 1 (k )
DFT
x2 (n)  X 2 (k )
DFT
ax1 (n)  bx2 (n)  aX1 (k )  bX 2 (k )

DFT
Circular Shift of a Sequence
~
x (n)  x(( n  m)) N 0  n  N 1
x1 (n)   1
0 otherwise
x(n) 
 X (k ) DFT
 j ( 2 / N ) m
x((n  m)) N , 0  n  N  1
 e DFT
X (k )
Complex Conjugate symmetry 𝑥 ∗ (𝑛) = 𝑋 ∗ (−𝑘)= 𝑋 ∗ (𝑁 − 𝑘)

Duality
x(n)  X (k )
DFT
X (n) 
 Nx((k )) N , 0  k  N  1
DFT
Circular Convolution
x1 (n)  X 1 (k )
DFT
x2 (n)  X 2 (k )
DFT
N 1
x3 (n)   x1 (m) x(( n  m)) N  x1 (n)x2 (n)
m 0
x3 (n)  x1 (n)x2 (n)  X 3 (k )  X1 (k ) X 2 (k )

DFT
Using matrix method
Let g(n)={1,2,0,1},h(n) ={2,2,1,1}. Find y(n)= circular convolution of
g(n),h(n).
h(n) ={2,2,1,1} - h(-n) =h(4-n)={2,1,1,2}
𝑦(0) 2112 1 6
𝑦(1) 2211 2 7
= =
𝑦(2) 1221 0 6
𝑦(3) 1122 1 5
Multiplication of Two sequences
x1 (n)  X 1 (k )
DFT
x2 (n) 
 X 2 (k )
DFT
x1 (n) x2 (n) 1 / N ( X 1 (k )  X 2 (k ))

DFT
Linear Convolution Using the DFT
• FFT (Fast Fourier Transform) exists.
• But., we have to ensure that circular convolving nature of DFT gives
the linear convolving result
Procedure
Let x1(n) and x2(n) be two sequences of length L and P, respectively.
1. Compute N-point (N = ?) DFTs X1(k) and X2(k).
2. Let X3(k) = X1(k) X2(k), 0  k  N1.
3. Let x3(n) = DFT1[X3(k)] = x1(n)  x2(n).
Circular Convolution as Linear Convolution
with Time Aliasing
x1(n)  Length L x1 (n) 

FT
X 1 ( e j )
x2(n)  Length P x2 (n) 
FT
X 2 ( e j )
x(n) = x1(n)*x2(n)  Length L+P1 x(n)  X (e j )  X 1 (e j ) X 2 (e j )

FT
DFT Problems
1. Find IDFT of F(k)={5,0,1-j,0,1,0,1+j,0}
2. Compute the missing coefficients of 8 pt DFT of a real sequence x(n),
where X(k) ={ 2, 3-4j,x,x ,4, 5+6j,3+7j,x} , hence find Ck .
3. If X(k) is the DFT of x(n)={1,1,1,1,0,0,0,0}, then find the DFT of x1(n)
= {1,1,0,0,0,1,1} in terms of X(k)
4. Assume you had been asked to analyze the spectrum of an audio
signal of 1 minute with high frequency of the signal is not greater than
20kHz. What are the methods, would you choose to analyze the signal,
justify your thoughts.
DFT Problems
5. Find the system response of an FIR filter with an impulse response
h(n)={1,2,4}to the input sequence x(n)={1,2} using only circular
convolution.
6. A discrete time system with input x(n) and output y(n) is described in
frequency domain by the relation
𝑑
𝑌 𝑒 𝑗𝑤 = 𝑒 −𝑗2𝑤 𝑋 𝑒 𝑗𝑤 + 𝑋 𝑒 𝑗𝑤
𝑑𝑤
Compute the impulse response of the system.

Prof. Rani Alex Sense Vit - CC

Uploaded by

Copyright:

Available Formats

Prof. Rani Alex Sense Vit - CC

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Prof. Rani Alex Sense Vit - CC

Uploaded by

Copyright:

Available Formats

DFT

Prof. Rani Alex

The sampling points are shown in figure

Calculate DFT of f(n) using matrix method

𝑊4 = 𝑒 −𝑗2𝜋/4 𝑤41 = 𝑒 −𝑗2𝜋/4 =𝑒 −𝑗𝜋/2 =-j 𝑤41 = 𝑒 −𝑗2𝜋∗3/4 =

ax1 (n)  bx2 (n)  aX1 (k )  bX 2 (k )

Complex Conjugate symmetry 𝑥 ∗ (𝑛) = 𝑋 ∗ (−𝑘)= 𝑋 ∗ (𝑁 − 𝑘)

x3 (n)  x1 (n)x2 (n)  X 3 (k )  X1 (k ) X 2 (k )

x1 (n) x2 (n) 1 / N ( X 1 (k )  X 2 (k ))

x1(n)  Length L x1 (n) 

x(n) = x1(n)*x2(n)  Length L+P1 x(n)  X (e j )  X 1 (e j ) X 2 (e j )

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.