Inferensys

Glossary

Cyclic Correntropy

A non-linear similarity measure that extends correntropy to cyclostationary signals, providing robustness against impulsive noise in cyclic feature extraction.
Data engineer managing feature store on laptop, feature definitions visible, casual data engineering session.
NONLINEAR SIGNAL PROCESSING

What is Cyclic Correntropy?

A robust, kernel-based similarity measure that extends the concept of correntropy to cyclostationary signals, quantifying the generalized correlation in both the time and cyclic frequency domains.

Cyclic correntropy is a non-linear similarity function that maps a cyclostationary signal into a reproducing kernel Hilbert space to measure its generalized correlation across time and cyclic frequency lags. It is formally defined as the expectation of a kernel function applied to the difference between a signal and its frequency-shifted, time-delayed version, parameterized by both a time delay and a cyclic frequency.

Unlike the linear cyclic autocorrelation function, cyclic correntropy captures higher-order statistical information and is inherently robust to impulsive noise and outliers. This property makes it a powerful tool for extracting stable cyclic feature vectors in harsh electromagnetic environments where Gaussian noise assumptions fail, directly improving the resilience of automatic modulation classification systems.

NONLINEAR SIMILARITY MEASURE

Key Properties of Cyclic Correntropy

Cyclic correntropy extends the concept of correntropy to cyclostationary signals, providing a robust, kernel-based similarity measure that exploits periodic statistical structures while suppressing the influence of impulsive noise and outliers.

01

Nonlinear Kernel Mapping

Cyclic correntropy maps signal samples into a high-dimensional Reproducing Kernel Hilbert Space (RKHS) via a positive-definite kernel function, typically a Gaussian kernel. This nonlinear transformation enables the capture of higher-order statistical relationships that linear correlation methods miss. The kernel bandwidth parameter controls the sensitivity to outliers, with smaller bandwidths providing greater robustness against impulsive noise.

  • Defined as the expectation of the kernelized product between time-shifted and frequency-shifted signal versions
  • Gaussian kernel: κ(x,y) = exp(-|x-y|²/(2σ²))
  • Kernel bandwidth σ acts as a tunable robustness parameter
02

Cyclic Frequency Selectivity

Unlike conventional correntropy, cyclic correntropy is parameterized by a cyclic frequency α, allowing it to isolate and measure similarity at specific periodicities inherent in modulated signals. This selectivity makes it a powerful tool for blind modulation classification, as different modulation schemes exhibit unique cyclic correntropy signatures at distinct cycle frequencies.

  • Extracted at discrete α values corresponding to symbol rate, carrier frequency offsets, and their harmonics
  • Zero cyclic frequency reduces to standard correntropy
  • Enables separation of overlapping signals with different cyclic frequencies
03

Impulsive Noise Robustness

A defining advantage of cyclic correntropy is its inherent robustness to heavy-tailed, non-Gaussian noise environments such as atmospheric impulsive noise, man-made electromagnetic interference, and co-channel interference. The Gaussian kernel effectively saturates on large-amplitude outliers, bounding their influence on the similarity measure.

  • Outperforms cyclic correlation and cyclic cumulants in α-stable noise and Middleton Class A interference
  • Kernel bandwidth controls the outlier rejection threshold
  • Maintains reliable cyclic feature extraction at low signal-to-noise ratios where second-order methods fail
04

Cyclic Correntropy Spectrum

The Cyclic Correntropy Spectrum (CCES) is the frequency-domain representation obtained by taking the Fourier transform of the cyclic correntropy function with respect to the time lag τ. It reveals the density of spectral correlation in the kernel space, producing a two-dimensional map of spectral frequency f versus cyclic frequency α.

  • Analogous to the Spectral Correlation Function but computed in the kernel space
  • Provides enhanced resolution of cyclostationary features in impulsive noise
  • Can be estimated efficiently using kernelized versions of the FAM or SSCA algorithms
05

Modulation Signature Extraction

Each digital modulation format produces a distinct pattern of peaks in the cyclic correntropy domain, forming a unique cyclic signature. These signatures are more discriminative than those from linear cyclostationary methods because they capture both the periodic structure and the amplitude distribution of the signal constellation.

  • QPSK exhibits strong cyclic correntropy at α = 2fc and α = 2fc ± Rsym
  • 16-QAM shows additional features at sub-harmonics due to multi-level amplitude variations
  • GMSK and CPM signals produce continuous cyclic features rather than discrete peaks
  • Feature vectors extracted from CCES serve as robust inputs to neural network classifiers
06

Kernelized Cyclic Matched Filter

Cyclic correntropy enables the design of a kernelized cyclic matched filter for optimal detection of cyclostationary signals in impulsive noise. This nonlinear detector correlates the received signal with a frequency-shifted reference in the RKHS, maximizing the signal-to-noise ratio when noise follows a heavy-tailed distribution.

  • Generalizes the classical cyclic matched filter to non-Gaussian environments
  • Implemented implicitly via the kernel trick without explicit RKHS computation
  • Particularly effective for spread spectrum signal detection and RF fingerprinting in tactical environments
SIMILARITY MEASURE COMPARISON

Cyclic Correntropy vs. Cyclic Autocorrelation

A technical comparison of the non-linear cyclic correntropy function against the classical second-order cyclic autocorrelation function for cyclostationary feature extraction.

FeatureCyclic CorrentropyCyclic Autocorrelation

Mathematical Definition

Generalized similarity measure in reproducing kernel Hilbert space parameterized by cyclic frequency

Second-order moment of a signal with a frequency-shifted version of itself

Statistical Order

Infinite-order (captures all even-order moments via Gaussian kernel)

Second-order

Noise Robustness

Robust to impulsive and heavy-tailed non-Gaussian noise

Optimal only under additive white Gaussian noise

Nonlinear Signal Handling

Computational Complexity

Higher (requires kernel evaluation and iterative optimization)

Lower (FFT-based estimation)

Kernel Parameter Dependency

Yes (kernel size sigma controls outlier suppression)

Output Domain

Correntropy spectral density in cyclic domain

Cyclic autocorrelation magnitude and phase

Sensitivity to Alpha Profile

Enhanced (non-linear mapping amplifies weak cyclic features)

Standard (linear correlation of frequency-shifted components)

CYCLIC CORRENTROPY

Frequently Asked Questions

Explore the core concepts behind cyclic correntropy, a robust non-linear similarity measure designed to extract stable cyclostationary features from signals corrupted by impulsive noise and outliers.

Cyclic correntropy is a non-linear similarity measure that extends the concept of correntropy to cyclostationary signals. It works by mapping the signal into a high-dimensional reproducing kernel Hilbert space (RKHS) and measuring the generalized correlation between frequency-shifted versions of the signal. Unlike traditional correlation, which is a second-order statistic sensitive to outliers, cyclic correntropy uses a Gaussian kernel function to suppress the influence of large amplitude deviations. This provides a robust estimate of the signal's cyclic statistics, effectively quantifying the periodicity of its statistical properties at specific cyclic frequencies even in the presence of heavy-tailed, impulsive noise environments where standard spectral correlation methods fail.

Prasad Kumkar

About the author

Prasad Kumkar

CEO & MD, Inference Systems

Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.

His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.