A Gaussianity test formally evaluates the null hypothesis that observed signal samples originate from a Gaussian distribution. In RF fingerprinting, rejecting this null hypothesis confirms that the signal contains non-Gaussian components—such as those generated by power amplifier non-linearities or mixer imbalances—that carry unique, device-specific information invisible to second-order statistics.
Glossary
Gaussianity Test

What is Gaussianity Test?
A Gaussianity test is a statistical hypothesis test that determines whether a signal's amplitude distribution deviates from a normal (Gaussian) distribution, validating the presence of exploitable non-Gaussian hardware fingerprints for emitter identification.
Common implementations include the Jarque-Bera test, which jointly evaluates skewness and excess kurtosis, and the Shapiro-Wilk test for smaller sample sizes. These tests serve as a critical pre-processing gate: if a signal passes a Gaussianity test, higher-order spectral analysis using the bispectrum or trispectrum is mathematically futile, as cumulants of order greater than two vanish identically for Gaussian processes.
Key Characteristics of Gaussianity Tests
Gaussianity tests are statistical procedures that evaluate the null hypothesis that a signal sample originates from a Gaussian distribution. Rejection of this hypothesis validates the presence of non-Gaussian hardware fingerprints exploitable for emitter identification.
Null Hypothesis Framework
Gaussianity tests operate on a formal null hypothesis (H₀): the data is drawn from a Gaussian distribution. The alternative hypothesis (H₁) asserts non-Gaussianity. A p-value is computed from the test statistic; if it falls below a predetermined significance level (α)—typically 0.05 or 0.01—H₀ is rejected. This rejection provides statistical evidence that exploitable non-Gaussian signal structure exists, validating further higher-order spectral analysis. The framework requires careful consideration of Type I errors (false rejection of Gaussianity) and Type II errors (failure to detect non-Gaussianity).
Moment-Based Tests: Skewness & Kurtosis
These tests evaluate deviations in the third standardized moment (skewness) and fourth standardized moment (kurtosis) from their Gaussian expectations of 0 and 3, respectively.
- Jarque-Bera Test: Combines sample skewness and excess kurtosis into a single chi-squared statistic with 2 degrees of freedom. Particularly powerful for symmetric non-Gaussian alternatives.
- D'Agostino-Pearson Test: An omnibus test that separately transforms skewness and kurtosis to approximate normality, then combines them. Robust for sample sizes as small as n ≥ 20.
- Sample Moments: Raw moment estimates are sensitive to outliers; robust alternatives use L-moments or trimmed estimators for heavy-tailed signal distributions.
Empirical Distribution Function Tests
EDF tests measure the distance between the empirical cumulative distribution function (ECDF) of the sample and the theoretical Gaussian CDF.
- Kolmogorov-Smirnov (KS) Test: Uses the supremum of the absolute difference between ECDF and CDF. Distribution-free under H₀ but less sensitive to tail deviations.
- Anderson-Darling Test: A weighted variant that emphasizes discrepancies in the tails of the distribution, making it more powerful for detecting non-Gaussianity caused by heavy-tailed hardware impairments.
- Cramér-von Mises Criterion: Integrates the squared difference across the entire distribution, providing balanced sensitivity across the support.
Shapiro-Wilk & Regression-Based Tests
The Shapiro-Wilk test is widely regarded as the most powerful omnibus Gaussianity test for moderate sample sizes (n < 2000). It operates by regressing ordered sample values against the expected order statistics of a standard Gaussian distribution.
- W-statistic: The ratio of squared linear combination of order statistics to sample variance. Values near 1 indicate Gaussianity.
- Shapiro-Francia: A simplified approximation for larger samples using only the correlation between ordered data and Gaussian quantiles.
- Filliben's Test: Evaluates the correlation on a probability plot; particularly useful for visual diagnostics alongside formal hypothesis testing.
Higher-Order Cumulant Significance
For RF fingerprinting applications, Gaussianity tests based on higher-order cumulants directly connect to the feature extraction pipeline. Under H₀, all cumulants of order k ≥ 3 are identically zero.
- Bispectral Flatness Test: Evaluates whether the sample bispectrum is consistent with zero across all bifrequency pairs, using a chi-squared statistic derived from bicoherence estimates.
- Hinich's Linearity Test: A frequency-domain test that checks for non-zero bispectral values, simultaneously testing Gaussianity and linearity of the generating process.
- Cumulant Variance Bounds: Asymptotic variance expressions for sample cumulants enable construction of confidence intervals; observed cumulants exceeding these bounds reject Gaussianity.
Practical Considerations for Signal Analysis
Real-world signal analysis introduces challenges that affect test selection and interpretation.
- Sample Size Sensitivity: KS and Shapiro-Wilk lose power with very small samples; moment-based tests require n > 50 for reliable kurtosis estimation.
- Pre-Whitening: Serial correlation in time-series data inflates Type I error rates. Apply AR-model pre-whitening before testing to ensure independent observations.
- Segment-Based Testing: For long signal recordings, apply Gaussianity tests to overlapping or contiguous segments to detect intermittent non-Gaussianity caused by transient impairments.
- Composite Hypotheses: Tests that assume known mean and variance (simple H₀) are more powerful than those estimating parameters; use Lilliefors-corrected critical values when parameters are estimated.
Frequently Asked Questions
Explore the statistical foundations of non-Gaussian signal analysis. These answers address the core mechanisms, mathematical underpinnings, and practical applications of Gaussianity tests in the context of RF fingerprinting and higher-order statistical analysis.
A Gaussianity test is a statistical hypothesis test that determines whether a signal's amplitude distribution deviates from a normal (Gaussian) distribution. It works by computing a test statistic from the observed data—such as sample skewness, kurtosis, or an empirical cumulative distribution function—and comparing it against the theoretical distribution expected under the null hypothesis of Gaussianity. In RF fingerprinting, rejecting the null hypothesis validates the presence of exploitable non-Gaussian hardware fingerprints. Common tests include the Jarque-Bera test, which jointly evaluates skewness and excess kurtosis; the Kolmogorov-Smirnov test, which measures the maximum distance between empirical and theoretical CDFs; and the Anderson-Darling test, which gives more weight to distribution tails where hardware impairments often manifest. The choice of test depends on the specific non-Gaussian signature being targeted, such as amplifier non-linearity or I/Q imbalance.
Enabling Efficiency, Speed & Accuracy
Intelligent Analysis, Decision & Execution
We build AI systems for teams that need search across company data, workflow automation across tools, or AI features inside products and internal software.
Talk to Us
Search across company data
Give teams answers from docs, tickets, runbooks, and product data with sources and permissions.
Useful when people spend too long searching or get different answers from different systems.

Automate internal workflows
Use AI to route work, draft outputs, trigger actions, and keep approvals and logs in place.
Useful when repetitive work moves across multiple tools and teams.

Add AI to products and internal tools
Build assistants, guided actions, or decision support into the software your team or customers already use.
Useful when AI needs to be part of the product, not a separate tool.
Related Terms
Explore the foundational concepts that validate and exploit non-Gaussian signal behavior for RF emitter identification.
Kurtosis
The fourth standardized moment measuring the tailedness of a signal's amplitude distribution. Excess kurtosis (deviation from the Gaussian value of 3) directly indicates the presence of rare, extreme amplitude events caused by hardware non-linearities.
- Leptokurtic distributions (kurtosis > 3) have heavy tails, often from amplifier saturation
- Platykurtic distributions (kurtosis < 3) have thin tails, characteristic of clipped or compressed signals
- Serves as a computationally efficient pre-screen before committing to full bispectral analysis
Skewness
The third standardized moment that quantifies asymmetry in a signal's amplitude probability density function. Non-zero skewness reveals directional hardware biases, such as amplifier non-linearity that compresses one signal quadrant more than another.
- Positive skew: Distribution tail extends toward positive amplitudes
- Negative skew: Distribution tail extends toward negative amplitudes
- Highly sensitive to DC offset and I/Q imbalance in quadrature modulators
Quadratic Phase Coupling
A non-linear phenomenon where two frequency components, f1 and f2, interact within a device's analog stages to generate energy at their sum (f1+f2) or difference (f1-f2) frequencies. This coupling is undetectable by power spectrum analysis but clearly visible in the bispectrum.
- Arises from second-order non-linearities in amplifiers and mixers
- The phase of the generated component is locked to the phases of the originating frequencies
- Forms the physical basis for bispectrum-based fingerprinting
Bicoherence
A normalized bispectrum that provides a bounded metric (0 to 1) quantifying the proportion of signal energy at a bifrequency pair that is quadratically phase-coupled. Unlike the raw bispectrum, bicoherence is independent of signal amplitude.
- Value near 1.0: Strong, consistent phase coupling (likely hardware-induced)
- Value near 0.0: No phase coupling (likely stochastic noise)
- Enables threshold-based detection of non-linearities without amplitude calibration
Cumulant-Based Feature Vector
A compact statistical fingerprint constructed from estimated higher-order cumulants (3rd, 4th, and sometimes 5th order) that serves as input to machine learning classifiers. These vectors are theoretically insensitive to Gaussian noise, making them robust in low-SNR environments.
- Typically includes cumulant combinations like C40/C21² for modulation-independent fingerprinting
- Dimensionality is far lower than raw bispectral data, enabling lightweight classifiers
- Forms the bridge between statistical signal processing and deep learning emitter identification
Non-Gaussian Subspace Projection
A dimensionality reduction technique that projects high-dimensional signal data onto directions that maximize non-Gaussianity, isolating the subspace containing hardware-specific fingerprint information. This separates the fingerprint from Gaussian thermal noise and Gaussian-like interference.
- Often implemented via Independent Component Analysis (ICA)
- The projected subspace dimensions correspond to individual non-Gaussian sources
- Enables blind separation of co-channel emitters without prior knowledge of their signatures

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.
Partnered with leading AI, data, and software stack.
How We Work
Custom AI workflows for your Business
One-fit-all AI don't work for modern businesses. At Inferensys, we aim to understand your business & custom requirements; which we use to define most efficient agentic workflows, the data, and the tools for your business.
01
Review the use case
We understand the task, the users, and where AI can actually help.
Read more02
Pick the right approach
We define what needs search, automation, or product integration.
Read more03
Build the first useful version
We implement the part that proves the value first.
Read more04
Improve from there
We add the checks and visibility needed to keep it useful.
Read moreThe first call is a practical review of your use case and the right next step.
Talk to Us