Skip to main content

Matched Filter Explained


Matched Filter: Theory and MATLAB Example

A matched filter is a linear filter designed to maximize the signal-to-noise ratio (SNR) for detecting a known signal in the presence of additive noise. It is widely used in communications, radar, and sonar.

1. Definition

If the known signal is s(t) with duration T, the impulse response of the matched filter is:

h(t) = s*(T - t)

In discrete time, for a signal s[n] of length N:

h[n] = s*[N-1-n]

2. Example: Rectangular Pulse

Consider a simple rectangular pulse:

s(t) = {

  1, 0 ≤ t ≤ 2

  0, elsewhere

}

Matched filter:

h(t) = s(2 - t)
s(t):      ┌───────┐
           |       |
───────────┘       └────────
           0       2

h(t):              ┌───────┐
                   |       |
───────────--------        |
          0        2

3. MATLAB Simulation Example

We can implement a simple matched filter in MATLAB using a rectangular pulse:

% MATLAB Code: Matched Filter Example

% Parameters
T = 2;           
Fs = 100;        
t = 0:1/Fs:T-1/Fs;  

s = ones(1,length(t));

noise = 0.5*randn(size(s)); 
r = s + noise;

h = fliplr(s);

y = conv(r,h);

t_y = 0:1/Fs:(length(y)-1)/Fs;

figure;

subplot(3,1,1);
plot(t,s,'LineWidth',2);
title('Transmitted Signal s(t)');
xlabel('Time (s)');
ylabel('Amplitude');

subplot(3,1,2);
plot(t,r,'LineWidth',1.5);
title('Received Signal r(t) = s(t) + Noise');
xlabel('Time (s)');
ylabel('Amplitude');

subplot(3,1,3);
plot(t_y,y,'LineWidth',2);
title('Matched Filter Output y(t)');
xlabel('Time (s)');
ylabel('Amplitude');

Explanation:

  • s is the known transmitted pulse.
  • r is the received signal corrupted by Gaussian noise.
  • h is the matched filter (time-reversed pulse).
  • y is the convolution output showing a peak at the point of maximum alignment, which corresponds to the detection instant.
The peak of y(t) corresponds to the maximum correlation between the received signal and the known pulse, demonstrating the matched filter's ability to detect the signal in noise.

Peak Location of the Matched Filter Output

The peak of the matched filter output does not necessarily occur at the midpoint of the pulse. It occurs at the end of the pulse duration (t = T), which is the point where the entire pulse has “slid” across the filter.

1. Why the peak is at t = T

Matched filter:

h(t) = s(T - t)

Output:

y(t) = ∫₀แต€ r(ฯ„) · h(t - ฯ„) dฯ„
  • At t = 0 → small overlap → small output
  • As t increases → overlap increases → output grows
  • At t = T → full alignment → maximum output

2. Example with numbers

Pulse s[n] = [1, 2, 3], duration T = 3 samples
Matched filter h[n] = [3, 2, 1]

Convolution output y[n] = s[n] * h[n] = [3, 8, 14, 8, 3]

  • n = 0 → small
  • n = 1 → larger
  • n = 2 → peak
  • n > 2 → output decreases

Peak occurs where the full pulse aligns with the filter, not at the midpoint.

4. Summary

Matched filters leverage the known structure of a signal to produce a maximum output at the detection instant, allowing reliable detection even in the presence of noise. The impulse response is always the time-reversed and conjugated version of the transmitted signal. MATLAB simulation confirms that the filter output peaks exactly when the received pulse is aligned with the filter.


Try Interactive Online Simulators



Contact Us

Name

Email *

Message *

Popular Posts

LDPC Encoding and Decoding Techniques

Low Density Parity Check (LDPC) Guide Comprehensive analysis of linear error-correcting block codes, Tanner graphs, and 5G-NR implementations. ๐Ÿ“˜ Overview ๐Ÿงฎ Encoding ๐Ÿงฉ Decoding ๐Ÿ“š Resources Theory Encoding Tech Tanner Graph 5G Encoding Decoding 'LDPC' is the abbreviation for 'low density parity check'. LDPC code H matrix contains very few amount of 1's and mostly zeroes. LDPC codes are error correcting code. Using LDPC codes, channel capacities that are close to the theoretical Shannon limit can be achieved. Low density parity check (LDPC) codes are linear error-correcting block code suitable for error correction in a large block sizes transmi...

Flat vs Frequency Selective Online Simulator

Flat vs Frequency Selective Online Simulator Channel Type Without Fading Flat Fading Multipaths Nakagami m SNR(dB) Run Simulation Input Signal Signal After Fading Constellation Diagram BER vs SNR Explore Advanced Flat vs Frequency-Selective Fading Simulator Want to see these equations in action? Visualize it. Launch Simulator Tool Interactive Rayleigh Fading Simulator Want to see Rayleigh fading in action? Visualize it. Launch Simulator Tool Return to DSP Simulations Main Page →

Online Simulator for ASK, FSK, and PSK Signal Generation

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 Demodulation More Topics 1. ASK (Ampli...

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

Gaussian minimum shift keying (GMSK)

๐Ÿ“˜ Overview & Theory ๐Ÿงฎ Simulator for GMSK ๐Ÿงฎ MSK and GMSK: Understanding the Relationship ๐Ÿงฎ MATLAB Code for GMSK ๐Ÿ“š Simulation Results for GMSK ๐Ÿ“š Q & A and Summary ๐Ÿ“š Further Reading Dive into the fascinating world of GMSK modulation, where continuous phase modulation and spectral efficiency come together for robust communication systems! Core Process of GMSK Modulation Phase Accumulation (Integration of Filtered Signal) After applying Gaussian filtering to the Non-Return-to-Zero (NRZ) signal, we integrate the smoothed signal to produce a continuous phase signal. For GMSK, the modulation index is $h=0.5$, meaning a bit '1' results in a phase shift of $\pi/2$: ฮธ(t) = 2ฯ€h ∫ 0 t m filtered (ฯ„) dฯ„ This integration is crucial for avoiding abrupt phase transitions, ensuring smooth and continuous phase changes. Phase Mo...

UGC NET Electronic Science Previous Year Question Papers with Solutions

Download Papers and Solutions Exam Pattern Preparation Tips FAQs More Home / Engineering & Other Exams / UGC NET 2026 PYQ ๐Ÿ“Š Exam Highlights: Electronic Science (88) Feature Details Junior Research Fellowship (JRF) ₹37,000 + HRA per month Eligibility M.Sc/M.Tech in Electronics (55%) Validity of Certificate JRF (3 Years) | Lectureship (Lifetime) ๐Ÿ“ฅ Download UGC NET Electronics PDFs Complete collection of previous year question papers, answer keys and explanations for Subject Code 88. Start Downloading ๐Ÿ“‚ View All Question Papers June 2025 - Question Paper Download PDF June 2025 - Sol...

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 The Role of the Q-function in BER vs. SNR The Q-function is the standard tool for calculating BER in systems like BPSK or QPSK over AWGN (Additive White Gaussian Noise) channels. For BPSK: In BPSK, we transmit +√E b (bit 1) and -√E b (bit 0). The decision boundary is set at 0 . If -√E b was sent, an error occurs if noise r > √...