用递归算法实现整周模糊度矢量空间的遍历

Traversing the Ambiguity Vector Space by Recursive Function

整周模糊度搜索是整周模糊度分解的关键 ,周跳的存在使整周模糊度个数具有不确定性 ,本文给出了在整周模糊度不确定的情况下动态整周模糊度搜索问题的描述 ,以及完成整周模糊度矢量空间遍历的递归算法具体实现 。

Searching for the integer ambiguity is crucial for precise GPS baseline resolving.In this paper,how to search for the integer ambiguity dynamtically under the situation that the number of ambiguity is not certain is given.And then,the method of traversing the ambiguity vector space by recursive function is developed, lastly,some numerical result and efficiency analyses are given.