Fast baseline resolution algorithm for GPS kinematic positioning based on probability computation

Yongliang Xiong; C. K. Shum; Dingfa Huang; Xianzhou Zhang

doi:10.1117/12.472583

1 July 2002 Fast baseline resolution algorithm for GPS kinematic positioning based on probability computation

Yongliang Xiong, C. K. Shum, Dingfa Huang, Xianzhou Zhang

Proceedings Volume 4714, Acquisition, Tracking, and Pointing XVI; (2002) https://doi.org/10.1117/12.472583
Event: AeroSense 2002, 2002, Orlando, FL, United States

Abstract

GPS precise positioning depends on the right determination of phase ambiguity vector. Generally there are three methods for integer ambiguity resolution, including direct rounding to integer method, searching method and ambiguity function method. Direct rounding to integer method is the fastest algorithm among the three methods, but it requires highly precise approximation of the ambiguities, which usually can be only obtained through long term of measurement. The efficiency (speed) of searching method has a very close relationship to the precision of real-valued ambiguity solution, and usually this method is very slow, especially for the data which comes from short time measuring. The efficiency of ambiguity function method is determined by the accuracy of approximation position and the volume of the cube centered at the initial position. The original ambiguities are transformed into another space by a modified ambiguity transformation algorithm purposed by this paper, which is the most effective one compared to the others. In the new ambiguity space, new ambiguities are far more precise than their original partners. Then we compute the successful probability of direct rounding to integer method both in original space and new space. If the success probability is larger than a given value, then direct rounding to integer method is used to obtain the true ambiguities, otherwise go to a subroutine for the searching method.

Citation Download Citation

Yongliang Xiong, C. K. Shum, Dingfa Huang, and Xianzhou Zhang "Fast baseline resolution algorithm for GPS kinematic positioning based on probability computation", Proc. SPIE 4714, Acquisition, Tracking, and Pointing XVI, (1 July 2002); https://doi.org/10.1117/12.472583

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
6 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Global Positioning System

Kinematics

Algorithm development

Chemical elements

Receivers

Satellites

Time metrology

Show All Keywords

Keywords/Phrases

Search In:

Publication Years