Skip to main content

Relationship Between Wide-Sense Stationary (WSS) Processes and the Yule-Walker Equations

 

The Yule-Walker equations are fundamentally derived using the properties of a Wide-Sense Stationary (WSS) random process. Without the WSS assumption, the classical Yule-Walker equations cannot be obtained in their standard form.


What is a Wide-Sense Stationary (WSS) Process?

A random process \(X(t)\) is said to be Wide-Sense Stationary (WSS) if it satisfies three important conditions.

1. Constant Mean

$$ E[X(t)] = \mu $$ where the mean \(\mu\) does not depend on time.

2. Constant Variance

$$ Var(X(t))=\sigma^2 $$ The variance remains unchanged over time.

3. Autocovariance Depends Only on Lag

Instead of depending on two different time instants, $$ C_X(t_1,t_2), $$ the covariance depends only on their difference, $$ C_X(\tau) = C_X(t_1-t_2). $$ Similarly, the autocorrelation function becomes $$ R_X(\tau) = E[X(t)X(t+\tau)]. $$ This property is the key assumption used in deriving the Yule-Walker equations.

What are the Yule-Walker Equations?

The Yule-Walker equations describe the relationship between the autocorrelation function of a stationary process and the coefficients of an Autoregressive (AR) model.

Consider an AR(p) process: $$ X_t = \phi_1X_{t-1} + \phi_2X_{t-2} + \cdots + \phi_pX_{t-p} + \varepsilon_t $$ where
  • \(\phi_1,\phi_2,\ldots,\phi_p\) are AR coefficients.
  • \(\varepsilon_t\) is white noise with
$$ E[\varepsilon_t]=0 $$ and $$ Var(\varepsilon_t)=\sigma_\varepsilon^2. $$

Derivation Using the WSS Assumption

Multiply both sides of the AR equation by \(X_{t-k}\) and take expectations.

$$ E[X_tX_{t-k}] = \sum_{i=1}^{p} \phi_i E[X_{t-i}X_{t-k}] $$ Because the process is WSS, $$ E[X_tX_{t-k}] = \gamma(k), $$ where $$ \gamma(k) = Cov(X_t,X_{t-k}) $$ depends only on the lag \(k\). Therefore, $$ \boxed{ \gamma(k) = \sum_{i=1}^{p} \phi_i \gamma(k-i) } $$ for $$ k\ge1. $$ These are known as the Yule-Walker equations.

Matrix Form of the Yule-Walker Equations

For an AR(p) process, $$ \begin{bmatrix} \gamma(0) & \gamma(1) & \cdots & \gamma(p-1)\\ \gamma(1) & \gamma(0) & \cdots & \gamma(p-2)\\ \vdots & \vdots & \ddots & \vdots\\ \gamma(p-1) & \gamma(p-2) & \cdots & \gamma(0) \end{bmatrix} \begin{bmatrix} \phi_1\\ \phi_2\\ \vdots\\ \phi_p \end{bmatrix} = \begin{bmatrix} \gamma(1)\\ \gamma(2)\\ \vdots\\ \gamma(p) \end{bmatrix} $$ The covariance matrix is a Toeplitz matrix, which occurs only because the covariance depends solely on lag—a direct consequence of WSS.

Why is WSS Essential?

If a process is not stationary, then

$$ \gamma(t_1,t_2) \neq \gamma(t_1-t_2). $$

Instead, covariance depends on both time indices independently. As a result:

  • The covariance matrix is no longer Toeplitz.
  • The Yule-Walker equations lose their standard form.
  • Estimating AR coefficients becomes significantly more difficult.

Relationship Between WSS and the Yule-Walker Equations

In summary:

  • Wide-Sense Stationarity (WSS) is the fundamental assumption.
  • It ensures that autocovariance depends only on lag.
  • This property enables the derivation of the Yule-Walker equations.
  • The equations are specifically used for estimating the coefficients of stationary AR models.
  • Although every stationary AR process is WSS (under standard stability conditions), not every WSS process is autoregressive.

Frequently Asked Questions (FAQs)

Is stationarity required for the Yule-Walker equations?

Yes. The derivation relies on the covariance function depending only on lag, which is a defining property of wide-sense stationary processes.

Can Yule-Walker estimate MA model parameters?

No. The classical Yule-Walker equations are designed for autoregressive (AR) models. Other estimation techniques are generally used for MA and ARMA models.

Why is the covariance matrix Toeplitz?

Because, under WSS, each covariance entry depends only on the lag between two observations rather than their absolute time indices.


Summary: The Yule-Walker equations are a direct consequence of the Wide-Sense Stationary assumption. WSS provides the lag-dependent autocovariance structure required to derive and solve these equations for estimating autoregressive model coefficients.



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