0
4.3kviews
Compute IDFT of the following sequence using inverse FFT algorithm. x(k)={3,0,3,0,3,0,3,0}
1 Answer
0
212views

Solution:

N=8=23

The computation of 8 point DFT using radix- 2 DITFFT involves three steps.

Given, X(k)={3,0,3,0,3,0,3,0}

X(k)={3,0,3,0,3,0,3,0}

Step 1: The four pairs of X(k) in bit reversed order is the input for step 1

The phase factor for step 1 is W02=e0=1

The butterfly computations for step 1 are:

enter image description here

Output of step 1 is V(k)={6,0,6,0,0,0,0,0}

Step 2: The output of step 1 forms the input for second step.

The phase factor for step 2 are W04=e0=1& W14=ej2π/4=cos2π4jsin2π4=0j×1=j

The butterfly computations for step 2 are:

enter image description here

Output of step 2 is F(k)={12,0,0,0,0,0,0,0}

Step 3: The output of step 2 forms the input for third step.

The phase factor for step 3 are W08=e0=1;

W18=ej2π/8=cos2π8jsin2π8=12j12

W28=ej4π/8=cos4π8jsin4π8=0j×1=j

W38=ej6π/8=cos6π8jsin6π8=12j12;

The butterfly computations for step 3 are:

enter image description here

Output of step 3 is q(n)={12,0,0,0,12,0,0,0}

x(n)=IDFT[X(k)]

=1Nq(n)

=18{12,0,0,0,12,0,0,0}

=18{12,0,0,0,12,0,0,0}

={1.5,0,0,0,1.5,0,0,0}

Hence, the IDFT of X (k) is

={1.5,0,0,0,1.5,0,0,0}

Please log in to add an answer.