5 Dif FFT Numericals 07-02-2024

Frequency Analysis of Signals
and Systems-II
DSP_WINTER 2023 Dr.S.KALAIVANI

 The DFT provides uniformly spaced samples of the
Discrete-Time Fourier Transform (DTFT)
 DFT definition:
N 1 2nk
N 1 2nk 1 j
X [ k ]   x[n]e
j
N x[n] 
N
 X [k ]e
n0
N
n0
 Requires N2 complex multiplications and N(N-1)

complex additions

 Take advantage of the symmetry and periodicity of the complex
exponential (let WN=e-j2p/N)
 symmetry: WNk [ N n ]  WN kn  (WNkn )*
 periodicity: W kn  W k [ n  N ]  W [ k  N ]n
N N N
 Note that two length N/2 DFTs take less computation than one
length N DFT: 2(N/2)2<N2
 Algorithms that exploit computational savings are collectively

called Fast Fourier Transforms
DFT AND FFT
 FFT is an algorithm to convert a time domain signal to DFT efficiently.
 FFT is not unique. Many algorithms are available.
 Each algorithm has merits and demerits.
 In each algorithm, depending on the sequence needed at the output, the
input is regrouped.
 The groups are decided by the number of samples.
 Algorithms having number of samples 2N, where N is an integer is most
preferred.
 Radix-x: here ‘x’ represents number of samples in each group made at the
first stage. They are generally equal.
 We shall study radix-2 ALGORITHM.

RADIX-2: DIT OR, DIF
 Radix-2 is the first FFT algorithm. It was proposed by Cooley and
Tukey in 1965.
 Though it is not the efficient algorithm, it lays foundation for
time-efficient DFT calculations.
 The algorithms appear either in
(a) Decimation In Time (DIT), or,
(b) Decimation In Frequency (DIF).
 DIT and DIF, both yield same complexity and results. They are
complementary.
 We shall stress on 8 to radix 2 DIT FFT.
OTHER POPULAR ALGORITHMS
Besides many, the popular algorithms are:
 Goertzel algorithm
 Chirp Z algorithm
 Index mapping algorithm
 Split radix in prime number algorithm.

FFT COMPUTATIONAL EFFECIENCY

DECIMATION-IN-TIME ALGORITHM (DIT-FFT)

 A fast Fourier transform (FFT) is an algorithm that samples a signal
over a period of time (or space) and divides it into its frequency
components. An FFT computes the DFT and produces exactly the
same result as evaluating the DFT definition directly; the most
important difference is that an FFT is much faster

THE PROCESS OF DECIMATION
 First step of process of decimation is splitting a sequence in
smaller sequences.
 A sequence of 15 can be splitted in five sequences of threes or
three sequences of fives.
 A sequence of 16 numbers can be splitted in 2 sequences of 8.
Further,
Each sequence of 8 can be splitted in two sequences of 4;
Subsequently each sequence of 4 can be splitted in two sequences of two;
There can be various combinations and varied complexities.

DECIMATION-IN-TIME FFT ALGORITHMS –RADIX-2
 Makes use of both periodicity and symmetry
 Consider special case of N an integer power of 2
 Separate x[n] into two sequence of length N/2
 Even indexed samples in the first sequence
 Odd indexed samples in the other sequence
N 1
 j  2 / N  kn
X  k    x[n]e
n 0
 j  2 / N  kn  j  2 / N kn
  x[n]e
n even
  x[n]e
n odd
12
DECIMATION-IN-TIME FFT ALGORITHMS
 j  2 / N  kn  j  2 / N kn
X k    
x[n]e  x[n]e 
n even n odd
Substitute variables n=2r for n even and n=2r+1 for odd

N /2 1 N /2 1
 2 r 1 k
X k    x[2r ]W2 rk
N   x[2r  1]WN
r 0 r 0
N /2 1 N /2 1
  x[2r ]WNrk/2  WNk  x[2r  1]WNrk/2
r 0 r 0
 G k   W H k  k  j 2 2  j 2
N WN2 e N  e N /2  WN /2
G[k] and H[k] are the N/2-point DFT’s of each subsequence
13
N /2 1 N /2 1
X k    x[2r ]WNrk/2  WNk  x[2r  1]WNrk/2
r 0 r 0
 G  k   WNk H  k   j 2 2rk  j 2 rk
e N  e N /2  WNrk/2
N 1
k  0,1,..., k  0,1,..., N
2
 N  N
G k    G k  H k    H k 
 2  2
 G[k] and H[k] are the N/2-point DFT’s of each subsequence
15


x[n]={x(0), x(1), x(2), x(3), x(4), x(5), x(6), x(7)}

 Two N/2-point DFTs
 2(N/2)2 complex multiplications
 2(N/2)2 complex additions
 Combining the DFT outputs

 N complex multiplications
 N complex additions
 Total complexity
 N2/2+N complex multiplications
 N2/2+N complex additions
 More efficient than direct DFT
19
 Repeat same process ,
Divide N/2-point DFTs into
 Two N/4-point DFTs
 Combine outputs
N=8

20
 After two steps of decimation in time
 Repeat until we’re left with two-point DFT’s

21
 Final flow graph for 8-point decimation in time
 Complexity:
DSP_WINTER 2023
Dr.S.KALAIVANI
 (Nlog2N)/2 complex multiplications and Nlog2N additions 23
RELATIONSHIP BETWEEN EXPONENTIAL FORMS AND TWIDDLE FACTORS (W)
FOR PERIODICITY = N
Sr. Exponential form Symbolic form
No.
01 e-j2pn/N = e-j2p(n+N)/N WNn = W Nn+N
02 e-j2p(n+N/2)/N = - e-j2pn/N WNn+N/2= - W Nn
03 e-j2pk = e-j2pNk/N = 1 WNN+K = 1
04 e-j2(2p/N) = e-j2p/(N/2) WN2 = W N/2

VALUES OF VARIOUS TWIDDLES WNN FOR LENGTH N=8
n WNn = e(-j2p)(n/N) Remarks
0 1 = 10 WN 0
1 (1-j)/√2 = 1 -45 WN 1
2 -j = 1 -90 WN 2
3 - (1+j)/√2 = 1-135 WN 3
4 -1 = 1 -180 WN 4 = -W N 0
5 - (1-j)/√2 = 1 -225 WN 5 = -W N 1
6 j = 1 90 WN 6 = -W N 2
7 (1+j)/√2 = 1 45 WN 7 = -W N 3
DIT –INPUT SEQUENCE ORDER

N=8-POINT RADIX-2 DIT-FFT:
N/4 point DFT N/2 point DFT N-point DFT
x[0] X[0]
X[1]
x[4] -1
x[2] X[2]
-1
w2
X[3]
x[6] -1
-1
X[4]
x[1] -1
X[5]
x[5] w1 -1
-1
w2 X[6
x[3] -1
-1 ]
w2 w3 X[7]
x[7] -1 -1 -1

 Find 8-point DFT of the sequence
[ ] = [1,1,1,1,0,0,0,0]
using DIT-FFT algorithm

[ ] = [1,1,1,1,0,0,0,0]

[ ] = [1,1,1,1,0,0,0,0]

x[0] 1 1 X[0]
1+0 2
X[1]
x[4] 0 -1 1-(0) 1 1-j
x[2] 1 X[2]
1+0 1 -1 0
w2
X[3]
x[6] 0 1-(0) 1 -1 1+j
-1
X[4]
x[1] 1 1+0 1 2 -1
X[5]
x[5] 0 -1 1-(0) 1 1-j w1 -1
X[6
x[3] 1 1+0 1 0w
2
-1
-1 ]
2 X[7]
x[7] 0 -1
1w -1 1+j w3 -1
1-(0)
Find 8-point DFT of the sequence
[ ] = [1,2,3,4,4,3,2,1]
using DIT-FFT algorithm

x[0] 1 10 X[0]
5
-3 X[1]
x[4] 4 -1 -3-j
x[2] 3 0 X[2]
5 -1
X[3]
x[6] 2 1 w2 -1
-3+j
-1
5 X[4]
x[1] 2 10 -1
X[5]
x[5] 3 -1
-1 -1-3j w1 -1
X[6
x[3] 4 5 0 w2 -1
-1 ]
3 w2 w3 X[7]
x[7] 1 -1 -1 -1
-1+3j
UNIT-II

Let = + /2

Hence, even values of X[k], ie., X[0], X[2], X[4] and X[6] for
N=8, can be determined from the above equation.
CONTD.,
 To find odd values of X[k], = +
N 1 N /21 N 1
X  2r  1   x[n]WNn(2 r 1)   x[n]WNn (2r 1)   x[n]WNn(2r 1)
n 0 n 0 n  N /2
N / 2 1 N /2 1
n (2 r 1)  n  N /2 (2 r 1)
 
n 0
x[n]W N  
n 0
x[n  N / 2]WN
( )( ) ( )( ) ( )( )
=
N
(2 r 1)
W N
2
 WNNrWNN /2  1
43
N / 2 1 N /2 1
n (2 r 1)  n  N /2 (2 r 1)
 
n 0
x[n]W N  
n 0
x[n  N / 2]WN
N / 2 1
n (2 r 1)
   x[ n ]  x[ n  N / 2]  N
W
n 0
WNn 2 r 1  WN2 rnWNn  WNrn/ 2WNn
N / 2 1
n rn
   x[ n ]  x[ n  N / 2]  N N /2
W W
n 0

N / 2 1
X 2 r     x[ n ]  x [ n  N / 2 ]  W Nn r/ 2
n0
N /2 1
  g (n)WNrn/2
n 0
 0 = 0 + [4]
 1 = 1 + [5]
 2 = 2 + [6]
 3 = 3 + [7]

N / 2 1
X  2 r  1    x [ n ]  x [ n  N / 2] W n
W rn
 N N /2
n 0
N / 2 1
  h(n)WNnWNrn/ 2
n 0
ℎ 0 = 0 − [4]
ℎ 1 = 1 − [5]
ℎ 2 = 2 − [6]
ℎ 3 = 4 − [7]

2-point DIF - FFT
X v ( p)  X v1 ( p)  X v1 ( q)
X v (q)   X v 1 ( p)  X v1 (q )  W80 when N  8

47
The DIF FFT is the transpose of the DIT FFT
DIT FFT structure: DIF FFT structure:

x[n]={1,2,3,4}
X[k]={10,-2+2j,-2,-2-2j4}
 Verify your answer through inverse DIF-FFT algorithm

 The given sequence is:
[ ] ={2,2,2,2,1,1,1,1}
Compute 8-point DFT by using DIF-FFT algorithm.

[ ] ={2,2,2,2,1,1,1,1}

 Compute 8-point DFT of the given sequence x n = [ ]:
[ ] ={1,0,0,0,0,0,0,0}
using (a) DFT (b) FFT algorithm
Solution: X[k]={1,1,1,1,1,1,1,1}

 In an LTI system the input x[n]={1,2,3} and impulse response h[n]={-1,-1}.
Determine the response of the system by radix-2 algorithm.

x[n]={1,2,3}

h[n]={-1,-1}

 Y(k)={6,-2-2j, 2,-2+j2} * {-2, -1+j, 0 –j}
={-12, 4, 0, 4}

Y(k)={-12, 4, 0, 4}

 X[k]={6,-2-j2, 2, -2+j2}
 H[k]={-2, -1+j,0,-1-j}
 Y[k]={-12,4,0,4}
 y[n]={-1,-3,-5,-3}

 X1[k]={6, 1+j, 0, 1-j}
 X2[k]={0, 2+2j, 0, 2-2j}
 Y[k]={0, 4j, 0 -4j}
 y[n]={0, -2, 0, 2}

The DIF FFT is the transpose of the DIT FFT
DIT FFT structure: DIF FFT structure:

5 Dif FFT Numericals 07-02-2024

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

5 Dif FFT Numericals 07-02-2024

Uploaded by

Copyright:

Available Formats

Frequency Analysis of Signals

DSP_WINTER 2023 Dr.S.KALAIVANI

 Requires N2 complex multiplications and N(N-1)

DSP_WINTER 2023 Dr.S.KALAIVANI

 Algorithms that exploit computational savings are collectively

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

Substitute variables n=2r for n even and n=2r+1 for odd

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

 Combining the DFT outputs

DSP_WINTER 2023 Dr.S.KALAIVANI

 Repeat until we’re left with two-point DFT’s

02 e-j2p(n+N/2)/N = - e-j2pn/N WNn+N/2= - W Nn

03 e-j2pk = e-j2pNk/N = 1 WNN+K = 1

04 e-j2(2p/N) = e-j2p/(N/2) WN2 = W N/2

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

using DIT-FFT algorithm

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

X v (q)   X v 1 ( p)  X v1 (q )  W80 when N  8

DSP_WINTER 2023 Dr.S.KALAIVANI

DIT FFT structure: DIF FFT structure:

DSP_WINTER 2023 Dr.S.KALAIVANI

 Verify your answer through inverse DIF-FFT algorithm

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

DSP_WINTER 2023 Dr.S.KALAIVANI

DIT FFT structure: DIF FFT structure:

DSP_WINTER 2023 Dr.S.KALAIVANI

You might also like