Skip to main content

System Stability and Routh–Hurwitz Criterion Explained


When is a System Stable?

A system is stable if its output remains bounded and well-behaved over time, especially when subjected to bounded inputs.

1. BIBO Stability (Bounded-Input Bounded-Output Stability)

A system is BIBO stable if:

Every bounded input produces a bounded output.


If |x(t)| < Mx < ∞

then |y(t)| < My < ∞
        

For some finite constant My.

For LTI Systems:

A continuous-time LTI system is stable if and only if:


∫ |h(t)| dt < ∞
        

That is, the impulse response must be absolutely integrable.

For discrete-time systems:


Σ |h[n]| < ∞
        

2. Stability in Terms of Poles (Control Systems)

Continuous-Time System:

The system is stable if all poles satisfy:


Re(s) < 0
        

That means all poles lie in the left-half of the s-plane.

Discrete-Time System:

The system is stable if:


|z| < 1
        

That means all poles lie inside the unit circle in the z-plane.

3. Physical Interpretation

  • Its natural response decays to zero with time.
  • It does not oscillate with growing amplitude.
  • It does not blow up to infinity.

4. Simple Examples

Stable:


h(t) = e^{-3t}u(t)
        

Poles at s = -2, -5

Unstable:


h(t) = e^{2t}u(t)
        

Pole at s = +2

Marginally Stable:

Pure sinusoid (poles on imaginary axis, not repeated). Output oscillates but does not grow.

Conclusion

A system is stable when its response does not grow unbounded with time, and bounded inputs always produce bounded outputs.

Routh–Hurwitz Criterion – Numeric Examples

Case 1: Normal Case (Stable System)


Characteristic Equation: s³ + 6s² + 11s + 6 = 0
        
1 11
6 6
10 0
s⁰ 6

All first-column elements are positive → Stable

Case 2: Sign Change (Unstable System)


Characteristic Equation: s³ + 2s² − s − 2 = 0
        

One sign change → 1 RHP root → Unstable

Case 3: Zero in First Column (Epsilon Method)


Characteristic Equation: s³ + 2s² + s + 2 = 0
        

Replace 0 with small positive ε.

No sign change as ε → 0⁺ → Stable

Case 4: Entire Row Becomes Zero (Auxiliary Equation)


Characteristic Equation: s⁴ + 2s³ + 2s² + 2s + 1 = 0
        

Auxiliary Equation: A(s) = s² + 1
A′(s) = 2s
        

Roots of s² + 1 = 0 → s = ±j
        

Pure imaginary roots → Marginally Stable

Case 5: Repeated Imaginary Roots (Unstable)


Characteristic Equation: s⁴ + 2s² + 1 = 0
(s² + 1)² = 0
        

Repeated Roots: s = ±j
        

Repeated imaginary roots → Unstable

Final Summary

Case Condition Example Stability
1 No sign change s³ + 6s² + 11s + 6 Stable
2 Sign change s³ + 2s² − s − 2 Unstable
3 Zero in first column s³ + 2s² + s + 2 Stable
4 Entire row zero s⁴ + 2s³ + 2s² + 2s + 1 Marginal
5 Repeated imaginary roots (s² + 1)² Unstable

People are good at skipping over material they already know!

View Related Topics to







Contact Us

Name

Email *

Message *

Popular Posts

Online Simulator for ASK, FSK, and PSK

Try our new Digital Signal Processing Simulator!   Start Simulator for binary ASK Modulation Message Bits (e.g. 1,0,1,0) Carrier Frequency (Hz) Sampling Frequency (Hz) Run Simulation Simulator for binary FSK Modulation Input Bits (e.g. 1,0,1,0) Freq for '1' (Hz) Freq for '0' (Hz) Sampling Rate (Hz) Visualize FSK Signal Simulator for BPSK Modulation ...

Channel Impulse Response (CIR)

📘 Overview & Theory 📘 How CIR Affects the Signal 🧮 Online Channel Impulse Response Simulator 🧮 MATLAB Codes 📚 Further Reading What is the Channel Impulse Response (CIR)? The Channel Impulse Response (CIR) is a concept primarily used in the field of telecommunications and signal processing. It provides information about how a communication channel responds to an impulse signal. It describes the behavior of a communication channel in response to an impulse signal. In signal processing, an impulse signal has zero amplitude at all other times and amplitude ∞ at time 0 for the signal. Using a Dirac Delta function, we can approximate this. Fig: Dirac Delta Function The result of this calculation is that all frequencies are responded to equally by δ(t) . This is crucial since we never know which frequenci...

BER vs SNR for M-ary QAM, M-ary PSK, QPSK, BPSK, ...

📘 Overview of BER and SNR 🧮 Online Simulator for BER calculation of m-ary QAM and m-ary PSK 🧮 MATLAB Code for BER calculation of M-ary QAM, M-ary PSK, QPSK, BPSK, ... 📚 Further Reading 📂 View Other Topics on M-ary QAM, M-ary PSK, QPSK ... 🧮 Online Simulator for Constellation Diagram of m-ary QAM 🧮 Online Simulator for Constellation Diagram of m-ary PSK 🧮 MATLAB Code for BER calculation of ASK, FSK, and PSK 🧮 MATLAB Code for BER calculation of Alamouti Scheme 🧮 Different approaches to calculate BER vs SNR What is Bit Error Rate (BER)? The abbreviation BER stands for Bit Error Rate, which indicates how many corrupted bits are received (after the demodulation process) compared to the total number of bits sent in a communication process. BER = (number of bits received in error) / (total number of tran...

Gaussian minimum shift keying (GMSK)

📘 Overview & Theory 🧮 Simulator for GMSK 🧮 MSK and GMSK: Understanding the Relationship 🧮 MATLAB Code for GMSK 📚 Simulation Results for GMSK 📚 Q & A and Summary 📚 Further Reading Dive into the fascinating world of GMSK modulation, where continuous phase modulation and spectral efficiency come together for robust communication systems! Core Process of GMSK Modulation Phase Accumulation (Integration of Filtered Signal) After applying Gaussian filtering to the Non-Return-to-Zero (NRZ) signal, we integrate the smoothed NRZ signal over time to produce a continuous phase signal: θ(t) = ∫ 0 t m filtered (τ) dτ This integration is crucial for avoiding abrupt phase transitions, ensuring smooth and continuous phase changes. Phase Modulation The next step involves using the phase signal to modulate a...

Constellation Diagrams of ASK, PSK, and FSK

📘 Overview of Energy per Bit (Eb / N0) 🧮 Online Simulator for constellation diagrams of ASK, FSK, and PSK 🧮 Theory behind Constellation Diagrams of ASK, FSK, and PSK 🧮 MATLAB Codes for Constellation Diagrams of ASK, FSK, and PSK 📚 Further Reading 📂 Other Topics on Constellation Diagrams of ASK, PSK, and FSK ... 🧮 Simulator for constellation diagrams of m-ary PSK 🧮 Simulator for constellation diagrams of m-ary QAM BASK (Binary ASK) Modulation: Transmits one of two signals: 0 or -√Eb, where Eb​ is the energy per bit. These signals represent binary 0 and 1.    BFSK (Binary FSK) Modulation: Transmits one of two signals: +√Eb​ ( On the y-axis, the phase shift of 90 degrees with respect to the x-axis, which is also termed phase offset ) or √Eb (on x-axis), where Eb​ is the energy per bit. These signals represent binary 0 and 1.  BPSK (Binary PSK) Modulation: Transmits one of two signals...

Q-function in BER vs SNR Calculation

Q-function in BER vs. SNR Calculation In the context of Bit Error Rate (BER) and Signal-to-Noise Ratio (SNR) calculations, the Q-function plays a significant role, especially in digital communications and signal processing . What is the Q-function? The Q-function is a mathematical function that represents the tail probability of the standard normal distribution. Specifically, it is defined as: Q(x) = (1 / sqrt(2π)) ∫ₓ∞ e^(-t² / 2) dt In simpler terms, the Q-function gives the probability that a standard normal random variable exceeds a value x . This is closely related to the complementary cumulative distribution function of the normal distribution. The Role of the Q-function in BER vs. SNR The Q-function is widely used in the calculation of the Bit Error Rate (BER) in communication systems, particularly in systems like Binary Phase Shift Ke...

Wireless Communication Interview Questions | Page 2

Wireless Communication Interview Questions Page 1 | Page 2| Page 3| Page 4| Page 5   Digital Communication (Modulation Techniques, etc.) Importance of digital communication in competitive exams and core industries Q. What is coherence bandwidth? A. See the answer Q. What is flat fading and slow fading? A. See the answer . Q. What is a constellation diagram? Q. One application of QAM A. 802.11 (Wi-Fi) Q. Can you draw a constellation diagram of 4QPSK, BPSK, 16 QAM, etc. A.  Click here Q. Which modulation technique will you choose when the channel is extremely noisy, BPSK or 16 QAM? A. BPSK. PSK is less sensitive to noise as compared to Amplitude Modulation. We know QAM is a combination of Amplitude Modulation and PSK. Go through the chapter on  "Modulation Techniques" . Q.  Real-life application of QPSK modulation and demodulation Q. What is  OFDM?  Why do we use it? Q. What is the Cyclic prefix in OFDM?   Q. In a c...

LDPC Encoding and Decoding Techniques

📘 Overview & Theory 🧮 LDPC Encoding Techniques 🧮 LDPC Decoding Techniques 📚 Further Reading 'LDPC' is the abbreviation for 'low density parity check'. LDPC code H matrix contains very few amount of 1's and mostly zeroes. LDPC codes are error correcting code. Using LDPC codes, channel capacities that are close to the theoretical Shannon limit can be achieved.  Low density parity check (LDPC) codes are linear error-correcting block code suitable for error correction in a large block sizes transmitted via very noisy channel. Applications requiring highly reliable information transport over bandwidth restrictions in the presence of noise are increasingly using LDPC codes. 1. LDPC Encoding Technique The proper form of H matrix is derived from the given matrix by doing multiple row operations as shown above. In the above, H is parity check matrix and G is generator matrix. If you consider matrix H as [-P' | I] then matrix G will b...