Scribd Logo
Importer

Bienvenue sur Scribd !

  • The DFT Explained: How the Discrete Fourier Transform Works on Sampled Signals

    Transféré par

    Moy Pineda
    16 vues2 pages
    The document discusses the Discrete Fourier Transform (DFT), which is analogous to the continuous Fourier Transform but for discrete signals sampled at regular intervals. It describes how the DFT treats the discrete signal as if it were periodic, repeating the sequence of samples. This allows evaluating the Fourier transform at the fundamental frequency and its harmonics. The DFT decomposes the discrete signal into its constituent frequency components in the same way the continuous Fourier Transform decomposes a continuous signal.

    Description originale:

    MIT

    Titre original

    mYZJwwEd

    Copyright

    © © All Rights Reserved

    Formats disponibles

    PDF, TXT ou lisez en ligne sur Scribd

    Avez-vous trouvé ce document utile ?

    Ce contenu est-il inapproprié ?

    Signaler ce document
    The document discusses the Discrete Fourier Transform (DFT), which is analogous to the continuous Fourier Transform but for discrete signals sampled at regular intervals. It describes how the DFT treats the discrete signal as if it were periodic, repeating the sequence of samples. This allows evaluating the Fourier transform at the fundamental frequency and its harmonics. The DFT decomposes the discrete signal into its constituent frequency components in the same way the continuous Fourier Transform decomposes a continuous signal.

    Droits d'auteur :

    © All Rights Reserved
    Téléchargez comme PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    16 vues2 pages

    The DFT Explained: How the Discrete Fourier Transform Works on Sampled Signals

    Transféré par

    Moy Pineda
    The document discusses the Discrete Fourier Transform (DFT), which is analogous to the continuous Fourier Transform but for discrete signals sampled at regular intervals. It describes how the DFT treats the discrete signal as if it were periodic, repeating the sequence of samples. This allows evaluating the Fourier transform at the fundamental frequency and its harmonics. The DFT decomposes the discrete signal into its constituent frequency components in the same way the continuous Fourier Transform decomposes a continuous signal.

    Droits d'auteur :

    © All Rights Reserved
    Téléchargez comme PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    sur 2

    Lecture 7 - The Discrete Fourier

    Transform

    7.1 The DFT


    The Discrete Fourier Transform (DFT) is the equivalent of the continuous Fourier
    Transform for signals known only at instants separated by sample times  (i.e.
    a finite sequence of data).
    Let  be the continuous signal which is the source of the data. Let samples
    
    be denoted 
           
     .
    The Fourier Transform of the original signal,  , would be
    (*)
    "!$#%'& 
     ,
     
     .
     - +/102,3 
    + )
    We could regard each sample   as an impulse having area  45 . Then, since the
    integrand exists only at the sample points:
    (98;: =+ <>;?
    6!$#%7& 
     
     
     
     - +/A02B3 
    @
     8;:
    &  C  D- +/EGF   D- +/10H?IF  F   D- +/10J?IF  H- +/A0 +=<>;?
    : L +=<
    ie. "!$#%K&   D- +/10J?
    JNMOE
    We could in principle evaluate this for any # , but with only data points to start
    with, only final outputs will be significant.
    You may remember that the continuous Fourier transform could be evaluated
    QP
    over a finite interval (usually the fundamental period  @ ) rather than from to

    82
    F P if the waveform was periodic. Similarly, since there are only a finite number
    of input data points, the DFT treats the data as if it were periodic (i.e.   to
     S
     H is the same as  R to  H .)
    Hence the sequence shown below in Fig. 7.1(a) is considered to be one period of
    the periodic sequence in plot (b).

    (a)
    1

    0.8

    0.6

    0.4

    0.2

    0
    0 1 2 3 4 5 6 7 8 9 10 11

    (b)
    1

    0.8

    0.6

    0.4

    0.2

    0
    0 5 10 15 20 25 30

    Figure 7.1: (a) Sequence of &TU samples. (b) implicit periodicity in DFT.

    Since the operation treats the data as if it were periodic, we evaluate the
    <
    VXW equation for the fundamental frequency (one cycle per sequence, : ? Hz,
    DFT
    : ? rad/sec.) and its harmonics (not forgetting the d.c. component (or average) at
    #Y&Z ).
    H\ \ \ \ 
    i.e. set #Y&Z [  ^   U
     S] ]`_ S]
    or, in general

    : L +=<
    S
     &   D- + /$bdg
    ec f J  Z& ih H
    _ JaMOE _

    83

    Vous aimerez peut-être aussi