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

Random Signals, Autocorrelation, and Power Spectral Density

Graduate Depth 81 in the knowledge graph I know this Set as goal
17topics build on this
356prerequisites beneath it
See this on the map →
Parseval's Theorem and Energy/Power Spectral DensitySignal Properties: Periodicity, Energy, and PowerAdaptive Filtering with LMS AlgorithmAdvanced Adaptive Filtering+5 more
random-signals noise stochastic power-spectral-density

Core Idea

Random signals (noise, stochastic processes) are characterized by their autocorrelation R(τ) = E[x(t)x(t+τ)] and power spectral density S(f) = FT{R(τ)}. White noise has flat PSD; colored noise has frequency-dependent power. These tools enable analysis of systems driven by noise and filtering of noisy signals.

Explainer

Deterministic signals can be described exactly by a formula — you know what the signal will be at every future time. Random signals cannot. Thermal noise in a resistor, acoustic vibrations in a room, and radio interference are all unpredictable sample-by-sample, yet they have stable *statistical structure* that repeats on average. The challenge is to characterize that structure without knowing the actual waveform.

The key tool is the autocorrelation function R(τ) = E[x(t)x(t+τ)]. It answers: how similar is the signal to a time-shifted version of itself, on average? When the lag τ = 0, you get the signal's average power: R(0) = E[x²]. As τ increases, a signal with slow fluctuations stays correlated over long lags, while pure noise decorrelates instantly. Intuitively, R(τ) tells you the "memory" of the signal — how long it takes for the signal's current value to stop predicting its future values. From your prerequisite on signal power, you already know that power matters more than instantaneous amplitude for most engineering problems; autocorrelation formalizes this by tracking how power is distributed across time delays.

The power spectral density S(f) brings this into the frequency domain via the Wiener-Khinchin theorem: S(f) = FT{R(τ)}. This is the random-signal analog of the relationship you saw in Parseval's theorem — total power can be computed either in the time domain (integrating R(0)) or in the frequency domain (integrating S(f) across all frequencies). The PSD tells you *where in frequency* the signal's power lives. White noise is the idealized extreme: S(f) = constant across all frequencies, meaning equal power at every frequency. This implies R(τ) = δ(τ) — the signal is completely uncorrelated with itself at any nonzero lag. In practice, white noise is an approximation; real noise is bandlimited and has some residual correlation.

Colored noise has frequency-dependent PSD — more power at some frequencies than others. Pink noise (1/f noise) concentrates power at low frequencies; blue noise concentrates it at high frequencies. When a random signal passes through a linear system (filter), the output PSD is S_out(f) = |H(f)|² · S_in(f), where H(f) is the system's frequency response. This is the stochastic analog of the deterministic convolution you already know. It means you can design a filter to suppress noise in certain frequency bands while preserving signal, and you can predict exactly what the output noise statistics will be — even though you cannot predict the actual output waveform. This connection between frequency-domain tools and statistical characterization is what makes PSD analysis so powerful in signal processing, communications, and control systems.

Practice Questions 5 questions

Prerequisite Chain

Understanding ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersDividing IntegersUnit RatesProportionsPercent ConceptConverting Between Fractions, Decimals, and PercentsOperations with Rational NumbersTwo-Step EquationsSolving Multi-Step EquationsEquations with Variables on Both SidesAngle Pairs: Complementary, Supplementary, and VerticalParallel Lines and TransversalsCorresponding AnglesAlternate Interior AnglesTriangle Angle Sum TheoremExterior Angle TheoremTriangle Inequality TheoremSimilar Triangles: AA SimilaritySimilar Triangles: SSS and SAS SimilarityProportions in Similar TrianglesRight Triangle Trigonometry IntroductionSine, Cosine, and Tangent RatiosTrigonometric Ratios ReviewRadian MeasureConverting Between Degrees and RadiansThe Unit CirclePythagorean Trigonometric IdentitiesFourier Series Representation of Periodic SignalsFourier Transform: Definition and PropertiesParseval's Theorem and Energy/Power Spectral DensityRandom Signals, Autocorrelation, and Power Spectral Density

Longest path: 82 steps · 356 total prerequisite topics

Prerequisites (2)

Leads To (7)