Scribd Logo
Upload

Welcome to Scribd!

  • 70 views

    4 Time Domain Representation of Lti Systems

    Uploaded by

    sivatejamundlamuri
    This chapter discusses time-domain representation methods for linear time-invariant systems. The convolution sum is introduced to express discrete time signals as a weighted sum of time-shifted impulse sequences. The discrete time impulse response of an LTI system is also represented using convolution. Properties of discrete-time linear convolution and system properties are described. Causal LTI systems can be described by constant coefficient linear difference equations that can be solved recursively or non-recursively to obtain the output sequence given the input.

    Copyright:

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

    4 Time Domain Representation of Lti Systems

    Uploaded by

    sivatejamundlamuri
    70 views9 pages
    This chapter discusses time-domain representation methods for linear time-invariant systems. The convolution sum is introduced to express discrete time signals as a weighted sum of time-shifted impulse sequences. The discrete time impulse response of an LTI system is also represented using convolution. Properties of discrete-time linear convolution and system properties are described. Causal LTI systems can be described by constant coefficient linear difference equations that can be solved recursively or non-recursively to obtain the output sequence given the input.

    Original Description:

    Nptel Digital signal processing 4

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This chapter discusses time-domain representation methods for linear time-invariant systems. The convolution sum is introduced to express discrete time signals as a weighted sum of time-shifted impulse sequences. The discrete time impulse response of an LTI system is also represented using convolution. Properties of discrete-time linear convolution and system properties are described. Causal LTI systems can be described by constant coefficient linear difference equations that can be solved recursively or non-recursively to obtain the output sequence given the input.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    70 views9 pages

    4 Time Domain Representation of Lti Systems

    Uploaded by

    sivatejamundlamuri
    This chapter discusses time-domain representation methods for linear time-invariant systems. The convolution sum is introduced to express discrete time signals as a weighted sum of time-shifted impulse sequences. The discrete time impulse response of an LTI system is also represented using convolution. Properties of discrete-time linear convolution and system properties are described. Causal LTI systems can be described by constant coefficient linear difference equations that can be solved recursively or non-recursively to obtain the output sequence given the input.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 9

    Signals in Natural Domain

    Chapter 4 : Time-Domain Representation for Linear Time-Invariant Systems

    In this chapter we will consider several methods for describing relationship between the input and output of
    linear time-invariant systems.

    The Convolution Sum:


    The representation of discrete time signals in terms of impulses.

    The key idea is to express an arbitrary discrete time signal as weighted sum of time shifted impulses.

    Consider the product of signal and the impulse sequence. We know that

    and

    Using these relations we can write

    (4.1)

    A graphical illustration is shown below


    Fig 4.1

    Given an arbitrary sequence we can write it as a linear combination of shifted unit impulses , where
    the weights of their combination are x[k], the kth term of the sequence. For any given n, in the summation

    there is only one term which is non-zero and so we do not have to worry about the convergence.

    Consider the unit step sequence {u[n]}. Since , and , it has representation
    1 2 3 4

    Signals in Natural Domain


    Chapter 4 : Time-Domain Representation for Linear Time-Invariant Systems

    The Discrete Time Impulse response of linear Time Invariant System:

    We use linearity property of the system to represent its response in terms of its response shifted impulse
    sequences. The time invariance further simplifies their representation. Let be the input signal
    and be the output sequence, and T( ) represent the linear system

    using (4.1)
    Signals in Natural Domain
    Chapter 4 : Time-Domain Representation for Linear Time-Invariant Systems

    Properties of discrete-time linear convolution and system properties

    If and are sequences, then the following useful properties of the discrete time
    convolution can be shown to be true
    1. Commutativity

    2. Associativity

    `
    3. Distributivity over sequence addition
    Signals in Natural Domain
    Chapter 4 : Time-Domain Representation for Linear Time-Invariant Systems

    Causal LTI systems described by difference equations

    An important subclass of linear time invariant system is one where the input and output sequences satisfy
    constant coefficient linear difference equation

    (4.6)

    The constants, is input sequence and is output sequence. We can solve equation (4.6) in a
    manner analogous to the differential equation solution, but for discrete time we can use a different approach.
    Assume that. We can write

    (4.7)
    In order to find we need previous N values of the output. Thus if we know the input sequence and
    a set of initial condition we can find values of.

    Example: Consider the difference equation

    then

    Let us take

    This system is not linear for all values of the initial condition. For a linear system all zero input sequence must
    produce a all zero output sequence. But if C is different from zero, then output sequence is not an all system is
    linear. System is not time invariant in general. Suppose input is than we have

    If we use input as then

    It is obvious that second sequence is not a shifted version of the first sequence unless. The system is linear
    time invariant if we assume initial rest condition, i.e. if then. With initial rest condition the
    system described by constant coefficient-linear difference equation is linear, time invariant and causal.

    The equation of the form (4.7) is called recursive equation if , since it specifies a recursive algorithm for
    finding out the output sequence. In special case , we have

    (4.8)

    Here is completely specified in terms of the input. Thus this equation is called non-recursive equation. If
    input , then we see that the output is equal to impulse response

    1 2 3 4

    You might also like