Abstract
The most recent contributions to ambiguity resolution techniques have mainly focused on resolution in the ambiguity domain. Two techniques utilizing a decorrelation approach are compared. These techniques are the least-squares ambiguity decorrelation adjustment method and the lattice basis reduction. The latter is also known as the LLL method. The main focus in this article is on the decorrelation performance of these state-of-the-art techniques, which are aiming at ambiguity space decorrelation through unimodular transformations. The performances of the two-decorrelation techniques are compared through their ability in making the ambiguity space as orthogonal as possible.
Similar content being viewed by others
References
Hassibi A, Boyd S (1998) Integer parameter estimation in linear models with applications to GPS. IEEE Trans Signal Proc 46(11):2938–2952
Lenstra AK, Lenstra HW Jr, Lovasz L (1982) Factoring polynomials with rational coefficients. Math Ann 261:515–534
Nemhauser GL, Wolsey LA (1999) Integer and combinatorial optimization. Wiley, New york
Schrijver A (1988) Theory of linear and integer programming. Wiley, New york
Teunissen PJG (1993) Least-squares estimation of the integer GPS ambiguities. Invited lecture, Section IV theory and methodology, IAG General Meeting, Beijing, China
Teunissen PJG (1995) The least-squares ambiguity decorrelation adjustment: a method for fast GPS integer ambiguity estimation. J Geodesy 70:56–82
Teunissen PJG (1999) An optimality property of the integer least-squares estimator. J Geodesy 73:587–593
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Svendsen, J.G.G. Some properties of decorrelation techniques in the ambiguity space. GPS Solut 10, 40–44 (2006). https://doi.org/10.1007/s10291-005-0004-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10291-005-0004-6