基于LAMBDA方法的模糊度解算研究

高精度GNSS定位需要解算双差模糊度值,经典最小二乘求解的模糊度一般为浮点解,浮点解丢失了模糊度的整数性,不利于提高未知参数的精度。本文讨论了LAMBDA方法的原理及其算法,对模糊度整数变换前后LAMBDA方法的执行结果进行了比较,讨论了联合去相关法和迭代法两种整数Z变换算法的基本原理,对LAMBDA整周模糊度解算方法中的两种整数Z变换算法进行了比较。结果表明LAMBDA方法模糊度效率较高,联合去相关法的处理成功率高于迭代法。     

模糊度降相关应用中的整数正交化过程研究

为解决格理论中最近向量和最短向量两大难题而提出的经典LLL算法已成功应用到模糊度降相关领域。由于模糊度降相关中对变换矩阵的要求,LLL算法在GS正交化变换过程中加入了取整运算,通过分析发现算法的整数正交过程在取整舍入误差的基础上还会引入新的误差,并且随着变换的进行该误差还会累积,最终影响正交化的效果。在分析的基础上对整数正交化过程进行改进,并且通过计算分析验证改进算法较之前有了很大的改进。     

基于搜索空间构造模糊度搜索方法的可靠性

整周模糊度的正确求解关系到GPS精密定位结果的正确性,搜索法解算整周模糊度的原则是获得目标函数的整数解作为模糊度参数的解,文中分析了各种不同搜索方法构造搜索空间的特性,比较了不同搜索方法对模糊度解算可靠性的影响,即通过搜索,不同的方法能否获得满足目标函数的一组整数解.     

基于搜索空间构造模糊度搜索方法的可靠性

整周模糊度的正确求解关系到GPS精密定位结果的正确性，搜索法解算整周模糊度的原则是获得目标函数的整数解作为模糊度参数的解，文中分析了各种不同搜索方法构造搜索空间的特性，比较了不同搜索方法对模糊度解算可靠性的影响，即通过搜索，不同的方法能否获得满足目标函数的一组整数解。     

整周模糊度整数变换前后LAMBDA方法的执行结果比较

首先介绍了求取模糊度整数解的整数最小二乘方法的基本原理和LAMBDA方法，然后讨论了降相关的可容许整数变换对于LAMBDA方法求取双差模糊度整数解的影响。通过一个短基线的实例计算发现：对原始的双差模糊度进行降相关的可容许整数变换，不仅可提高模糊度整数解的准确性，而且还能提高模糊度的求取速度。     

模糊度降相关的整数分块正交化算法

随着模糊度实数解协方差矩阵维数的增加,由于取整运算舍入误差的影响,LLL降相关算法的成功率低、降相关效果差。本文引入分块正交的思想,设计了整数分块Gram-Schmidt正交化算法,同时联合LLL算法提出了基于整数分块正交化的LLL降相关算法（IBGS-LLL）。利用随机模拟的方法,分析了不同维数下不同分块方式的降相关效果,明确了不同模式下算法的分块方式。在动态和静态模式下与改进的LLL算法进行了比较,证明了IBGS-LLL算法在模糊度协方差矩阵降相关方面具有更优的效果和更高的成功率。     

整周模糊度解正确性的评价方法

首先指出了基于传统的假设检验理论的三步法在评价模糊度整数解正确性时存在的理论缺陷，然后介绍了模糊度归整域的概念和可容许整数估计的定义，并在可容许整数估计原定义的基础上给出了更为严密的新定义。最后，基于这个可容许整数估计的新定义，讨论了模糊度成功率的概念及其计算公式。从理论上讲，只有模糊度的成功率才是评价模糊度整数解正确性的严密尺度。     

单历元非差GPS定位函数模型

依据GPS测量原理，导出非差模糊度和双差模糊度，分析一省的组成与特性。原始非差GPS定位函数模型中，设计矩阵秩亏，非差模糊度不具备整数特性，故提出参数重整，将非差模糊度转换为双差模糊度，推出基于参数重整的单历元非差GPS定位函数模型。     

附有约束条件的GPS模糊度快速解算

采用GPS相位观测值进行快速定位时,由于坐标与模糊度参数间的强共线性,造成浮点模糊度最小二乘解的精度很差,整周模糊度难以正确固定。在GPS的实际应用中,可以利用坐标参数与模糊度参数的约束条件,改善浮点模糊度的解算精度,减小整数模糊度的搜索空间。首先给出了这两类约束的通用模型,然后给出了不同情况下约束条件的具体形式,并导出了相应的GPS模糊度快速解算公式。用实例验证了算法的有效性。结果表明,采用约束条件,可排除大量错误的模糊度备选组合,从而提高模糊度的解算效率和成功率。因此,在GPS定位时,应尽可能利用各种约束条件。     

一种检验GNSS相位模糊度整周解算有效性的方法

模糊度整周解检验是评价模糊度解算正确性的关键,决定着最终定位结果的可靠性。对原有的假设检验存在的缺陷和不足进行了分析,提出了一种更可靠的比值（Ratio）检验方法。理论分析和数值试验结果都显示改进的检验方法更能正确评价模糊度整数解解算的正确性。该新检验方法,又提出了一种最终模糊度整数解确定的新方法即模糊度候选值再分析法。实验表明：应用该方法能提高模糊度整数解确定的成功率。     

Grid point search algorithm for fast integer ambiguity resolution

A Grid Point Search Algorithm (GRIPSA) for fast integer ambiguity resolution is presented. In the proposed algorithm, after the orthogonal transformation of the original ambiguity parameters, the confidence ellipsoid of the new parameters is represented by a rectangular polyhedron with its edges parallel to the corresponding axes. A cubic grid covering the whole polyhedron is then identified and transformed back to the original coordinate system. The integer values of the corresponding transformed grid points are obtained by rounding off the transformed values to their nearest integer values. These values are then tested as to whether they are located inside the polyhedron. Since the identification of the grid points in the transformed coordinate system greatly reduces the search region of the integer ambiguities, marked improvements are obtained in the computational effort. Received: 13 October 1997 / Accepted: 9 June 1998     

Computed success rates of various carrier phase integer estimation solutions and their comparison with statistical success rates

The success rate of carrier phase ambiguity resolution (AR) is the probability that the ambiguities are successfully fixed to their correct integer values. In existing works, an exact success rate formula for integer bootstrapping estimator has been used as a sharp lower bound for the integer least squares (ILS) success rate. Rigorous computation of success rate for the more general ILS solutions has been considered difficult, because of complexity of the ILS ambiguity pull-in region and computational load of the integration of the multivariate probability density function. Contributions of this work are twofold. First, the pull-in region mathematically expressed as the vertices of a polyhedron is represented by a multi-dimensional grid, at which the cumulative probability can be integrated with the multivariate normal cumulative density function (mvncdf) available in Matlab. The bivariate case is studied where the pull-region is usually defined as a hexagon and the probability is easily obtained using mvncdf at all the grid points within the convex polygon. Second, the paper compares the computed integer rounding and integer bootstrapping success rates, lower and upper bounds of the ILS success rates to the actual ILS AR success rates obtained from a 24 h GPS data set for a 21 km baseline. The results demonstrate that the upper bound probability of the ILS AR probability given in the existing literatures agrees with the actual ILS success rate well, although the success rate computed with integer bootstrapping method is a quite sharp approximation to the actual ILS success rate. The results also show that variations or uncertainty of the unit–weight variance estimates from epoch to epoch will affect the computed success rates from different methods significantly, thus deserving more attentions in order to obtain useful success probability predictions.     

The Bayesian approach applied to GPS ambiguity resolution. A mixture model for the discrete–real ambiguities alternative

 The problem of phase ambiguity resolution in global positioning system (GPS) theory is considered. The Bayesian approach is applied to this problem and, using Monte Carlo simulation to search over the integer candidates, a practical expression for the Bayesian estimator is obtained. The analysis of the integer grid points inside the search ellipsoid and their evolution with time, while measurements are accumulated, leads to the development of a Bayesian theory based on a mathematical mixture model for the ambiguity. Received: 29 March 2001 / Accepted: 3 September 2001     

BDS网络RTK参考站三频整周模糊度解算方法

北斗卫星导航系统是目前唯一一个全星座提供三频观测数据的卫星导航定位系统,三频观测值有助于载波相位整周模糊度的快速、准确固定。本文提出了一种BDS网络RTK参考站三频整周模糊度解算方法。首先利用B2、B3频率的观测值及严格的模糊度固定标准确定超宽巷整周模糊度,将固定的超宽巷整周模糊度与其他宽巷整周模糊度的线性关系作为约束条件,然后估计宽巷整周模糊度、相对天顶对流层延迟误差和电离层延迟误差,并搜索确定宽巷整周模糊度。利用固定的宽巷整周模糊度与三频载波相位整周模糊度的整数线性关系,将线性关系加入载波相位整周模糊度参数估计观测模型中,然后确定载波相位整周模糊度。使用实测的CORS网BDS三频观测数据进行算法验证,结果表明,该方法可正确有效地实现参考站间三频载波相位整周模糊度的快速解算。     

论确定全球大地水准面的斯托克斯方法

确定全球大地水准面最常用的方法是斯托克司方法。然而,除了人们熟知的缺陷之外,斯托克司方法还存在人们没有意识到的理论困难：当大地水准面位于参考椭球（WGS84椭球）内部时,在大地水准面上及其与参考椭球面界定的区域中扰动位没有定义,当然在这部分区域也不调和。为了解决这一困难,可以选取一个包含在大地水准面内部的由四个基本参数唯一确定其外部正常重力位的参考椭球（简称内部椭球）,其中心与 WGS84 椭球的中心重合,其中的两个基本参数,旋转角速度和地心引力常数,与 WGS84 椭球面的相同,另外两个参数,半长轴和扁率,如此选取,使得内部椭球产生的新的正常重力位在 WGS84 椭球面上与大地水准面上的重力位 相等。这样,传统的斯托克司方法中存在的理论困难不复存在。     

评价GPS相位模糊度整数解正确性的严密方法

针对如何评价模糊度整数解的正确性，指出了基于传统的假设检验理论的三步法存在的理论缺陷，介绍了模糊度归整域的概念和可容许整数估计的定义，并在Teunissen关于可容许整数估计原定义的基础上给出了更为严密的新定义。基于这个新定义，讨论了模糊度成功率的概念及其计算公式。     

0.99999999 confidence ambiguity resolution with GPS and Galileo

In this short contribution it is demonstrated how integer carrier phase cycle ambiguity resolution will perform in near future, when the US GPS gets modernized and the European Galileo becomes operational. The capability of ambiguity resolution is analyzed in the context of precise differential positioning over short, medium and long distances. Starting from dual-frequency operation with GPS at present, particularly augmenting the number of satellites turns out to have beneficial consequences on the capability of correctly resolving the ambiguities. With a 'double' constellation, on short baselines, the confidence of the integer ambiguity solution increases to a level of 0.99999999 or beyond. Electronic Publication     

基于整周模糊度概率特性的有效性检验

准确确定载波相位整周模糊度是快速高精度GPS定位的关键,已有的检验GPS整周模糊度有效性的方法几乎均是基于其为非随机常量建立的,因而都存在一定的缺陷。本文在研究整周模糊度概率特性的基础上,提出一种基于LABMBAD算法的整周模糊度概率分布函数的检验方法。实际演算表明该方法简单有效,统计概念明确。     

Success probability of integer GPS ambiguity rounding and bootstrapping

Global Positioning System ambiguity resolution is usually based on the integer least-squares principle (Teunissen 1993). Solution of the integer least-squares problem requires both the execution of a search process and an ambiguity decorrelation step to enhance the efficiency of this search. Instead of opting for the integer least-squares principle, one might also want to consider less optimal integer solutions, such as those obtained through rounding or sequential rounding. Although these solutions are less optimal, they do have one advantage over the integer least-squares solution: they do not require a search and can therefore be computed directly. However, in order to be confident that these less optimal solutions are still good enough for the application at hand, one requires diagnostic measures to predict their rate of success. These measures of confidence are presented and it is shown how they can be computed and evaluated. Received: 24 March 1998 / Accepted: 8 June 1998