Discrete Fourier Transform
• We often do not have an infinite amount of data which is required by
DTFT
• For example in a computer we cannot calculate uncountable infinite
(continuum) of frequencies as required by DTFT
• Thus, we use DTF to look at finite segment of data
• We only observe the data through a window
• In this case the xo[n] is just a sampled data between n=0, n=N-1 (N points)
Discrete Fourier Transform
• It turns out that DFT can be defined as
• Note that in this case the points are spaced 2pi/N; thus the resolution
of the samples of the frequency spectrum is 2pi/N.
• We can think of DFT as one period of discrete Fourier series
A short hand notation
remember:
Inverse of DFT
• We can obtain the inverse of DFT
• Note that
• Find DFT of sequence x(n)={1,0,2,3}
Ans
• 1)X(k)={6,-1+3j,0,-1-3j}
2)Find DFT of sequence x(n)={1,0,-1,2}
Ans
X(k)={2,2+2j,-2,2-2j}
Find IDFT of sequence
• X(k)={4,1-j,-2,1+j}
Ans
• X(n)={1,2,0,1}
DFT of Standard Signals
DFT Properties
1)Graphical Method
2)Matrix Method
• Find circular convolution using graphical method
X(n)={1,2,1,-2}
H(n)={3,-2,1,-3}
Ans:-
• Y(n)={2,-1,6,-9}
Circular Convolution using Matrix Method
Perform circular convolution using graphical and matrix method
X1(n)={1,2,2,1}
X2(n)={1,2,3,1}
Matrix method
• https://www.slideshare.net/sarang1689/circular-convolution
Linear Convolution
Y1[n]={-1,0,3,2,2}
Y2[n]={4,1,0,4,6}
Y3[n]={6,7,5,3,3}
y4[n]={1,3,4,3,1}
Y(n)={3,2,2,0,4,6,5,3,3,4,3,1}
Overlap save
• https://www.slideshare.net/GourabGhosh4/overlap-add-overlap-
savedigital-signal-processing
Find output y(n) using overlap add method
• X(n)={3,-1,0,1,3,2,0,1,2,1}
• H(n)={1,1,1}
• Let length of data block=3
• Two zeros are added to bring length of block =5
• L+M-1=5
• x1[n]={3,-1,0,0,0}
• x2[n]={1,3,2,0,0}
• x3[n]={0,1,2,0,0}
• x4[n]={1,0,0,0,0}
• y1[n]={3,2,2,-1,0}
• y2[n]={1,4,6,5,2}
• y3[n]={0,1,3,3,2}
• y4[n]={1,1,1,0,0}
Overlap add
3 2 2 -1 0
1 4 6 5 2
0 1 3 3 2
1 1 1 0 0
3 2 2 0 4 6 5 3 3 4 3 1 0 0
• Find linear convolution using overlap save and overlap add method
X(n)={1,2,-1,2,3,-2,-3,-1,1,1,2,-1}
H(n)={1,2,3}
Discrete Cosine Transform
DCT for One dimensional , F=C*f
DCT for Two dimensional (image), F=C*f*C’
• Find the DCT of following sequence
X(n)={1,3,5,7}
Answer
F={8,-4.459,0,-0.317}
• Find the DCT of following image ,
2 4 4 2
4 6 8 3
2 8 10 4
3 8 6 2
Answer
1.9 -0.2705 -8 0.653
-2.6913 -0.2498 2.3087 0.8957
-3.5 1.464 1.5 -1.6885
0.327 -1.6027 0.956 -0.2448
4 point DFT
• https://youtu.be/5LERZVZGw60
• https://youtu.be/PLTpmCmBd60
• https://youtu.be/50WsFvNgtzc
• https://youtu.be/aWnpTJ-uNEA
DIT FFT
• https://youtu.be/fCTfKL3XIuA
• https://youtu.be/RioJKiSBlyg
Bit Reversing
• Note that the inputs have been shuffled so that the outputs are
produced in the correct order.
• This can be represented as a bit-reversing process:
Time Point Binary Word Reversed-Bit Word Order
(n)
0 000 000 x[0]
1 001 100 x[4]
2 010 010 x[2]
3 011 110 x[6]
4 100 001 x[1]
5 101 101 x[5]
6 110 011 x[3]
7 111 111 x[7]
FFT Algorithms - Four point FFT
The general form:
• https://slideplayer.com/slide/18059528/
