A closed-form formula for GPS GDOP computation

被引:75
作者
Doong, Shing H. [1 ]
机构
[1] ShuTe Univ, Dept Informat Management, Yanchao 824, Kaohsiung Cty, Taiwan
关键词
GPS; GDOP; Symmetric polynomials; Newton's identities; NAVIGATION SATELLITE SELECTION; NEURAL NETWORKS; CLASSIFICATION; APPROXIMATION;
D O I
10.1007/s10291-008-0111-2
中图分类号
TP7 [遥感技术];
学科分类号
081102 ; 0816 ; 081602 ; 083002 ; 1404 ;
摘要
Geometric dilution of precision (GDOP) is often used for selecting good satellites to meet the desired positioning precision. An efficient closed-form formula for GDOP has been developed when exactly four satellites are used. It has been proved that increasing the number of satellites for positioning will always reduce the GDOP. Since most GPS receivers today can receive signals from more than four satellites, it is desirable to compute GDOP efficiently for the general case. Previous studies have partially solved this problem with artificial neural network (ANN). Though ANN is a powerful function approximation technique, it needs costly training and the trained model may not be applicable to data deviating too much from the training data. Using Newton's identities from the theory of symmetric polynomials, this paper presents a simple closed-form formula for computing GDOP with the inputs used in previous studies. These inputs include traces of the measurement matrix and its second and third powers, and the determinant of the matrix.
引用
收藏
页码:183 / 190
页数:8
相关论文
共 18 条