Skip to main content

Why Stable Systems Have Poles Inside the Unit Circle but AR Model Roots Are Outside?


Why Stable Systems Have Poles Inside the Unit Circle but AR Model Roots Are Outside?

Why Stable Systems Have Poles Inside the Unit Circle but AR Model Roots Are Outside?

If you've studied Digital Signal Processing (DSP) or Time Series Analysis, you've probably encountered two statements that seem contradictory:

  • A stable discrete-time system must have its poles inside the unit circle.
  • A stable AR (Auto-Regressive) model requires its roots to lie outside the unit circle.

At first glance, these statements appear to conflict. Fortunately, they are both correct. The apparent contradiction comes from the fact that DSP and statistics define the characteristic polynomial differently.

This article explains why both statements are true and clears up one of the most common sources of confusion in signal processing.


Stability of Continuous-Time Systems

For a continuous-time system, the transfer function is

H(s) = N(s) / D(s)

A system is stable only if all poles satisfy

Re(s) < 0

This means every pole must lie in the left-half of the complex plane.

The reason is straightforward. The natural response contains exponential terms of the form

est = e(σ + jω)t = eσtejωt

When σ is negative, the exponential decays over time, ensuring stability.


Stability of Discrete-Time Systems

For a discrete-time system, the transfer function is

H(z) = B(z) / A(z)

The stability condition changes to

|z| < 1

In other words, all poles must lie inside the unit circle.

Why?

The system response contains terms of the form

zn

Depending on the magnitude of z:

Condition Behavior Result
|z| < 1 zn → 0 Stable
|z| > 1 zn → ∞ Unstable

This is why DSP textbooks always state that stable systems have poles inside the unit circle.


Then Why Do AR Models Require Roots Outside the Unit Circle?

This is where the confusion begins.

An AR model is usually written as

x[n] − a₁x[n−1] − a₂x[n−2] − ... = e[n]

Taking the Z-transform gives

A(z)X(z) = E(z)

where

A(z) = 1 − a₁z−1 − a₂z−2 − ...

The transfer function becomes

H(z) = 1 / A(z)

The poles are obtained by solving

A(z) = 0

These poles must satisfy

|z| < 1

So from the DSP perspective, AR model poles must be inside the unit circle.


Where Does Roots Outside the Unit Circle Come From?

Many statistics and econometrics textbooks define the characteristic polynomial differently:

1 − a₁z − a₂z² − ... − apzp = 0

Notice that this equation uses z instead of z⁻¹.

If we define

w = 1 / z

then every characteristic root is simply the reciprocal of a pole.

Example

Suppose a stable system has a pole at

z = 0.5

The corresponding characteristic root is

w = 1 / 0.5 = 2

Representation Location
DSP Pole Inside Unit Circle (0.5)
Characteristic Root Outside Unit Circle (2)

Both describe exactly the same stable system.


What About MA Models?

An MA (Moving Average) model is written as

x[n] = B(z)e[n]

where

B(z) = 1 + b₁z−1 + b₂z−2 + ...

Unlike AR models, MA models have no non-trivial poles. Therefore, every finite-order MA model is inherently stable.

Then why must MA roots lie outside the unit circle?

The answer is invertibility, not stability.

To recover the input from the output, we use the inverse filter

1 / B(z)

For this inverse filter to remain stable, its poles (which are the zeros of the MA model) must lie inside the unit circle.

Therefore, the zeros of the MA model itself must lie outside the unit circle.


Summary: Stability vs. Invertibility

System Condition Reason
Discrete-Time LTI System Poles inside the unit circle Stability
AR Model (DSP notation) Poles inside the unit circle Stable filter
AR Model (Statistics notation) Characteristic roots outside the unit circle Roots are reciprocals of poles
MA Model Always stable No non-trivial poles
MA Model Zeros outside the unit circle Stable inverse (invertibility)

Summary

  • DSP works directly with the poles of the transfer function, which must lie inside the unit circle.
  • Time-series analysis often discusses the roots of the characteristic polynomial, which are the reciprocals of those poles and therefore lie outside the unit circle.

Why Are MA (Moving Average) Models Always Stable?

One of the key differences between Auto-Regressive (AR) and Moving Average (MA) models is that a finite-order MA model is always stable. This often surprises beginners because AR models require stability conditions, whereas MA models do not.

Understanding the MA Model

A Moving Average model of order q, denoted as MA(q), is defined as

x[n] = e[n] + b1e[n-1] + b2e[n-2] + ... + bqe[n-q]

where:

  • x[n] is the output signal.
  • e[n] is white noise (input).
  • b1, b2, ..., bq are the MA coefficients.

Taking the Z-transform gives the transfer function

H(z) = 1 + b1z-1 + b2z-2 + ... + bqz-q

Notice the Important Difference

Unlike an AR model, the MA transfer function contains only a numerator polynomial. It can also be written as

H(z) = B(z)

Since there is no denominator polynomial, there are no finite poles that can make the system unstable.

Impulse Response of an MA Model

The impulse response of an MA(q) model is

h[n] = {1, b1, b2, ..., bq, 0, 0, 0, ...}

Notice that the impulse response contains only q + 1 non-zero samples. After that, it becomes exactly zero.

Why Does This Guarantee Stability?

A discrete-time LTI system is BIBO (Bounded-Input Bounded-Output) stable if its impulse response is absolutely summable:

∑ |h[n]| < ∞

Since an MA model has only a finite number of non-zero impulse response samples, the summation becomes

|1| + |b1| + |b2| + ... + |bq|

This sum is always finite for finite coefficient values. Therefore,

∑ |h[n]| < ∞

which satisfies the BIBO stability condition.

What About the Roots of an MA Model?

Although an MA model is always stable, its zeros (also called MA roots) still play an important role. These roots do not affect stability. Instead, they determine whether the model is invertible.

For an MA model to be invertible, all its zeros must lie outside the unit circle. This ensures that the inverse filter

1 / B(z)

has all its poles inside the unit circle and is therefore stable.

Summary
  • An MA model has no denominator polynomial, so it has no finite poles that can cause instability.
  • Its impulse response is of finite duration, making it absolutely summable.
  • Therefore, every finite-order MA model is always BIBO stable.
  • The roots (zeros) of an MA model are related to invertibility, not stability.


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. ...

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...

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...

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 →

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} \] ...

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):

Online Simulator for ASK, FSK, and PSK

Interactive Digital Signal Processing (DSP) Tutorial and Simulator for ASK, FSK, and BPSK modulation techniques. Try our new Digital Signal Processing Simulator!   •   Interactive ASK, FSK, and BPSK tools updated for 2025. Start Now Digital Modulation Visualizer: ASK, FSK, & BPSK Simulator Learn and visualize binary modulation techniques (ASK, FSK, BPSK) in real-time with adjustable carrier and sampling parameters. Perfect for DSP students and engineers. 📡 ASK Simulator 📶 FSK Simulator 🎚️ BPSK Simulator 📚 More Topics ASK Modulator FSK Modulator BPSK Modulator More Topics 1. ASK (Amplitude Shift Keying) Simulat...