BIBO stability

Short description: When a system's outputs are bounded for every bounded input

In signal processing, specifically control theory, bounded-input, bounded-output (BIBO) stability is a form of stability for signals and systems that take inputs. 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 there is a finite value B>0 such that the signal magnitude never exceeds B, that is

For discrete-time signals: ∃B∀n( |y[n]|≤B)n∈ℤ
For continuous-time signals: ∃B∀t( |y(t)|≤B)t∈ℝ

## Contents

* 1 Time-domain condition for linear time-invariant systems
* 1.1 Continuous-time necessary and sufficient condition
* 1.2 Discrete-time sufficient condition
* 1.2.1 Proof of sufficiency
* 2 Frequency-domain condition for linear time-invariant systems
* 2.1 Continuous-time signals
* 2.2 Discrete-time signals
* 3 See also
* 4 Further reading
* 5 References

## Time-domain condition for linear time-invariant systems

### Continuous-time necessary and sufficient condition

For a continuous time linear time-invariant (LTI) system, the condition for BIBO stability is that the impulse response, h(t) , be absolutely integrable, i.e., its L1 norm exists.

∫−∞∞|h(t)|dt=‖h‖1∈ℝ

### Discrete-time sufficient condition

For a discrete time LTI system, the condition for BIBO stability is that the impulse response be absolutely summable, i.e., its ℓ1 norm exists.

∑n=−∞∞|h[n]|=‖h‖1∈ℝ

#### Proof of sufficiency

Given a discrete time LTI system with impulse response h[n] the relationship between the input  x[n] and the output  y[n] is

y[n]=h[n]*x[n]

where * denotes convolution. Then it follows by the definition of convolution

y[n]=∑k=−∞∞h[k]x[n−k]

Let ‖x‖∞ be the maximum value of  |x[n]|, i.e., the L∞-norm.

|y[n]|=|∑k=−∞∞h[n−k]x[k]|

≤∑k=−∞∞|h[n−k]||x[k]| (by the triangle inequality)

≤∑k=−∞∞|h[n−k]|‖x‖∞=‖x‖∞∑k=−∞∞|h[n−k]|=‖x‖∞∑k=−∞∞|h[k]|

If h[n] is absolutely summable, then ∑k=−∞∞|h[k]|=‖h‖1∈ℝ and

‖x‖∞∑k=−∞∞|h[k]|=‖x‖∞‖h‖1

So if h[n] is absolutely summable and |x[n]| is bounded, then |y[n]| is bounded as well because ‖x‖∞‖h‖1∈ℝ.

The proof for continuous-time follows the same arguments.

## Frequency-domain condition for linear time-invariant systems

### Continuous-time signals

For a rational and 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", or the pole that has the greatest real part of any 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:

∫−∞∞|h(t)|dt=∫−∞∞|h(t)||e−jωt|dt=∫−∞∞|h(t)(1⋅e)−jωt|dt=∫−∞∞|h(t)(eσ+jω)−t|dt=∫−∞∞|h(t)e−st|dt

where s=σ+jω and Re⁡(s)=σ=0.

The region of convergence must therefore include the imaginary axis.

### Discrete-time signals

For a rational and 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-time derivation:

∑n=−∞∞|h[n]|=∑n=−∞∞|h[n]||e−jωn|=∑n=−∞∞|h[n](1⋅e)−jωn|=∑n=−∞∞|h[n](rejω)−n|=∑n=−∞∞|h[n]z−n|

where z=rejω and r=|z|=1.

The region of convergence must therefore include the unit circle.

## See also

* LTI system theory
* Finite impulse response (FIR) filter
* Infinite impulse response (IIR) filter
* Nyquist plot
* Routh–Hurwitz stability criterion
* Bode plot
* Phase margin
* Root locus method
* Input-to-state stability

## Further reading

* 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. Manolakis Digital Signal Processing Principals, Algorithms and Applications third edition, Prentice Hall, 1996, ISBN 0-13-373762-4
* 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
* Proof of the necessary conditions for BIBO stability.
* Christophe Basso Designing Control Loops for Linear and Switching Power Supplies: A Tutorial Guide first edition, Artech House, 2012, 978-1608075577
* Michael Unser (2020). "A Note on BIBO Stability". IEEE Transactions on Signal Processing 68: 5904-5913. doi:10.1109/TSP.2020.3025029.

## References

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/BIBO stability. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=BIBO_stability&oldid=35522"