Skip to main content

Stable and Unstable LTI Systems: BIBO Stability and Pole Analysis


Stable and Unstable LTI Systems: BIBO Stability and Pole Analysis

Stable and Unstable LTI Systems

An In-depth Engineering Guide to BIBO Stability and Impulse Response Analysis

In signals and systems analysis, a Linear Time-Invariant (LTI) system is classified as stable if every bounded input results in a bounded output. This fundamental property ensures that the system does not produce divergent or uncontrollable signals under normal operating conditions. Conversely, if a system produces an unbounded output for at least one bounded input, it is classified as unstable.


1. BIBO Stability (Bounded Input Bounded Output)

The BIBO Condition:

A system is BIBO Stable if for every input signal $x(t)$ (or $x[n]$) that is bounded:
|x(t)| ≤ Mx < ∞
The resulting output $y(t)$ (or $y[n]$) is also guaranteed to be bounded:
|y(t)| ≤ My < ∞
where $M_x$ and $M_y$ are finite constants.

Simply put: Bounded Input ⇒ Bounded Output. If a system’s internal energy grows without bound despite a finite input, it fails this criteria.


2. Stability Condition for Continuous-Time LTI Systems

For a continuous-time system with impulse response h(t), the output is determined by the convolution integral:

y(t) = x(t) * h(t) = ∫-∞ h(Ï„) x(t - Ï„) dÏ„

The necessary and sufficient condition for BIBO stability is that the impulse response must be absolutely integrable:

-∞ |h(t)| dt < ∞

3. Stability Condition for Discrete-Time LTI Systems

For a discrete-time system with impulse response h[n], the output is the convolution sum. The system is stable if and only if the impulse response is absolutely summable:

Σn=-∞ |h[n]| < ∞

If the sum diverges to infinity, the discrete-time LTI system is unstable.


4. Characteristics of Unstable LTI Systems

An unstable system is one where a finite input causes the system to "run away." Mathematically, this occurs when:

  • The impulse response h(t) grows exponentially or remains constant (non-zero) as $t \to \infty$.
  • The integral (or sum) of the absolute value of the impulse response is infinite.
  • In physical terms, the system contains internal feedback that reinforces the signal indefinitely.

5. Stability Analysis via Pole Criterion

In the frequency domain, the stability of a causal LTI system is determined by the location of the poles of its transfer function H(s) or H(z).

Continuous-Time Systems (S-Plane)

Pole Location (Real Part of s) Stability Status
All poles in the Left Half Plane (Re{s} < 0) Stable
Any pole in the Right Half Plane (Re{s} > 0) Unstable
Simple poles on the Imaginary Axis (Re{s} = 0) Marginally Stable

Discrete-Time Systems (Z-Plane)

  • Stable: All poles lie inside the unit circle (|z| < 1).
  • Unstable: Any pole lies outside the unit circle (|z| > 1).
  • Marginally Stable: Simple poles lie on the unit circle (|z| = 1).

6. Illustrative Examples

Example 1: Stable System

Consider a system with impulse response: h(t) = e−2t u(t)

Calculating the integral:

0 |e−2t| dt = [−1/2 e−2t]0 = 0 − (−1/2) = 1/2

Since 1/2 is finite, the system is Stable.

Example 2: Unstable System

Consider a system with impulse response: h(t) = e2t u(t)

Calculating the integral:

0 e2t dt = [1/2 e2t]0 = ∞

Because the integral diverges, the system is Unstable.


7. Quick Summary Table

Feature Stable System Unstable System
BIBO Result Output remains bounded Output can grow to infinity
CT Condition ∫ |h(t)| dt < ∞ ∫ |h(t)| dt = ∞
DT Condition Σ |h[n]| < ∞ Σ |h[n]| = ∞
Pole Location (CT) All poles in Left Half Plane Any pole in Right Half Plane
Summary: For any LTI system, stability is an inherent property of the system itself, specifically its impulse response. It does not depend on the specific input signal used, provided that the input is bounded.


Contact Us

Name

Email *

Message *

Popular Posts

Q-function in BER vs SNR Calculation (with Simulation)

Q-function in BER vs. SNR Calculation In digital communications and signal processing, the Q-function plays a significant role in predicting system reliability. It allows engineers to quantify the probability that Gaussian noise will exceed a specific threshold, causing a bit error. What is the Q-function? The Q-function is a mathematical function representing the tail probability of the standard normal (Gaussian) distribution. It is the complementary cumulative distribution function (CCDF) of a standard Gaussian distribution. Q(x) = (1 / √(2Ï€)) ∫â‚“∞ e^(-t² / 2) dt Q-Function Interactive Simulator Move the slider to see how the "Tail Probability" (the area in red) changes. This area represents the Probability of Error (BER) . Threshold Distance ( x ) — (Simulates Increasing SNR) x = 1.0 Q(x) = 0.1587 ...

Design of CMOS Flip-Flops (SR, D, JK)

Design of CMOS Flip-Flops (SR, D, JK) A flip-flop or latch is a circuit with two stable states, used to store state information. It is the basic storage element in sequential logic and a fundamental building block in digital electronics systems, including computers and communication devices. Flip-flops and latches act as data storage elements for states, pulse counting, and synchronization of variably-timed input signals to a reference clock. Flip-flops can be transparent/opaque (latches) or clocked (synchronous, edge-triggered). Latches are level-sensitive, while flip-flops are edge-sensitive. In sequential logic, the output depends on current inputs and previous states. Fig.1 shows a sequential circuit combining a combinational block and a memory element. ...

BER vs SNR for M-ary QAM, M-ary PSK, QPSK, BPSK, ...(MATLAB Code + Simulator)

Bit Error Rate (BER) & SNR Guide Analyze communication system performance with our interactive simulators and MATLAB tools. 📘 Theory 🧮 Simulators 💻 MATLAB Code 📚 Resources BER Definition SNR Formula BER Calculator MATLAB Comparison 📂 Explore M-ary QAM, PSK, and QPSK Topics ▼ 🧮 Constellation Simulator: M-ary QAM 🧮 Constellation Simulator: M-ary PSK 🧮 BER calculation for ASK, FSK, and PSK 🧮 Approaches to BER vs SNR What is Bit Error Rate (BER)? The BER indicates how many corrupted bits are received compared to the total number of bits sent. It is the primary figure of merit f...

Pulse Width Modulation (PWM)

Pulse-width modulation (PWM), or pulse-duration modulation (PDM), is a method of controlling the average power delivered by an electrical signal.   Fig: An example of PWM in an idealized inductor driven by a blue line voltage source modulated as a series of sawtooth pulses, resulting in a red line current in the inductor.    Generating a PWM Signal The simplest way to generate a PWM signal is the intersection method, which requires only a sawtooth or a triangle waveform (easily generated using a simple oscillator) and a comparator. When the value of the reference signal is more than the modulation waveform, the PWM signal (magenta) is in the high state; otherwise, it is in the low state.      Duty cycle A low duty cycle equates to low power because the power is off for most of the time; the word duty cycle reflects the ratio of "on" time to the regular interval or "period" of time. The duty cycle is measured in percent, with 100% representing full o...

Frequency Shift Keying (FSK) Modulation & Demodulation (with Simulation)

Frequency Shift Keying (FSK) Theoretical Foundations: Frequency Shift Keying (FSK) is a discrete frequency modulation scheme wherein the digital information is encoded via instantaneous shifts in the carrier signal's frequency. The fundamental implementation is Binary FSK (BFSK), which maps binary data onto two distinct, discrete spectral states. A binary '1' (the "mark" state) is represented by a carrier frequency \( f_1 \), while a binary '0' (the "space" state) corresponds to frequency \( f_2 \). Each symbol is sustained for a bit interval denoted by \( T_b \). FSK Transmitter Characterization: The mathematical model for the modulated BFSK output \( s(t) \) is defined as: \[ s(t) = \begin{cases} A_c \cos(2\pi f_1 t), & \text{for } m = 1 \\ A_c \cos(2\pi f_2 t), & \text{for } m = 0 \end{cases} \] ...

FFT Butterfly Method Explained (with Example of 4-point DFT)

  FFT Using Butterfly Method Given: x[n] = {0, 1, 2, 3} Step 1: Split into Even & Odd Even indices: x e = {0, 2} Odd indices: x o = {1, 3} Step 2: 2-point DFT For any {a, b}: DFT = {a + b, a - b} Even Part: E = {0+2, 0-2} = {2, -2} Odd Part: O = {1+3, 1-3} = {4, -2} Step 3: Combine Using Butterfly X[k] = E[k] + W k O[k] X[k + N/2] = E[k] - W k O[k] For N = 4: W 0 = 1 W 1 = -j Final Calculations X[0] = 2 + 4 = 6 X[2] = 2 - 4 = -2 X[1] = -2 + (-j)(-2) = -2 + 2j X[3] = -2 - (-j)(-2) = -2 - 2j Final Answer: X[k] = {6, -2 + 2j, -2, -2 - 2j} Try Interactive Online Simulations Interactive FFT Online Simulator (For understanding Fundamentals)  Interactive FFT Online Simulator (Analyze .CSV, .MP3, .MP4, etc. Further Reading Fourier Transform OFDM Return to Fourier Transform Main Page →

AM Modulation Online Simulator

Amplitude Modulation Simulator s AM (t) = A c [1 + k a m(t)] cos(ω c t) where, ω = 2πf & k a = Amplitude Sensitivity Modulation index, μ = k a A m Message Frequency (fm): Carrier Frequency (fc): Carrier Amplitude (Ac): Modulation Index (m = Am / Ac):