BIBO stability
≈ 5 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
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: \exists B \forall n(\ |y[n]| \leq B) \quad n \in \mathbb{Z} :For continuous-time signals: \exists B \forall t(\ |y(t)| \leq B) \quad t \in \mathbb{R}
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: \exists B \forall n(\ |y[n]| \leq B) \quad n \in \mathbb{Z} For continuous-time signals: \exists B \forall t(\ |y(t)| \leq B) \quad t \in \mathbb{R}
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 L 1 norm exists. \int_{-\infty}^\infty \left|h(t)\right|\,\mathord{\operatorname{d}}t = \| h \|_1 \in \mathbb{R}
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 \ell^1 norm exists. \ \sum_{n=-\infty}^\infty |h[n]| = \| h \|_1 \in \mathbb{R}
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] = \sum_{k=-\infty}^\infty h[k] x[n-k] Let \| x \|_{\infty} be the maximum value of \ |x[n]| , i.e., the L_{\infty} -norm. \left|y[n]\right| = \left|\sum_{k=-\infty}^\infty h[n-k] x[k]\right| \le \sum_{k=-\infty}^\infty \left|h[n-k]\right| \left|x[k]\right| (by the triangle inequality) \begin{align} & \le \sum_{k=-\infty}^\infty \left|h[n-k]\right| \| x \|_\infty \\ & = \| x \|_{\infty} \sum_{k=-\infty}^\infty \left|h[n-k]\right| \\ & = \| x \|_{\infty} \sum_{k=-\infty}^\infty \left|h[k]\right| \end{align} If h[n] is absolutely summable, then \sum_{k=-\infty}^{\infty}{\left|h[k]\right|} = \| h \|_1 \in \mathbb{R} and \| x \|_\infty \sum_{k=-\infty}^\infty \left|h[k]\right| = \| x \|_\infty \| h \|_1 So if h[n] is absolutely summable and \left|x[n]\right| is bounded, then \left|y[n]\right| is bounded as well because \| x \|_{\infty} \| h \|_1 \in \mathbb{R} .
The proof for continuous-time follows the same arguments.
Frequency-domain condition for linear time-invariant systems
& = \int_{-\infty}^\infty \left|h(t)\right| \left| e^{-j \omega t }\right| \, dt \\ & = \int_{-\infty}^\infty \left|h(t) (1 \cdot e)^{-j \omega t} \right| \, dt \\ & = \int_{-\infty}^\infty \left|h(t) (e^{\sigma + j \omega})^{- t} \right| \, dt \\ & = \int_{-\infty}^\infty \left|h(t) e^{-s t} \right| \, dt \end{align} where s = \sigma + j \omega and \operatorname{Re}(s) = \sigma = 0. The region of convergence must therefore include the imaginary axis. \sum_{n = -\infty}^\infty \left|h[n]\right| & = \sum_{n = -\infty}^\infty \left|h[n]\right| \left| e^{-j \omega n} \right| \\ & = \sum_{n = -\infty}^\infty \left|h[n] (1 \cdot e)^{-j \omega n} \right| \\ & =\sum_{n = -\infty}^\infty \left|h[n] (r e^{j \omega})^{-n} \right| \\ & = \sum_{n = -\infty}^\infty \left|h[n] z^{- n} \right| \end{align} where z = r e^{j \omega} and r = |z| = 1 .
The region of convergence must therefore include the unit circle.
Further reading
Gordon E. Carlson Signal and Linear Systems Analysis with Matlab second edition, Wiley, 1998, John G. Proakis and Dimitris G. Manolakis Digital Signal Processing Principals, Algorithms and Applications third edition, Prentice Hall, 1996, D. Ronald Fannin, William H. Tranter, and Rodger E. Ziemer Signals & Systems Continuous and Discrete fourth edition, Prentice Hall, 1998, 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
Text derived from https://en.wikipedia.org/w/index.php?oldid=1224571567 under CC BY-SA 4.0; modifications have been made.