Skip to main content

Autocorrelation and Periodicity of a Signal

 

Autocorrelation function

Autocorrelation function: For a signal x(t), the autocorrelation is defined as Rxx(Ī„) = E[x(t)x(t+Ī„)] for a random process, or Rxx(Ī„) = ∫ x(t)x(t+Ī„) dt for an energy signal.

The auto-correlation of a periodic signal preserves the periodicity. For example, we are transmitting a signal x(t) through the wireless medium, and we receive the signal y(t) at the receiver.

y(t) = x(t) + n(t)

where n(t) is the additive white Gaussian noise (AWGN).


You can find that the periodicity of the autocorrelation of y(t) will be the same as the periodicity of x(t).

In other words, we can say that the autocorrelation of the noisy signal is equal to the autocorrelation of the original periodic signal, except at zero lag (Ī„ = 0), where the noise contributes.


To find the spectral density (also known as the power spectral density, or PSD) from the autocorrelation function mathematically, you can use the Wiener–Khinchin theorem. This theorem states that the power spectral density of a wide-sense stationary (WSS) random process is the Fourier transform of its autocorrelation function.

Why WSS is assumed: The WSS assumption ensures that the autocorrelation function depends only on the time difference Ī„ (i.e., Rxx(t₁,t₂) = Rxx(Ī„)) and not on absolute time. This time-invariance is necessary for the Fourier transform to exist in a consistent way and to define a meaningful power spectral density. Without stationarity, the statistical properties of the signal change with time, and a single PSD cannot fully describe the signal.

 

Wiener-Khinchin Theorem

Given a wide-sense stationary process X(t), let RX(Ī„) be its autocorrelation function. The power spectral density SX(f) is given by:

\( S_X(f) = \mathcal{F}\{R_X(\tau)\} = \int_{-\infty}^{\infty} R_X(\tau) e^{-j2\pi f \tau} \, d\tau \)


Where F denotes the Fourier transform, j is the imaginary unit, f is the frequency, and Ī„ is the lag.
Steps to Compute PSD from Autocorrelation Function

Read More: about Wide Sense Stationary

 

Steps to Compute PSD from Autocorrelation Function

Compute the Autocorrelation Function RX(Ī„):
The autocorrelation function RX(Ī„) is defined as:

RX(Ī„)=E[X(t)X(t+Ī„)]

For a discrete-time signal x[n], the autocorrelation function RX[k] can be computed as:

RX[k]=∑(n=−∞,∞) x[n]x[n+k]

Apply the Fourier Transform:

To find the PSD, take the Fourier transform of the autocorrelation function RX(Ī„) (or RX[k] in the discrete case):

For continuous signals:

SX(f)=∫(−∞,∞) RX(Ī„)exp(−j2Ī€fĪ„ dĪ„)

For discrete signals:

SX(exp(jΉ))=∑(k=−∞,∞) RX[k]exp(−jΉk)

 

MATLAB Code to find the periodicity from auto-correlation of a periodic signal

 

Output

 


 

 

 

Another MATLAB Code to find the periodicity from autocorrelation of a noisy periodic signal

 

 

Output

 



Contact Us

Name

Email *

Message *

Popular Posts

Hybrid Beamforming | Page 1

Beamforming Techniques Hybrid Beamforming... Page 1 | Page 2 | Hybrid Beamforming: Hybrid beam formation was developed to address some of the limitations of digital pre-coding approaches. Every antenna element is connected to an RF chain in digital pre-coding (beam forming) method. We also know that each RF chain is in charge of providing a separate data stream between the transmitter and the receiver. We know that a larger number of independent data streams leads to higher data rates. It has a spatial multiplexing feature for MIMO. As a result, we may assume that switching from MIMO to massive MIMO will benefit us more in terms of spatial multiplexing in massive MIMO, where each antenna is coupled to a single RF chain. We'll proceed with a definition of hybrid beam forming. Overview of hybrid beam forming with example: Unlike digital beam forming, more than one antenna element is connected to a single RF chain in hybr...

MATLAB Code for 8-PSK, 16-PSK, ...

📘 Overview & Theory 🧮 MATLAB Code for BPSK, QPSK, 8-PSK, 16-PSK, 32-PSK 🧮 Simulator for m-ary PSK 📚 Further Reading   MATLAB Code for BPSK, QPSK, 8-PSK, 16-PSK, 32-PSK clc; clear all; close all; rng(10) M = 8; % M = 2, 4, 8, 16, 32, etc. N_Bits = 2520; Phase = 0; data_info_bit = randi([0,1],N_Bits,1); data_temp = bi2de(reshape(data_info_bit,N_Bits/log2(M),log2(M))); modData = pskmod(data_temp,M,Phase); figure(1); scatterplot(modData); channelAWGN = 15; rxData2 = awgn(modData, channelAWGN); figure(2); scatterplot(rxData2); demodData = pskdemod(rxData2,M,Phase);   for BPSK, Constellation Size, M = 2 for QPSK, M = 4 for 8-PSK, M = 8, and so on    Output Figure: 8-PSK Modulation Figure: 8-PSK Demodulation after adding AWGN Noise Using the above MATLAB code you'll able be to modulate and demodulate 2-PSK, 4-PSK, 8-PSK, 16-PSK, 32-PSK and so on.  16-PSK   Fig: 16-PSK In this above code ' M ' is the number of the conste...

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 Windowing Affects Your Periodogram

The windowed periodogram is a widely used technique for estimating the Power Spectral Density (PSD) of a signal. It enhances the classical periodogram by mitigating spectral leakage through the application of a windowing function. This technique is essential in signal processing for accurate frequency-domain analysis.   Power Spectral Density (PSD) The PSD characterizes how the power of a signal is distributed across different frequency components. For a discrete-time signal, the PSD is defined as the Fourier Transform of the signal’s autocorrelation function: S x (f) = FT{R x (Ī„)} Here, R x (Ī„)}is the autocorrelation function. FT : Fourier Transform   Classical Periodogram The periodogram is a non-parametric PSD estimation method based on the Discrete Fourier Transform (DFT): P x (f) = \(\frac{1}{N}\) X(f) 2 Here: X(f): DFT of the signal x(n) N: Signal length However, the classical periodogram suffers from spectral leakage due to abrupt truncation of the ...

Advanced M-ary Modulation Simulator: Constellation, min dist, Efficiency, SER, EVM (RMS)

Advanced M-ary Communication Lab Analytical & Statistical Performance of Digital Modulation Theoretical Probability of Error (\(P_s\)) \[ P_s = Q\left(\sqrt{\frac{2 E_b}{N_0}}\right) \] Modulation (M-ary) BPSK (M=2) QPSK (M=4) 8-PSK (M=8) 16-QAM (M=16) 64-QAM (M=64) 256-QAM (M=256) SNR (\(E_b/N_0\)): 12 dB Efficiency 2 bps/Hz Min Dist (\(d_{min}\)) 1.41 Symbol Error 1.2e-5 EVM (RMS) 0.0% Constellation Diagram Noise PDF & Decision Tail 1. Geometric Mapping ...

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} \] ...

Galois Fields: GF(2) and GF(2m) and Primitive Polynomial

Galois Fields: GF(2) and GF(2 m ) 1. What is a Galois Field (GF)? A Galois Field (GF) is a finite set of elements in which the four basic arithmetic operations—addition, subtraction, multiplication, and division (except by zero)— are all well defined and closed. GF(q) ⇒ a field with exactly q elements 2. The Simplest Field: GF(2) GF(2) is the smallest possible finite field and forms the foundation of all digital systems. GF(2) = {0, 1} Addition in GF(2) Addition is performed modulo 2 (XOR operation): + 0 1 0 0 1 1 1 0 Multiplication in GF(2) × 0 1 0 0 0 1 0 1 GF(2) is used in binary logic, XOR operations, and simple error-control codes. 3. Meaning of GF(2 m ) GF(2 m ) is a finite field containing exactly 2 m elements . Each element represents an m-bit symbol . Field Number of Elements GF(2) 2 GF(2²) 4 GF(2³) 8 GF(2⁸) 256 Important: GF(2 m ) is not integer arithmetic modulo 2 m . It is polynomial-based arithmetic. 4....