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

MATLAB Code for Constellation Diagram of QAM configurations such as 4, 8, 16, 32, 64, 128, and 256-QAM

📘 Overview of QAM 🧮 4-QAM MATLAB 🧮 16-QAM MATLAB 🚀 Online Simulator 📂 Other Topics on Constellation Diagrams... ▼ 🧮 MATLAB Code for 4-QAM 🧮 MATLAB Code for 16-QAM 🧮 MATLAB Code for m-ary QAM 🧮 Simulator for m-ary PSK 🧮 Simulator for m-ary QAM 🧮 Overview of Energy per Bit (Eb / N0) 🧮 Simulator for ASK, FSK, and PSK Overview of QAM One of the best-performing modulation techniques is QAM [↗] . Here, we modulate the symbols by varying the carrier signal's amplitude and phase in response to the variation in the message signal (or voltage variation). So, we may say that QAM is a combination of phase and amplitude modulation. Additionally, it performs better than ASK or PSK [↗] . In fact, any constellation for any type of modulatio...

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 2026 - Question Paper Download PDF June 202...

GMSK BER vs SNR (with Simulation)

  GMSK Performance: Why the BER vs. SNR Curve Matters If you’ve ever wondered why GMSK (Gaussian Minimum Shift Keying) became the backbone of the global GSM revolution, the answer lies in its unique balance of spectral efficiency and power performance. But there is no free lunch in engineering. To get that sleek, narrow spectrum, you have to pay a price in Bit Error Rate (BER) . In this guide, we break down the theoretical BER vs. SNR performance of GMSK, the "magic" of the BT product, and how to optimize your link budget for real-world conditions. What is GMSK and Why Should You Care? GMSK is a derivative of MSK (Minimum Shift Keying) that uses a Gaussian pre-modulation filter. This filter "smooths" the phase transitions, significantly reducing sideband power. The result? A constant envelope signal that allows you to use high-efficiency Class-C amplifiers without distorting the signal. This is the secr...

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 Flat Fading and Frequency-Selective Fading Effects of Multipath Components and the Nakagami-m Parameter 1. Flat Fading Flat fading occurs when the signal bandwidth is smaller than the channel's coherence bandwidth, meaning that all frequency components of the transmitted signal experience approximately the same fading. It is typically associated with narrowband signals, where the multipath delay spread is small relative to the symbol duration. ...

Quantization Signal to Noise Ratio (Q-SNR)

What is Quantization? Quantization: Quantization in Digital Signal Processing (DSP) is the process of mapping a large set of input values to a smaller set. It’s essential for converting analog signals into digital form. × Quantization Explanation For a signal varies from -8 V to +8 V, giving a total quantization range of 16 V. If the number of quantization levels is 4, the step size will be: \[ v_{\min} = -8, \quad v_{\max} = 8, \quad L = 4 \] Quantization step size: \[ \Delta = \frac{v_{\max} - v_{\min}}{L} = \frac{8 - (-8)}{4} = \frac{16}{4} = 4 \] Partition boundaries (decision levels): \[ p_0 = -8, \quad p_1 = -8 + 4 = -4, \quad p_2 = 0, \quad p_3 = 4, \quad p_4 = 8 \] Quantization codebook (reconstruction levels): \[ c_i = v_{\min} + \left(i + \frac{1}{2}\right) \Delta, \quad i = 0, 1, 2, 3 \] Calculate each codeword: \[ c_0 = -8 + \left(0 + \frac{...

Orthogonal Time Frequency Space (OTFS) (with MATLAB)

In OTFS (Orthogonal Time Frequency Space) modulation — a scheme designed for high-Doppler and time-varying wireless channels — the terms ISFFT and SFFT are key mathematical transformations used to move between different representation domains. Figure: OTFS block diagram 1. ISFFT — Inverse Symplectic Finite Fourier Transform Purpose: Transforms data symbols from the delay-Doppler domain to the time-frequency domain . \[ X[n, m] = \frac{1}{\sqrt{NM}} \sum_{k=0}^{N-1} \sum_{l=0}^{M-1} x[k, l] \, e^{j2\pi \left( \frac{nk}{N} - \frac{ml}{M} \right)} \] Here, \( N \) is the number of Doppler bins (time slots), and \( M \) is the number of delay bins (subcarriers). The ISFFT maps each data symbol from the delay-Doppler grid (where the channel is sparse and easier to equalize) to the time-frequency grid (where standard multicarrier modulation like OFDM can be applied). 2. SFFT — Symplectic Finite Fourier Transform Purpose: Performs the reverse operation ...

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