Scholarlink

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

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Theory for the ambiguity function method: probability model and global solution

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年4月4日

查看全文
  • P. J. G. Teunissen,
  • L. Massarweh

摘要

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.