8/19/2019 Fast fourier transform 4 point DIT FFT, 8 point DIT FFT.

1/2

4-POINT DIT FFT : PROGRAM

close all

x=[1 1 1 1];

 N=4;

y=bitrevorder(x);

M=log2(N);

for m=1:M

  d=2^m;

  for l=1:d:(Nd!1)

  for "=#:((d$2)1)

  %=ex&(1'2&i"$d);

  1=y(l!");

  2=y(l!"!d$2);

  y(l!")=1!(%2);

  y(l!"!d$2)=1(%2);

  e*d

  e*d

e*d

dis&(y);

 &=fft(x+N);

dis&(&);

fig,re(1);

stem(x);

8/19/2019 Fast fourier transform 4 point DIT FFT, 8 point DIT FFT.

2/2

8-POINT DIT FFT : PROGRAM

-lear all

close all

x=[1 1 1 1 # # # #];

 N=.;

y=bitrevorder(x);

M=log2(N);

for m=1:M

  d=2^m;

  for l=1:d:(Nd!1)

  for "=#:((d$2)1)

  %=ex&(1'2&i"$d);

  1=y(l!");

  2=y(l!"!d$2);  y(l!")=1!(%2);

  y(l!"!d$2)=1(%2);

  e*d

  e*d

e*d

dis&(y);

 &=fft(x+N);

dis&(&);

fig,re(1);stem(x);