Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    PPT2 Module 1

    Uploaded by

    CarlynM

    Copyright:

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

    PPT2 Module 1

    Uploaded by

    CarlynM
    13 views11 pages

    Original Title

    PPT2 Module 1 (3)

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

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

    PPT2 Module 1

    Uploaded by

    CarlynM

    Copyright:

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

    As an engineer

    DSP algorithm or
    System
    Input x(n) ?? Desired output y(n)

    DSP algorithm or system is a discrete time system


    either represented as a difference equation
    Eg.
    or H(z) or h(n)

    1
    For any discrete time system

    h(n)
    x(n)

    Given x(n) and h(n), How will you find y(n)

    2
    Finding the output of a given system
    • y(n)=x(n)* h(n) convolution of two signals
    • Convolution in time domain –multiplication in
    frequency domain
    • Y(z)=X(z)×H(z)-z transform approach
    • Y(ω)=X(ω)H(ω)-DTFT approach
    • Y(k)=X(k)H(k)-DFT approach
    • Later find the inverse to get y(n)
    • Computationally efficient method to compute
    DFT -FFT

    3
    Recap-Discrete Time Fourier transform
    • Frequency analysis of signals and systems

    • The representation involves the decomposition of


    the signals in terms of sinusoidal components, i.e,
    the signal is represented in frequency domain

    • Periodic signals-decomposition called Fourier


    series

    • Aperiodic signals- decomposition called as Fourier


    transform
    4
    Discrete Time Fourier Transform (contd…)
    • The Fourier transform of finite energy discrete
    time signal x(n) is defined as

    X ( )   x (
    n  
    n ) e  jn

    • Physically X(ω) represents the frequency


    content of the signal x(n)

    5
    Discrete Time Fourier Transform (contd…)
    • X(ω) is periodic with period 2π

    X (  2k )   x (
    n  
    n ) e  j (  2k ) n


      x (
    n  
    n ) e  jn  j 2kn
    e

      x(n)e  jn  X ( )
    n 

    • Frequency range of any discrete time signal is limited to


    –π to π or 0 to 2 π

    • Any frequency outside this interval is equivalent to a


    frequency within the interval
    6
    Sufficient condition for the existence
    of Fourier Transform
    • The sequence x(n) must be absolutely
    summable 

     x( n)  
    n  

     
    X ( )   x ( n)e
    n  
     j n
      x ( n)  
    n  

    7
    DTFT
    • Determine the DTFT of anu(n)

    Check whether absolutely


    Summable or not

    8
    Discrete Fourier Transform (DFT)
    • Frequency analysis of discrete time signals done on a DSP
    processor
    • Time domain to frequency domain representation X(ω)
    • But it is continuous function of ω
    • Not a computationally convenient representation of x(n)
    • We will consider the representation of x(n), by taking samples
    of X(ω) DFT
    • i.e. take samples of DTFT  DFT

    • DTFT

    9
    Discrete Fourier Transform
    • A finite duration sequence x(n) of length L [x(n)=0 for
    n<0 and n≥L] has a Fourier transform

    10
    Discrete Fourier Transform (contd…)

    11

    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