On the computation of the best integer equivariant estimator
dc.contributor.author | Teunissen, Peter | |
dc.date.accessioned | 2017-01-30T10:35:31Z | |
dc.date.available | 2017-01-30T10:35:31Z | |
dc.date.created | 2012-06-11T02:32:57Z | |
dc.date.issued | 2005 | |
dc.identifier.citation | Teunissen, P.J.G. 2005. On the computation of the best integer equivariant estimator. Artificial Satellites. 40 (3): pp. 161-171. | |
dc.identifier.uri | http://hdl.handle.net/20.500.11937/3969 | |
dc.description.abstract |
Carrier phase integer ambiguity resolution is the key to high precision Global Navigation Satellite System (GNSS) positioning and navigation. In this contribution we study some of the computational aspects of best integer equivariant estimation. The best integer equivariant (BIE) estimator is the optimal estimator of the class of integer equivariant estimators, which is one of the three classes of estimators for carrier phase ambiguity resolution. The two other classes are the class of integer estimators and the class of integer aperture estimators. Since the BIE-estimator can not be computed exactly, it is shown how to approximate this estimator while retaining the property of integer equivariance. It is also shown how the decorrelating Z-transformation and the integer search of the LAMBDA method can be used to speed up the computation of the BIE-estimator. | |
dc.publisher | Versita | |
dc.relation.uri | http://saegnss1.curtin.edu.au/Publications/2005/Teunissen2005computation.pdf | |
dc.subject | Best Integer Equivariant Estimation | |
dc.subject | GNSS Ambiguity Resolution | |
dc.subject | Integer Least-Squares | |
dc.title | On the computation of the best integer equivariant estimator | |
dc.type | Journal Article | |
dcterms.source.volume | 40 | |
dcterms.source.number | 3 | |
dcterms.source.startPage | 161 | |
dcterms.source.endPage | 171 | |
dcterms.source.issn | 0208841X | |
dcterms.source.title | Artificial Satellites | |
curtin.department | Delft University of Technology | |
curtin.accessStatus | Open access |