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

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

FFT Butterfly Method Explained (with Simulations)

4-Point FFT Using Butterfly Method Given: x[n] = {0, 1, 2, 3} Step 1: Split into Even & Odd Even indices: x e = {x[0], x[2]} = {0, 2} Odd indices: x o = {x[1], x[3]} = {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 4 k O[k] X[k + 2] = E[k] - W 4 k O[k] Twiddle Factors (N=4): W 4 0 = 1, W 4 1 = -j Final Calculations: X[0] = E[0] + W 4 0 O[0] = 2 + (1)(4) = 6 X[2] = E[0] - W 4 0 O[0] = 2 - (1)(4) = -2 X[1] = E[1] + W 4 1 O[1] = -2 + (-j)(-2) = -2 + 2j X[3] = E[1] - W 4 1 O[1] = -2 - (-j)(-2) = -2 - 2j Final Answer: X[k] = {6, -2 + 2j, -2, -2 - 2j} 8-Point FFT Using Butterfly Method Given: x[n] = {0,1,2,3,4,5,6,7} Step 1: Split into Bit-Reversed Order To perform DIT-FFT, split the 8 points into pairs of two: Group A: {x[0], x[4]} = {0, 4}...

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

Pulse Amplitude Modulation and Demodulation

📘 Overview & Theory of Pulse Amplitude Moduation (PAM) 🧮 Pulse Amplitude Demoduation 🧮 MATLAB Code for PAM 📚 Further Reading 📂 Other Topics on Pulse Amplitude Modulation ... 🧮 Simulation results for comparison of PAM, PWM, PPM, DM, and PCM 🧮 Other Pulse Modulation Techniques (e.g., PWM, PPM, DM, and PCM) 🧮 MATLAB Code for Pulse Amplitude Modulation and Demodulation of an Analog Signal (2) 🧮 MATLAB Code for Pulse Amplitude Modulation and Demodulation of Digital data  Pulse Amplitude Modulation (PAM) Sampling allow us to represent real world continuous signal, such as audio or video, in a format suitable for digital processing and storage. This sampled discrete-time signal is inherently digital. A digital signal is a discrete-time signal that is further quantized in amplitude. Pulse Amplitude modulation (PAM) is the modulation technique in which amplitude of carrier pulses is...

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

Channel Impulse Response (CIR) (with MATLAB + Simulator)

📘 Overview & Theory 📘 How CIR Affects the Signal 🧮 Online Channel Impulse Response Simulator 🧮 MATLAB Codes 📚 Further Reading What is the Channel Impulse Response (CIR)? The Channel Impulse Response (CIR) is a concept primarily used in the field of telecommunications and signal processing. It provides information about how a communication channel responds to an impulse signal. It describes the behavior of a communication channel in response to an impulse signal. In signal processing, an impulse signal has zero amplitude at all other times and amplitude ∞ at time 0 for the signal. Using a Dirac Delta function, we can approximate this. Fig: Dirac Delta Function The result of this calculation is that all frequencies are responded to equally by δ(t) . This is crucial since we never know which frequenci...

MATLAB Code for BER performance of QPSK with BPSK, 4-QAM, 16-QAM, 64-QAM, 256-QAM, etc

📘 Overview 🧮 MATLAB Codes 🧮 Online Simulator for Calculating BER of M-ary PSK and QAM 🧮 QPSK vs BPSK and QAM: A Comparison of Modulation Schemes in Wireless Communication 🧮 Are QPSK and 4-PSK same? 📚 Further Reading   QPSK offers double the data rate of BPSK while maintaining a similar bit error rate at low SNR when Gray coding is used. It shares spectral efficiency with 4-QAM and can outperform 4-QAM or 16-QAM in very noisy channels. QPSK is widely used in practical wireless systems, often alongside QAM in adaptive modulation schemes [Read more...] What is the Gray Code? Gray Code: Gray code is a binary numeral system where two successive values differ in only one bit. This property is called the single-bit difference or unit distance code. It is also known as reflected binary code. Let's convert binary 111 to Gray code: Binary bits: B = 1 1 1 Apply the rule: G[0] = B[0] = 1...

MATLAB Code for QPSK Modulation and Demodulation

📘 Overview 🧮 MATLAB Codes 🧮 Theory 🧮 BER performance of QPSK with BPSK, 4-QAM, 16-QAM, 64-QAM, 256-QAM, etc 📚 Further Reading QPSK Passband Signal Generation Spectral Efficiency in QPSK   Quadrature Phase Shift Keying (QPSK) is a digital modulation scheme that conveys two bits per symbol by changing the phase of the carrier signal. Each pair of bits is mapped to one of four possible phase shifts: 0°, 90°, 180°, or 270° 00  ===> 0 degree phase shift of carrier signal 01  ===> 90 degree 11  ===> 180 degree 10  ===> 270 degree   MATLAB Script clc; clear all; close all; clc; M = 4; data = randi([0 (M-1)], 1000, 1); Phase = 0; modData=pskmod(data,M,Phase); figure(1); scatterplot(modData); channelAWGN = 15; rxData2 = awgn(modData, channelAWGN); figure(2); scatterplot(rxData2); demodData = pskdemod(rxData2,M,Phase);   Result data 1 0 2 2 0 2 1 . . . modData -1.0...