Scribd Logo
Upload

Welcome to Scribd!

  • Function-Latihan DFT

    Uploaded by

    qnttt
    3 views1 page
    This document defines a function that computes the discrete Fourier transform (DFT) of a finite-duration sequence. The function takes in an N-point sequence xn and returns the DFT coefficients Xk over 0 <= k <= N-1. It creates the necessary row vectors n and k, computes the DFT matrix using the WN factor, and returns the DFT coefficients Xk by multiplying the sequence xn with the DFT matrix.

    Original Description:

    Original Title

    function-latihan dft.docx

    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
    This document defines a function that computes the discrete Fourier transform (DFT) of a finite-duration sequence. The function takes in an N-point sequence xn and returns the DFT coefficients Xk over 0 <= k <= N-1. It creates the necessary row vectors n and k, computes the DFT matrix using the WN factor, and returns the DFT coefficients Xk by multiplying the sequence xn with the DFT matrix.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    3 views1 page

    Function-Latihan DFT

    Uploaded by

    qnttt
    This document defines a function that computes the discrete Fourier transform (DFT) of a finite-duration sequence. The function takes in an N-point sequence xn and returns the DFT coefficients Xk over 0 <= k <= N-1. It creates the necessary row vectors n and k, computes the DFT matrix using the WN factor, and returns the DFT coefficients Xk by multiplying the sequence xn with the DFT matrix.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    function [Xk] = dft(xn,N)

    % Computes Discrete Fourier Transform


    % -----------------------------------
    % [Xk] = dft(xn,N)
    % Xk = DFT coeff. array over 0 <= k <= N-1
    % xn = N-point finite-duration sequence
    % N = Length of DFT
    %
    n = [0:1:N-1]; % row vector for n
    k = [0:1:N-1]; % row vector for k
    WN = exp(-j*2*pi/N); % Wn factor
    nk = n'*k; % create a N by N
    matrix of nk values
    WNnk = WN .^ nk; % DFT matrix
    Xk = xn * WNnk; % row vector for DFT
    coefficients

    x = [1/3,1/3,1/3, zeros(1,5)];
    N=8;
    X=dft(x,N);
    magX=abs(X), phaX=angle(X)*180/pi
    subplot(211); stem (magX); title('Magnitude of
    the DFT: N=8')
    xlabel('k');ylabel ('|X(k)|')
    subplot(212); stem (phaX); title('Angle of the
    DFT: N=8')
    xlabel('k');ylabel ('Degrees|')

    You might also like