0
5.2kviews
Compute the DFT of the sequence x(n) = {1, 2, 2, 2, 1, 0, 0, 0} using DIF-FFT algorithm. Compare the computational complexity of above algorithm with DFT.
1 Answer
0
271views

enter image description here

Output of stage-1:

S1(0)=x(0)+x(4)=1+1=2

S1(1)=x(1)+x(5)=2+0=2

S1(2)=x(2)+x(6)=2+0=2

S1(3)=x(3)+x(7)=2+0=2

S1(4)=[x(0)x(4)]W08=(11)W08=0

S1(5)=[x(1)x(5)]W18=(20)(0.7070.707j)=1.4141.414j

S1(6)=[x(2)x(6)]W28=(20)(j)=2j

S1(7)=[x(3)x(7)]=(20)(0.707j0.707)=1.4141.414j

Output of stage- 2

S2(0)=S1(0)+S1(2)=2+2=4

S2(1)=S1(1)+S1(3)=2+2=4

S2(2)=[S1(0)S1(2)]W08=(22)(1)=0

$S_2 (3)=[S_1 (1)-S_1 (3) ] …

Create a free account to keep reading this post.

and 3 others joined a min ago.

Please log in to add an answer.