Scribd Logo
Upload

Welcome to Scribd!

  • 60 views

    Discrete Time (DT) Fourier Series

    Uploaded by

    Adnan Karim
    The document discusses discrete time Fourier series (DTFS) for periodic signals. It explains that in DTFS, there are a finite number of distinct complex exponential signals over each signal period. The DTFS representation can be written as a summation from 0 to N-1. Examples are provided to illustrate the DTFS of a square wave and how the representation converges with more terms.

    Copyright:

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

    Discrete Time (DT) Fourier Series

    Uploaded by

    Adnan Karim
    60 views19 pages
    The document discusses discrete time Fourier series (DTFS) for periodic signals. It explains that in DTFS, there are a finite number of distinct complex exponential signals over each signal period. The DTFS representation can be written as a summation from 0 to N-1. Examples are provided to illustrate the DTFS of a square wave and how the representation converges with more terms.

    Original Title

    Lecture-17 DTFS.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses discrete time Fourier series (DTFS) for periodic signals. It explains that in DTFS, there are a finite number of distinct complex exponential signals over each signal period. The DTFS representation can be written as a summation from 0 to N-1. Examples are provided to illustrate the DTFS of a square wave and how the representation converges with more terms.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    60 views19 pages

    Discrete Time (DT) Fourier Series

    Uploaded by

    Adnan Karim
    The document discusses discrete time Fourier series (DTFS) for periodic signals. It explains that in DTFS, there are a finite number of distinct complex exponential signals over each signal period. The DTFS representation can be written as a summation from 0 to N-1. Examples are provided to illustrate the DTFS of a square wave and how the representation converges with more terms.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 19

    Slide Courtesy: Dr.

    Salman Abdul Ghafoor 1

    DISCRETE TIME (DT)


    FOURIER SERIES
    Slide Courtesy: Dr. Salman Abdul Ghafoor 2

    DT Sinusoids Frequency & Rate of Oscillation


    Slide Courtesy: Dr. Salman Abdul Ghafoor 3

    DT Sinusoids Frequency & Rate of Oscillation


    Slide Courtesy: Dr. Salman Abdul Ghafoor 4

    DT Sinusoids Frequency & Rate of Oscillation


    Slide Courtesy: Dr. Salman Abdul Ghafoor 5

    DTFS for Periodic Signals

    • There are only N different signals in the set of discrete-


    time complex exponential signals
    Slide Courtesy: Dr. Salman Abdul Ghafoor 6

    DTFS for Periodic Signals

    • Since the exponential sequences are distinct only over a


    range of N successive values of k, the FS summation may
    be written as:
    Slide Courtesy: Dr. Salman Abdul Ghafoor 7

    DTFS for Periodic Signals


    Slide Courtesy: Dr. Salman Abdul Ghafoor 8

    DTFS for Periodic Signals


    Slide Courtesy: Dr. Salman Abdul Ghafoor 9

    DT Fourier Series Pair


    Slide Courtesy: Dr. Salman Abdul Ghafoor 10

    DTFS Example
    Slide Courtesy: Dr. Salman Abdul Ghafoor 11

    DTFS Example
    Slide Courtesy: Dr. Salman Abdul Ghafoor 12

    DTFS Example
    Slide Courtesy: Dr. Salman Abdul Ghafoor 13

    DTFS Example
    Slide Courtesy: Dr. Salman Abdul Ghafoor 14

    DTFS Square Wave


    Slide Courtesy: Dr. Salman Abdul Ghafoor 15

    DTFS Square Wave


    Slide Courtesy: Dr. Salman Abdul Ghafoor 16

    DTFS Square Wave Convergence


    Slide Courtesy: Dr. Salman Abdul Ghafoor 17

    END

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy