Scribd Logo
Upload

Welcome to Scribd!

  • Ex 10

    Uploaded by

    Shivam Goyal
    4 views1 page
    This document provides instructions for using the divide and conquer method to calculate an 8 point discrete Fourier transform (DFT). It involves: 1) Inputting 8 signal elements and initializing arrays; 2) Performing bit reversal by adding and subtracting elements into new arrays; 3) Setting twiddle factors to roots of unity; 4) Multiplying bit reversed signals by twiddle factors; 5) Calculating DFT coefficients by multiplying transformed signals with a twiddle factor matrix.

    Original Description:

    Original Title

    ex10

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document provides instructions for using the divide and conquer method to calculate an 8 point discrete Fourier transform (DFT). It involves: 1) Inputting 8 signal elements and initializing arrays; 2) Performing bit reversal by adding and subtracting elements into new arrays; 3) Setting twiddle factors to roots of unity; 4) Multiplying bit reversed signals by twiddle factors; 5) Calculating DFT coefficients by multiplying transformed signals with a twiddle factor matrix.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views1 page

    Ex 10

    Uploaded by

    Shivam Goyal
    This document provides instructions for using the divide and conquer method to calculate an 8 point discrete Fourier transform (DFT). It involves: 1) Inputting 8 signal elements and initializing arrays; 2) Performing bit reversal by adding and subtracting elements into new arrays; 3) Setting twiddle factors to roots of unity; 4) Multiplying bit reversed signals by twiddle factors; 5) Calculating DFT coefficients by multiplying transformed signals with a twiddle factor matrix.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    To find 8 point DFT using divide and conquer

    August 23, 2012

    Input:
    for k=1:8
    x(k)=input('enter the elements');
    b(k)=0
    z(k)=0
    end
    for u=1:4
    b(u)=x(u)+x(4+u);
    b(u+4)=x(u)-x(4+u);
    end
    for u=1:4
    z(u)=1;
    end
    c=0
    for a=5:8
    z(a)=exp((-1)*j*2*pi*c/8);
    c=c+1
    end
    for a=1:8
    b(a)=z(a).*(b(a));
    end
    for a=1:4
    for m=1:4
    t(a,m)=exp((-1)*j*((4*pi)/8)*(a-1)*(m-1));
    end
    end
    for a=1:4
    r(a,1)=b(a);
    end
    for a=5:8
    s((a-4),1)=b(a);
    end
    p=t*r
    q=t*s
    for a=1:4
    p(a,1);
    q(a,1);
    end

    Output:

    You might also like