Skip to main content

Kalman Filter: Mathematical Description and Example


Kalman Filter: Mathematical Description

1. System Model (State-Space Representation)

State Equation

\[
\mathbf{x}_{k} = \mathbf{F}_{k-1}\mathbf{x}_{k-1} + \mathbf{B}_{k-1}\mathbf{u}_{k-1} + \mathbf{w}_{k-1}
\]

Measurement Equation

\[
\mathbf{z}_{k} = \mathbf{H}_{k}\mathbf{x}_{k} + \mathbf{v}_{k}
\]

where:

  • \(\mathbf{x}_k\): system state vector
  • \(\mathbf{u}_k\): control input
  • \(\mathbf{z}_k\): measurement vector
  • \(\mathbf{F}_k\): state transition matrix
  • \(\mathbf{B}_k\): control input matrix
  • \(\mathbf{H}_k\): observation matrix
  • \(\mathbf{w}_k \sim \mathcal{N}(0,\mathbf{Q}_k)\): process noise
  • \(\mathbf{v}_k \sim \mathcal{N}(0,\mathbf{R}_k)\): measurement noise

2. Kalman Filter Assumptions

  • Linear system dynamics
  • Gaussian, white, zero-mean noise
  • Gaussian initial state
\[
\mathbf{x}_0 \sim \mathcal{N}(\hat{\mathbf{x}}_0, \mathbf{P}_0)
\]

3. Kalman Filter Algorithm

The Kalman filter consists of two recursive steps: Prediction and Update.

4. Prediction (Time Update)

State Prediction

\[
\hat{\mathbf{x}}_{k|k-1} =
\mathbf{F}_{k-1}\hat{\mathbf{x}}_{k-1|k-1} +
\mathbf{B}_{k-1}\mathbf{u}_{k-1}
\]

Error Covariance Prediction

\[
\mathbf{P}_{k|k-1} =
\mathbf{F}_{k-1}\mathbf{P}_{k-1|k-1}\mathbf{F}_{k-1}^T +
\mathbf{Q}_{k-1}
\]

5. Update (Measurement Correction)

Innovation (Residual)

\[
\mathbf{y}_k = \mathbf{z}_k - \mathbf{H}_k\hat{\mathbf{x}}_{k|k-1}
\]

Innovation Covariance

\[
\mathbf{S}_k =
\mathbf{H}_k\mathbf{P}_{k|k-1}\mathbf{H}_k^T +
\mathbf{R}_k
\]

Kalman Gain

\[
\mathbf{K}_k =
\mathbf{P}_{k|k-1}\mathbf{H}_k^T
\mathbf{S}_k^{-1}
\]

6. State Update

\[
\hat{\mathbf{x}}_{k|k} =
\hat{\mathbf{x}}_{k|k-1} +
\mathbf{K}_k \mathbf{y}_k
\]

7. Covariance Update

\[
\mathbf{P}_{k|k} =
(\mathbf{I} - \mathbf{K}_k\mathbf{H}_k)
\mathbf{P}_{k|k-1}
\]

Joseph stabilized form:

\[
\mathbf{P}_{k|k} =
(\mathbf{I}-\mathbf{K}_k\mathbf{H}_k)\mathbf{P}_{k|k-1}
(\mathbf{I}-\mathbf{K}_k\mathbf{H}_k)^T
+ \mathbf{K}_k\mathbf{R}_k\mathbf{K}_k^T
\]

8. Optimality Property

\[
\hat{\mathbf{x}}_k =
\mathbb{E}[\mathbf{x}_k \mid \mathbf{z}_{1:k}]
\]

The Kalman filter minimizes the mean square error:

\[
\mathbb{E}\left[
(\mathbf{x}_k - \hat{\mathbf{x}}_k)
(\mathbf{x}_k - \hat{\mathbf{x}}_k)^T
\right]
\]

9. Extensions

  • Extended Kalman Filter (EKF)
  • Unscented Kalman Filter (UKF)
  • Ensemble Kalman Filter (EnKF)

Kalman Filter: Simple Numerical Example for Wireless Communication

1. Problem Setup (Wireless Channel Estimation)

We consider a slowly varying wireless channel gain \(h_k\) tracked at the receiver using noisy pilot measurements.

State (Channel) Model

\[
h_k = h_{k-1} + w_k
\]

Measurement Model

\[
y_k = h_k + v_k
\]

where \(w_k \sim \mathcal{N}(0,Q)\) represents channel variation and \(v_k \sim \mathcal{N}(0,R)\) represents receiver noise.

2. Numerical Data (Arrays)

True Channel (Unknown)

h_true = [1.0, 1.1, 0.9, 1.05, 1.0]

Noisy Pilot Measurements

y = [0.95, 1.20, 0.85, 1.10, 0.98]

Noise Statistics

Q = 0.01   (process noise variance)
R = 0.04   (measurement noise variance)

Initial Conditions

ĥ0 = 0.8
P0 = 0.1

3. Kalman Filter Equations (1D Case)

Prediction

\[
\hat{h}_{k|k-1} = \hat{h}_{k-1}
\]
\[
P_{k|k-1} = P_{k-1} + Q
\]

Update

\[
K_k = \frac{P_{k|k-1}}{P_{k|k-1} + R}
\]
\[
\hat{h}_k = \hat{h}_{k|k-1} + K_k (y_k - \hat{h}_{k|k-1})
\]
\[
P_k = (1 - K_k) P_{k|k-1}
\]

4. Step-by-Step Numerical Computation

Iteration 1

Prediction:
ĥ⁻ = 0.8
P⁻ = 0.11

Kalman Gain:
K = 0.11 / (0.11 + 0.04) = 0.733

Update:
ĥ1 = 0.8 + 0.733 × (0.95 − 0.8) = 0.91
P1 = 0.029

Iteration 2

ĥ⁻ = 0.91
P⁻ = 0.039
K  = 0.494

ĥ2 = 1.05
P2 = 0.020

Iteration 3

ĥ⁻ = 1.05
P⁻ = 0.030
K  = 0.43

ĥ3 = 0.96
P3 = 0.017

Iteration 4

ĥ⁻ = 0.96
P⁻ = 0.027
K  = 0.40

ĥ4 = 1.02
P4 = 0.016

Iteration 5

ĥ⁻ = 1.02
P⁻ = 0.026
K  = 0.39

ĥ5 = 1.00
P5 = 0.016

5. Final Results

True channel:      [1.00, 1.10, 0.90, 1.05, 1.00]
Measured (noisy): [0.95, 1.20, 0.85, 1.10, 0.98]
Kalman estimate:  [0.91, 1.05, 0.96, 1.02, 1.00]

The Kalman filter smooths measurement noise and accurately tracks the time-varying wireless channel.

6. Relevance to Wireless Communication

  • Channel estimation using pilot symbols
  • Doppler and mobility tracking
  • SNR and RSSI estimation
  • Adaptive modulation and coding
Kalman Filter Channel Estimation Plot
Kalman Filter for Wireless Channel Estimation


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