Scribd Logo
Upload

Welcome to Scribd!

  • Fast Fourier Transform 4 Point DIT FFT, 8 Point DIT FFT.

    Uploaded by

    sunny756
    102 views2 pages
    Decimation in time fast fourier transform code. for 4 point DITFFT and 8 point DITFFT.

    Original Title

    Fast fourier transform 4 point DIT FFT, 8 point DIT FFT.

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Decimation in time fast fourier transform code. for 4 point DITFFT and 8 point DITFFT.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    102 views2 pages

    Fast Fourier Transform 4 Point DIT FFT, 8 Point DIT FFT.

    Uploaded by

    sunny756
    Decimation in time fast fourier transform code. for 4 point DITFFT and 8 point DITFFT.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 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:(N-d+1)
    for k=0:((d/2)-1)
    w=exp(-1j*2*pi*k/d);
    z1=y(l+k);
    z2=y(l+k+d/2);
    y(l+k)=z1+(w*z2);
    y(l+k+d/2)=z1-(w*z2);
    end
    end
    end
    disp(y);
    p=fft(x,N);
    disp(p);
    figure(1);
    stem(x);

    8-POINT DIT FFT : PROGRAM


    Clear all
    close all
    x=[1 1 1 1 0 0 0 0];
    N=8;
    y=bitrevorder(x);
    M=log2(N);
    for m=1:M
    d=2^m;
    for l=1:d:(N-d+1)
    for k=0:((d/2)-1)
    w=exp(-1j*2*pi*k/d);
    z1=y(l+k);
    z2=y(l+k+d/2);
    y(l+k)=z1+(w*z2);
    y(l+k+d/2)=z1-(w*z2);
    end
    end
    end
    disp(y);
    p=fft(x,N);
    disp(p);
    figure(1);stem(x);

    You might also like