Scribd Logo
Hochladen

Willkommen bei Scribd!

  • DT Transform Table

    Hochgeladen von

    Danny DeWitt
    15 Ansichten2 Seiten
    This document provides definitions and theorems relating discrete-time signals and their discrete-time Fourier transforms (DTFTs). It defines the DTFTs of basic signals including rectangular pulses, unit sample functions, complex exponentials, and periodic sequences. It also lists properties of the DTFT including linearity, time shifting, modulation, convolution, differentiation, and conjugation.

    Originalbeschreibung:

    Discrete time fourier transform table

    Copyright

    © © All Rights Reserved

    Verfügbare Formate

    PDF, TXT oder online auf Scribd lesen

    Stufen Sie dieses Dokument als nützlich ein?

    Sind diese Inhalte unangemessen?

    Dieses Dokument melden
    This document provides definitions and theorems relating discrete-time signals and their discrete-time Fourier transforms (DTFTs). It defines the DTFTs of basic signals including rectangular pulses, unit sample functions, complex exponentials, and periodic sequences. It also lists properties of the DTFT including linearity, time shifting, modulation, convolution, differentiation, and conjugation.

    Copyright:

    © All Rights Reserved
    Als PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    15 Ansichten2 Seiten

    DT Transform Table

    Hochgeladen von

    Danny DeWitt
    This document provides definitions and theorems relating discrete-time signals and their discrete-time Fourier transforms (DTFTs). It defines the DTFTs of basic signals including rectangular pulses, unit sample functions, complex exponentials, and periodic sequences. It also lists properties of the DTFT including linearity, time shifting, modulation, convolution, differentiation, and conjugation.

    Copyright:

    © All Rights Reserved
    Als PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    von 2

    Some DTFTs

    x[n]
    (
    1 |n| N1
    x[n] =
    0 |n| > N1
    
    
    1 n
    sinc

     
    1
    n
    sinc
    N
    N
    
    
    2 1
    sinc
    n

    an u[n],

    |a| < 1

    [n]

    (n n0 )
    e

    j0 n

    cos(0 n)

    
     X(e )

    sin 2 (2N1 + 1)
     
    sin
    2
    
    

    l2
    X
    rect
    1
    21
    l=
    
    

    X
    l2
    rect
    2/N
    l=
    
    

    l2
    X

    1
    21
    l=
    1
    1 aej
    1

    X
    2
    ( l2)

    l=
    ejn0

    ( 0 l2)

    l=

    (( + 0 l2)

    l=

    sin(0 n)

    +( 0 l2))
    (j( + 0 l2)

    l=

    u[n]

    j( 0 l2))

    X
    1
    ( l2)
    +
    1 ej
    l=

    EE102A:Signal Processing and Linear Systems I; Win 14-15, Pauly

    Some DTFT Theorems


    x[n]

    X(ej )

    x[n n0 ]

    x[n]ej0 n

    0 X(ej )
    ejn
    
    

    x[n] cos(0 n)

    x[n] sin(0 n)

    x[n] y[n]

    x[n]y[n]

    x[n] x[n 1]
    n
    X
    x[k]

    k=

    |x[n]|

    =
    =

    n=

    x [n]
    x[n]

    1 X(ej(+0 ) + X(ej(0 ) )
    2
    
    j
    j(+0 )
    j(0 )
    X(e
    )
    2 X(e
    j
    j
    Z X(e )Y (e )
    1
    j
    j()
    X(e )Y (e
    )d
    2

    (1 ej )X(ej )

    X
    X(ej )
    j0
    ( l2)
    + X(e )
    1 ej
    l=

    x1 [n]x2 [n]

    n=

    X ej(0 )

    Z
    1
    j
    j
    X1 (e )X2 (e )d
    2 h2i
    Z
    1
    j 2
    |X(e )| d
    2 h2i
    X (ej )
    X(ej )

    EE102A:Signal Processing and Linear Systems I; Win 14-15, Pauly

    Das könnte Ihnen auch gefallen