Skip to main content

Correlogram in MATLAB

 

Steps to compute correlogram of an input signal

1. Compute the autocorrelation function of narrowband_signal

2. Computes the Fast Fourier Transform (FFT) of the autocorrelation function (acf), resulting in corr_spectrum.

3. freq = (0:N-1)*(fs/N); Constructs a frequency vector (freq) corresponding to the FFT results, spanning from 0 Hz to just under the Nyquist frequency (fs/2). Where, N = Number of Samples in the Input Signal

4. Plots the magnitude of the FFT (abs(corr_spectrum)) against the frequency vector (freq), showing the correlogram of the narrowband signal.

 


Output 





Copy the MATLAB Code from here



Try Interactive Online Simulator

We have developed a web-based simulator for the Correlogram, Bartlett, and other spectral estimation methods to make these techniques easier to understand and help users learn complex signal processing concepts through interactive simulations.

Try our simulators: Periodogram, Correlogram, Bartlett, Blackman–Tukey, and Welch methods.


Other Spectral Estimation Techniques

The Windowed Periodogram Approach

To estimate the Power Spectral Density (PSD) of discrete signals, researchers often turn to the windowed periodogram. By applying a specific window function to the raw data, this method minimizes "spectral leakage," a common error where energy from one frequency spills into adjacent ones. This step is vital for high-fidelity frequency analysis.

Standard Periodogram Foundations

The traditional periodogram is a direct estimation technique derived from the Discrete-Time Fourier Transform (DTFT):

Px(f) = (1/N) | ∑n=0N-1 x[n] e-j 2 Ï€ f n |2

In this formula:

  • x[n]: The sampled input signal.
  • N: The total count of samples.

Because it involves an abrupt cutoff of the signal, the standard periodogram is prone to significant spectral leakage.

Using Windowing to Enhance Accuracy

By multiplying the signal by a window function w[n] before transforming it, we can smooth out the edges:

Px(f) = (1 / (N · U)) | ∑n=0N-1 x[n] w[n] e-j 2 Ï€ f n |2

Definitions:

  • w[n]: The selected window weights.
  • U = (1/N) ∑n=0N-1 |w[n]|2: A constant used to normalize the signal's power.

Standard Window Variations

  • Rectangular: Basic truncation without smoothing. All values are 1 for 0 ≤ n ≤ N-1.
  • Hamming: Designed to lower the peaks of sidelobes using: 0.54 - 0.46 cos(2 Ï€ n / (N-1)).
  • Hann: Provides a gentle fade-in and fade-out at the signal boundaries: 0.5 [1 - cos(2 Ï€ n / (N-1))].
  • Blackman: Offers even lower sidelobes by adding a second cosine term, though it widens the main spectral peak.

Methodology

  1. Divide the data into blocks of length N.
  2. Multiply each block by the chosen window function.
  3. Run an FFT or DTFT on these windowed segments.
  4. Average the results to stabilize the estimate.

The Correlogram Technique

This method calculates the PSD by taking the Fourier transform of the signal’s estimated autocorrelation sequence.

Px(f) = ∑k=-(N-1)N-1 Rx[k] e-j 2 Ï€ f k

Here, Rx[k] represents the autocorrelation at lag k. To ensure the PSD never drops below zero, a biased estimate is typically used (dividing by N). While an unbiased estimate (dividing by N-k) exists, it can sometimes produce mathematically impossible negative PSD values.

Bartlett’s Method

Bartlett’s technique aims to reduce the "noise" (variance) of the periodogram by splitting the signal into M distinct, non-overlapping parts and averaging their individual periodograms.

Px(f) = (1 / (M · N)) ∑m=0M-1 | ∑n=0N-1 xm[n] e-j 2 Ï€ f n |2

Pros: It reduces variance by a factor of M.
Cons: It reduces the detail (resolution) of the frequency map because each segment is shorter than the original signal.

Blackman-Tukey Method

This approach focuses on windowing the autocorrelation function itself rather than the raw signal.

Px(f) = ∑k=-KK Rx[k] w[k] e-j 2 Ï€ f k

By smoothing the autocorrelation sequence with w[k], the resulting PSD is less jagged. This is highly effective in radar, sonar, and speech analysis, though it requires more processing power for long datasets.

Welch’s Method

An evolution of Bartlett’s method, Welch’s technique allows segments to overlap (usually by 50%) and applies a window to each segment before averaging.

Px(f) = (1 / (K · L · U)) ∑k=0K-1 | ∑n=0L-1 xk[n] w[n] e-j 2 Ï€ f n |2

Welch's method is the industry standard for many applications—from analyzing EEG brainwaves to assessing wireless communication spectra—because it offers the best balance between reducing noise and preventing spectral leakage.



Contact Us

Name

Email *

Message *

Popular Posts

MIMO Channel Matrix | Rank and Condition Number

MIMO / Massive MIMO MIMO Channel Matrix | Rank and Condition...   The channel matrix in wireless communication is a matrix that describes the impact of the channel on the transmitted signal. The channel matrix can be used to model the effects of the atmospheric or underwater environment on the signal, such as the absorption, reflection or scattering of the signal by surrounding objects. When addressing multi-antenna communication, the term "channel matrix" is used. Let's assume that only one TX and one RX are in communication and there's no surrounding object. Here, in our case, we can apply the proper threshold condition to a received signal and get the original transmitted signal at the RX side. However, in real-world situations, we see signal path blockage, reflections, etc.,  (NLOS paths [↗]) more frequently. The obstruction is typically caused by building walls, etc. Multi-antenna communication was introduced to address this issue. It makes diversity app...

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

UGC NET Electronic Science Previous Year Question Papers with Solutions

Home / Engineering & Other Exams / UGC NET 2026 PYQ ⬇️ Download Papers and Solutions 📋 Exam Pattern 💡 Preparation Tips ❓ FAQs 📊 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 - Solved Paper + Explanation ...

How to Mount Google Drive in Google Colab

How to Mount Google Drive in Google Colab Google Colab provides temporary storage during a session. Any files stored in the /content directory will be deleted when the runtime disconnects. To store datasets, trained models, and results permanently, it is recommended to mount your Google Drive in Colab. Mounting Google Drive allows your notebook to access files directly from your Drive and save outputs there so they remain available even after the Colab session ends. Step 1: Import the Drive Module First import the Google Colab drive module. from google.colab import drive Step 2: Mount Google Drive Run the following command to mount your Google Drive. from google.colab import drive drive.mount('/content/drive') After running the command: A link will appear in the output. Click the link and log in to your Google account. Copy the authentication code provided. Paste the code back into the notebook. Or, a Google authentication page will a...

MATLAB Code for OTFS (Orthogonal Time Frequency Space)

MATLAB Code for OTFS (Orthogonal Time Frequency Space) %% Clear workspace clc; clear; close all ; %% Step 1: OTFS Parameters N_delay = 4; % Number of delay bins (rows) N_doppler = 4; % Number of Doppler bins (columns) N_sym = N_delay * N_doppler; modOrder = 4; % QPSK SNR_dB = 20; % Noise level %% Step 2: Generate random data symbols data = randi([0 modOrder-1], N_sym, 1); txSymbols = pskmod(data, modOrder, pi/4); disp( 'Transmitted Delay-Doppler symbols:' ); disp(reshape(txSymbols, N_delay, N_doppler)); %% Step 3: Map Delay-Doppler → Time-Frequency (ISFFT) % ISFFT: Inverse Symplectic Finite Fourier Transform % 1. Take IDFT along Doppler (columns) % 2. Take DFT along Delay (rows) ddSymbols = reshape(txSymbols, N_delay, N_doppler); % Step 3a: IDFT along columns (Doppler) tfGrid = ifft(ddSymbols, N_doppler, 2); %IFFT (accross columns) along Doppler → spreads in time (Delay → Time) %FFT (accross rows)along Delay → spreads in frequency (Delay → Frequency) % Step 3b: DFT along ...

Wiener Filter in MATLAB

  MATLAB Code  % Wiener Filter Based on Wiener-Hopf Equation % This script demonstrates how to apply the Wiener filter to recover % a reference signal from a noisy signal using the Wiener-Hopf equation. % The filter minimizes the mean squared error between the noisy signal and the reference signal. clear; close all; clc; % Signal Parameters fs = 4000; % Sampling frequency (Hz) T = 1; % Total recording time (seconds) L = T * fs; % Signal length (samples) tt = (0:L-1) / fs; % Time vector ff = (0:L-1) * fs / L; % Frequency vector % Generate Reference Signal (a sinusoid) y = sin(2 * pi * 120 * tt); % Reference sinusoidal signal y = y(:); % Ensure column vector % Create Noisy Signal by Adding Gaussian Noise x = 0.50 * randn(L, 1) + y; % Noisy signal x = x(:); % Ensure column vector % Define Filter Order (Number of Coefficients) N = 200; % Apply Wiener Filter using custom function [xest, b, MSE] = wienerFilt(x, y, N); % Plot Results figure; subplot(411); plot(tt, x, 'k'), hold on, p...

Overmodulation & Distortion in AM

Overmodulation in AM and How It Causes Distortion 1. AM Signal Equation s(t) = A c [1 + μ m(t)] cos(2Ï€ f c t) A c = carrier amplitude m(t) = normalized modulating signal (|m(t)| ≤ 1) μ = modulation index 2. Modulation Index μ = A m / A c - Normal AM: 0 < μ ≤ 1 → no distortion - Overmodulation: μ > 1 → distortion occurs 3. Envelope and Overmodulation A(t) = A c [1 + μ m(t)] - For undistorted AM: 1 + μ m(t) ≥ 0 at all times - If μ > 1: 1 + μ m(t) < 0 at negative peaks → carrier flips Example: Let m(t) = cos(2Ï€ f m t), A c = 1 V, μ = 1.2 Minimum envelope: A min = A c [1 - 1.2] = -0.2 V Negative amplitude → envelope crosses zero → 180° phase flip 4. Mathematical Consequence -A c cos(θ) = A c cos(θ + Ï€) This phase reversal is what causes distortion in the demodulated signal. 5. Instantaneous AM Signal s...

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 More Topics 1. ASK (Amplitude Shift Keying) Simulat...