About Opentopia
Opentopia Directory Encyclopedia Tools

BIBO stability

Encyclopedia : B : BI : BIB : BIBO stability

In electrical engineering, specifically signal processing and control theory, BIBO Stability is a form of stability for signals and systems. BIBO stands for Bounded Input/Bounded Output. If a system is BIBO stable then the output will be bounded for every input to the system that is bounded. A signal is bounded if the signal is finite valued for all times ([h[n] < \infty \quad \forall n \in \mathbb] or [h(t) < \infty \quad \forall t \in \mathbb]).

Contents
  • 1 Time domain condition
  • 2 Frequency domain condition

  • Discrete-time necessary and sufficient condition

    In discrete time, the condition for BIBO stability is that the impulse response be absolutely summable, i.e., its [\ell^1] norm exist.

    [\sum_^(n)\right|} = \| h \|_ < \infty]

    Proof of sufficiency

    Given a discrete, linear, time-invariant system with impulse response [\mathbf(n)] the relationship between the input [\mathbf(n)] and the output [\mathbf(n)] is

    [\mathbf(n) = \mathbf(n) * \mathbf(n)]
    where [*] denotes convolution. Then it follows by the definition of convolution

    [\mathbf(n) = \sum_^(k) \mathbf(n-k)}]
    Let [\| x \|_] be the maximum value of [\mathbf(n)], i.e., the infinity norm.

    [\left|\mathbf(n)\right| = \left|\sum_^(n-k) \mathbf(k)}\right|]
    :[\le \sum_^(n-k)\right| \left|\mathbf(k)\right|}] (by the triangle inequality)
    :[\le \sum_^(n-k)\right| \| x \|_}]
    :[= \| x \|_ \sum_^(n-k)\right|}]
    :[= \| x \|_ \sum_^(k)\right|}]
    If [\mathbf(n)] is BIBO stable, then [\sum_^(k)\right|} = \| h \|_1 < \infty] and

    [\| x \|_ \sum_^(k)\right|} = \| x \|_ \| h \|_1]
    So if [\| x \|_ < \infty] (i.e., it is bounded) then [\left|\mathbf(n)\right|] is bounded as well because [\| x \|_ \| h \|_1 < \infty].

    The proof for continuous-time follows the same arguments.

    Frequency domain condition

    Continuous signals

    For a causal, rational, continuous time system, the condition for stability is that the region of convergence (ROC) of the Laplace transform includes the imaginary axis. When the system is causal, the ROC is the open region to the right of a vertical line whose abscissa is the real part of the largest pole. (Largest here is defined so that the real part of the largest pole is greater than the real part of any other pole in the system.) The real part of the largest pole defining the ROC is called the abscissa of convergence. Therefore, all poles of the system must be in the strict left half of the s-plane for BIBO stability.

    This stability condition can be derived from the above time domain condition as follows :

    [\int_^(t)\right| dt}]
    :[ = \int_^(t)\right| \left| e^ \right| dt}]
    :[= \int_^(t) (1 \cdot e)^ \right| dt}]
    :[ = \int_^(t) (e^)^ \right| dt}]
    :[= \int_^(t) e^ \right| dt}]
    where [s = \sigma + j \omega] and [\mbox(s) = \sigma = 0].

    The region of convergence must therefore include the imaginary axis.

    Discrete signals

    For a causal, rational, discrete time system, the condition for stability is that the region of convergence (ROC) of the z-transform includes the unit circle. When the system is causal, the ROC is the open region outside a circle whose radius is the magnitude of the pole with largest magnitude. Therefore, all poles of the system must be inside the unit circle in the z-plane for BIBO stability.

    This stability condition can be derived in a similar fashion to the continuous derivation:

    [\sum_^(n)\right|}
    unit circle.

    See also

    References

    • Gordon E. Carlson Signal and Linear Systems Analysis with Matlab second edition, Wiley, 1998, ISBN 0-471-12465-6
    • John G. Proakis and Dimitris G. Mandalokis Digital Signal Processing Principals, Algorithms and Applications third edition, Prentice Hall, 1996, ISBN 0-13-394338-9
    • D. Ronald Fannin, William H. Tranter, and Rodger E. Ziemer Signals & Systems Continuous and Discrete fourth edition, Prentice Hall, 1998, ISBN 0-13-496456-x

     

    From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
    All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.

Search Titles
0123456789
ABCDEFGHIJ
KLMNOPQRST
UVWXYZ?

E-mail this article to:

Personal Message: