Scribd Logo
Upload

Welcome to Scribd!

  • 30 views

    Experiment - 4: Aim: To Compute DFT of The Signal Given Below Using Matrix Method in MATLAB: X (N) (1 2 3 4)

    Uploaded by

    Fatre
    This document describes experiments to compute the discrete Fourier transform (DFT) and inverse discrete Fourier transform (IDFT) of signals using MATLAB. For the DFT, the signal [1 2 3 4] is transformed and the result displayed as a matrix. For the IDFT, the signal [6, -2+j2, -2, -2-j2] is transformed. Both experiments define the signal length N, calculate the twiddle factor, and multiply the signal by the twiddle factor matrix to perform the transformations.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Experiment - 4: Aim: To Compute DFT of The Signal Given Below Using Matrix Method in MATLAB: X (N) (1 2 3 4)

    Uploaded by

    Fatre
    30 views4 pages
    This document describes experiments to compute the discrete Fourier transform (DFT) and inverse discrete Fourier transform (IDFT) of signals using MATLAB. For the DFT, the signal [1 2 3 4] is transformed and the result displayed as a matrix. For the IDFT, the signal [6, -2+j2, -2, -2-j2] is transformed. Both experiments define the signal length N, calculate the twiddle factor, and multiply the signal by the twiddle factor matrix to perform the transformations.

    Original Title

    189202011_SaloniVarshney_Experiment4&5

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document describes experiments to compute the discrete Fourier transform (DFT) and inverse discrete Fourier transform (IDFT) of signals using MATLAB. For the DFT, the signal [1 2 3 4] is transformed and the result displayed as a matrix. For the IDFT, the signal [6, -2+j2, -2, -2-j2] is transformed. Both experiments define the signal length N, calculate the twiddle factor, and multiply the signal by the twiddle factor matrix to perform the transformations.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    30 views4 pages

    Experiment - 4: Aim: To Compute DFT of The Signal Given Below Using Matrix Method in MATLAB: X (N) (1 2 3 4)

    Uploaded by

    Fatre
    This document describes experiments to compute the discrete Fourier transform (DFT) and inverse discrete Fourier transform (IDFT) of signals using MATLAB. For the DFT, the signal [1 2 3 4] is transformed and the result displayed as a matrix. For the IDFT, the signal [6, -2+j2, -2, -2-j2] is transformed. Both experiments define the signal length N, calculate the twiddle factor, and multiply the signal by the twiddle factor matrix to perform the transformations.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 4

    Saloni Varshney

    189202011
    ECE-C
    Due: 22 Apr. 21
    EXPERIMENT – 4

    Aim: To compute DFT of the signal given below using matrix method in MATLAB:
    x(n) = [1 2 3 4]
    Display the DFT result in common window as a matrix

    Software Used: MATLAB (R2021_a) by MathWorks

    Theory: To compute DFT of given signal, we must first define length


    of given discrete time signal as N (in this case, N=4). After this, we
    have to define twiddle factor for DFT which is WN=exp(-j*2*pi/N);
    To obtain correct output, we must first raise the twiddle factor to exponent
    power of “n’*k” as: WN_n=WN.^(n'*k); After these steps, simply input
    discrete time signal and multiply with above Twiddle Factor to obtain DFT.

    Code:
    Saloni Varshney
    189202011
    ECE-C
    Due: 22 Apr. 21

    Result/Output:

    Conclusion: In this experiment, we successfully computed DFT of


    x(n)=[1 2 3 4] in MATLAB. To compute DFT we first had to define the
    length of our DFT as ‘N’ and ‘n’ and ‘k’ which are the values of Input
    Signal matrix and DFT signal matrix, after that we initialised our
    twiddle factor matrix. To make matrix multiplication possible we had
    to multiply our twiddle factor matrix and raise it to the power of
    (n'*k) where n’ is the transpose of n. We finally computed DFT of
    given signal by multiplying x(n) by twiddle factor matrix and plotted
    using ‘stem’ command.
    Saloni Varshney
    189202011
    ECE-C
    Due: 22 Apr. 21
    EXPERIMENT – 5

    Aim: To compute IDFT of the signal given below using matrix method in MATLAB:
    X(K) = [6, -2+j2, -2, -2-j2]
    Display the IDFT result in common window as a matrix

    Software Used: MATLAB (R2021_a) by MathWorks

    Theory: To compute IDFT of given signal, we must first define


    length of given discrete time signal as N (in this case, N=4). After this,
    we have to define twiddle factor for IDFT which is
    WN=exp(j*2*pi/N); (Complex conjugate of Twiddle
    factor of DFT). To obtain correct output, we must first raise the twiddle
    factor to exponent power of “-n’*k” as: WN_n=WN. ^(-n'*k); After these
    steps, simply input discrete time signal and multiply with above Twiddle Factor
    to obtain DFT.

    Code:
    Saloni Varshney
    189202011
    ECE-C
    Due: 22 Apr. 21
    Result/Output:

    Conclusion: In this experiment, we successfully computed IDFT of


    X(K)=[6,-2+j2,-2,-2-j2] in MATLAB. To compute IDFT we first had to
    define the length of our DFT as ‘N’ and ‘n’ and ‘k’ which are the
    values of Input Signal matrix and DFT signal matrix , after that we
    initialised our twiddle factor matrix. (This matrix is complex
    conjugate of twiddle factor matrix of DFT.) To make matrix
    multiplication possible we had to multiply our twiddle factor matrix
    and raise it to the power of (-n'*k) where n’ is the transpose of n. We
    finally computed IDFT of given signal by multiplying X(K) by twiddle
    factor matrix and dividing by ‘N’ and plotted using ‘stem’ command

    You might also like