摘要
提出了一种新的XPNAV系统解相位模糊度搜索算法,依据检核脉冲星的特征周期,将正确的模糊向量限定在多个子空间内,使用线性搜索寻找子空间种子向量,采用基于满二叉树的穷举搜索算法遍历子空间中向量,并建立向量间的关系。理论分析和仿真实验表明,新的解相位模糊度算法能显著降低系统的运算量,计算过程中的矩阵均是由脉冲星特征属性决定的常数矩阵,便于工程实现,此外二叉树搜索方法还能用于并行计算。
The space search method of X-ray Pulsar Navigation（XPNAV） system ambiguity resolution tests all the vectors in the space,which results in its high complex computation.A new XPNAV system ambiguity resolution algorithm was presented,which limited the correct ambiguity vector to subspaces according to pulsar characteristic period and found the seed vectors of the subspaces using linear search method.Then,the subspace was traversed using exhaustive algorithm based on full binary tree,and the relation among the ambiguity vectors in the subspace was set up simultaneously.Theoretical analysis and experimental simulation show that the new method can reduce the complexity of computation significantly,and due to the constant matrixes depend on pulsar attribute parameters,it is easy to implement in engineering.Besides,the binary tree based search method can also be of parallel implementation.
出处
《武汉大学学报（信息科学版）》
EI
CSCD
北大核心
2011年第1期39-43,共5页
Geomatics and Information Science of Wuhan University
基金
国家863计划资助项目(2007AA12Z323)
国家自然科学基金资助项目(60772139)
关键词
自主天文导航
脉冲星
XPNAV
相位模糊度
满二叉树
autonomous celestial navigation
pulsar
XPNAV
phase ambiguity resolution
full binary tree
