ADOP based upper bounds for the bootstrapped and the least squares ambiguity success.
The success or failure of carrier phase ambiguity resolution can be predicted by means of the probability of correct integer estimation, also referred to as the ambiguity success-rate. In this contribution two easy-to-compute upperbounds of the ambiguity success-rate are described, one for the integ...
| Main Author: | |
|---|---|
| Format: | Journal Article |
| Language: | English |
| Published: |
2000
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/19855 |
| _version_ | 1848750148156391424 |
|---|---|
| author | Teunissen, Peter |
| author_facet | Teunissen, Peter |
| author_sort | Teunissen, Peter |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | The success or failure of carrier phase ambiguity resolution can be predicted by means of the probability of correct integer estimation, also referred to as the ambiguity success-rate. In this contribution two easy-to-compute upperbounds of the ambiguity success-rate are described, one for the integer bootstrapped success-rate and one for the integer least-squares success-rate. The relationship between the two upperbounds is also shown. |
| first_indexed | 2025-11-14T07:32:13Z |
| format | Journal Article |
| id | curtin-20.500.11937-19855 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-14T07:32:13Z |
| publishDate | 2000 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-198552017-01-30T12:16:11Z ADOP based upper bounds for the bootstrapped and the least squares ambiguity success. Teunissen, Peter GPS - ADOP - integer bootstrapping - integer least-squares - ambiguity success-rate upperbound The success or failure of carrier phase ambiguity resolution can be predicted by means of the probability of correct integer estimation, also referred to as the ambiguity success-rate. In this contribution two easy-to-compute upperbounds of the ambiguity success-rate are described, one for the integer bootstrapped success-rate and one for the integer least-squares success-rate. The relationship between the two upperbounds is also shown. 2000 Journal Article http://hdl.handle.net/20.500.11937/19855 en restricted |
| spellingShingle | GPS - ADOP - integer bootstrapping - integer least-squares - ambiguity success-rate upperbound Teunissen, Peter ADOP based upper bounds for the bootstrapped and the least squares ambiguity success. |
| title | ADOP based upper bounds for the bootstrapped and the least squares ambiguity success. |
| title_full | ADOP based upper bounds for the bootstrapped and the least squares ambiguity success. |
| title_fullStr | ADOP based upper bounds for the bootstrapped and the least squares ambiguity success. |
| title_full_unstemmed | ADOP based upper bounds for the bootstrapped and the least squares ambiguity success. |
| title_short | ADOP based upper bounds for the bootstrapped and the least squares ambiguity success. |
| title_sort | adop based upper bounds for the bootstrapped and the least squares ambiguity success. |
| topic | GPS - ADOP - integer bootstrapping - integer least-squares - ambiguity success-rate upperbound |
| url | http://hdl.handle.net/20.500.11937/19855 |