.png){kind=icon}
返回
Theory for the ambiguity function method: probability model and global solution
.png){kind=icon}
OA
AI
DOI：10.1007/s00190-025-01945-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this contribution, we introduce some new theory for the classical GNSS ambiguity function (AF) method. We provide the probability model by means of which the AF-estimator becomes a maximum likelihood estimator, and we provide a globally convergent algorithm for computing the AF-estimate. The algorithm is constructed from combining the branch-and-bound principle, with a special convex relaxation of the multimodal ambiguity function, to which the projected-gradient-descent method is applied to obtain the required bounds. We also provide a systematic comparison between the AF-principle and that of integer least-squares (ILS). From this comparison, the conclusion is reached that the two principles are fundamentally different, although there are identified circumstances under which one can expect AF- and ILS-solutions to behave similarly.
Keyword:
GNSS
Ambiguity function (AF) method
Maximum likelihood
Integer least-squares (ILS)
Branch-and-bound (BB)
Convex relaxation
Projected-gradient-descent (PGD)
