Generalized integer least-squares success-rate bounds under heavy-tailed distributions

Abstract Integer least-squares (ILS) ambiguity resolution has become a cornerstone of high-precision GNSS positioning due to the availability of a rigorous probabilistic theory under the Gaussian assumption. In realistic operating environments, however, GNSS observations are frequently affected by non-Gaussian disturbances arising from multipath propagation, atmospheric interference, receiver anomalies, and intermittent signal blockage. Such effects may induce heavy-tailed behavior, thereby increasing the probability of incorrect integer estimation beyond what is predicted by classical Gaussian success-rate theory. This contribution generalizes the ILS success-rate bounds of Teunissen (1998a, b) to a broad class of elliptically contoured distributions, including the multivariate Student- t and contaminated normal distribution. The resulting success-rate bounds retain the simplicity and sharpness of their Gaussian counterparts, with heavy-tailed effects entering only through a one-dimensional expectation over the scale distribution. It is demonstrated how the theory can be used to characterize the robustness of integer ambiguity resolution under heavy-tailed disturbances, thus substantially extending the applicability of classical success-rate analysis to realistic non-Gaussian GNSS environments while maintaining computational tractability.

Authors

Institutions

Publication Details

Journal
Satellite Navigation
Published
2026-08-25
DOI
https://doi.org/10.1186/s43020-026-00211-1
Primary Topic
GNSS positioning and interference
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Generalized integer least-squares success-rate bounds under heavy-tailed distributions

Peter J. G. Teunissen
Satellite Navigation
GNSS positioning and interference
article

Generalized integer least-squares success-rate bounds under heavy-tailed distributions

Peter J. G. Teunissen
article en

Abstract

Abstract Integer least-squares (ILS) ambiguity resolution has become a cornerstone of high-precision GNSS positioning due to the availability of a rigorous probabilistic theory under the Gaussian assumption. In realistic operating environments, however, GNSS observations are frequently affected by non-Gaussian disturbances arising from multipath propagation, atmospheric interference, receiver anomalies, and intermittent signal blockage. Such effects may induce heavy-tailed behavior, thereby increasing the probability of incorrect integer estimation beyond what is predicted by classical Gaussian success-rate theory. This contribution generalizes the ILS success-rate bounds of Teunissen (1998a, b) to a broad class of elliptically contoured distributions, including the multivariate Student- t and contaminated normal distribution. The resulting success-rate bounds retain the simplicity and sharpness of their Gaussian counterparts, with heavy-tailed effects entering only through a one-dimensional expectation over the scale distribution. It is demonstrated how the theory can be used to characterize the robustness of integer ambiguity resolution under heavy-tailed disturbances, thus substantially extending the applicability of classical success-rate analysis to realistic non-Gaussian GNSS environments while maintaining computational tractability.

Satellite NavigationVol. 7(1)
The University of Melbourne (AU), Curtin University (AU), China Land Surveying and Planning Institute (CN), Delft University of Technology (NL)
Openalex Percentile: Top 7%
GNSS positioning and interference
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.