A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Parametric Signal Models: AR, MA, and ARMA

Research Depth 84 in the knowledge graph ☐ I know this ☆ Set as goal
3topics build on this
365prerequisites beneath it
See this on the map →
Autocorrelation Function Properties and Estimation→→System Identification Basics
parametric-models AR MA ARMA signal-modeling

Core Idea

Parametric models represent signals as outputs of linear systems driven by white noise. Autoregressive (AR) models use feedback (poles only); moving-average (MA) models use feedforward (zeros only); ARMA uses both. These models are more parsimonious than non-parametric methods for sufficiently regular signals, enabling spectral estimation with fewer parameters. Model order selection and parameter estimation are critical for accuracy.

How It's Best Learned

Generate autoregressive signal using known AR coefficients. Estimate AR model order and coefficients from the data using Yule-Walker method. Verify estimated parameters match generation parameters.

Common Misconceptions

Explainer

Your prerequisite — the autocorrelation function — tells you how similar a signal is to a shifted version of itself. A slowly decaying autocorrelation indicates a signal that changes slowly and has narrow, peaked spectral features; a rapidly decaying autocorrelation indicates a broadband signal that changes quickly. Parametric signal models exploit this structure: instead of describing the spectrum nonparametrically (by computing the DFT of a finite data record), you hypothesize that the signal was generated by passing white noise through a linear filter, and you estimate that filter's parameters from data. If the model is a good fit, you need far fewer numbers to describe the signal than a full nonparametric spectrum requires — and you can achieve much higher frequency resolution from a short data record.

The three model families differ in their assumed filter structure. An autoregressive (AR) model uses only feedback — the current sample x[n] is a weighted sum of p past samples plus white noise e[n]: x[n] = a₁x[n−1] + ... + aₚx[n−p] + e[n]. In z-transform terms, the transfer function has only poles: H(z) = 1/(A(z)). An all-poles model can represent sharp spectral peaks (resonances) very efficiently — an AR(2) model captures a single narrow resonance with just two parameters. This makes AR models natural for speech (strong formant resonances), EEG (alpha and beta band oscillations), and vibration monitoring (rotating machinery with dominant shaft frequencies). A moving-average (MA) model uses only feedforward — the current sample depends on a weighted sum of past noise inputs. Its transfer function has only zeros and is better at representing spectral nulls. An ARMA model uses both poles and zeros, giving a compact rational representation of signals with both peaks and notches — more flexible than either AR or MA alone, and the right choice when the signal comes from a physical system with both resonances and anti-resonances.

The practical power of AR models specifically comes from the Yule-Walker equations: R[k] = a₁R[k−1] + ... + aₚR[k−p] for k = 1, 2, ..., p, where R[k] is the autocorrelation at lag k. This is a linear system in the AR coefficients, solvable directly from the autocorrelation sequence — no iterative optimization required. The Levinson-Durbin algorithm solves this system efficiently in O(p²) operations and, as a byproduct, computes the reflection coefficients that reveal whether the model is stable (all poles inside the unit circle) at every step. Once the AR coefficients are estimated, the parametric spectral estimate is P̂(ω) = σ²_e / |A(ejω)|², where σ²_e is the white noise variance. This spectrum can resolve two closely spaced sinusoids that would appear as a single broadened peak in a periodogram of the same data length — the key advantage of parametric methods.

Model order selection is the central challenge. Too low an order: the model underfits and the spectral estimate is oversmoothed, blurring together nearby frequency components into a single broad hump. Too high an order: the model overfits, fitting noise structure as if it were signal, and spurious spectral peaks appear at meaningless frequencies. The Akaike Information Criterion AIC = N ln(σ²_e) + 2p and the Minimum Description Length MDL = N ln(σ²_e) + p ln(N) both penalize increasing order — MDL more strongly so. The optimal order minimizes the criterion: it is the point where the reduction in fitting error from adding another parameter no longer compensates for the complexity cost. This principle — that the right model uses the fewest parameters that adequately capture the structure — carries directly into every domain of statistical learning, from regression to neural network architecture selection.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Dividing Integers → Unit Rates → Proportions → Percent Concept → Converting Between Fractions, Decimals, and Percents → Operations with Rational Numbers → Two-Step Equations → Solving Multi-Step Equations → Equations with Variables on Both Sides → Angle Pairs: Complementary, Supplementary, and Vertical → Parallel Lines and Transversals → Corresponding Angles → Alternate Interior Angles → Triangle Angle Sum Theorem → Exterior Angle Theorem → Triangle Inequality Theorem → Similar Triangles: AA Similarity → Similar Triangles: SSS and SAS Similarity → Proportions in Similar Triangles → Right Triangle Trigonometry Introduction → Sine, Cosine, and Tangent Ratios → Trigonometric Ratios Review → Radian Measure → Converting Between Degrees and Radians → The Unit Circle → Pythagorean Trigonometric Identities → Fourier Series Representation of Periodic Signals → Fourier Transform: Definition and Properties → Convolution Theorem and Frequency Domain Applications → Convolution in Continuous and Discrete Time → Cross-Correlation Applications and Time Delay Estimation → Autocorrelation Function Properties and Estimation → Parametric Signal Models: AR, MA, and ARMA

Longest path: 85 steps · 365 total prerequisite topics

Prerequisites (1)

Leads To (1)