基于格理论的模糊度快速解算方法

doi:10.11772/j.issn.1001-9081.2019122126

计算机应用 ›› 2020, Vol. 40 ›› Issue (8): 2299-2304.DOI: 10.11772/j.issn.1001-9081.2019122126

基于格理论的模糊度快速解算方法

王守华^1,2, 吴黎荣^1,2, 纪元法^1,2, 孙希延^1,2

1. 广西精密导航技术与应用重点实验室(桂林电子科技大学), 广西桂林 541004;
2. 卫星导航定位与位置服务国家地方联合工程研究中心(桂林电子科技大学), 广西桂林 541004

收稿日期:2019-12-19 修回日期:2020-04-19 出版日期:2020-08-10 发布日期:2020-05-14
通讯作者: 吴黎荣(1993-),男,江西上饶人,硕士研究生,主要研究方向:北斗高精度定位;842864196@qq.com
作者简介:王守华(1975-),男,山东滨州人,副教授,硕士,主要研究方向:北斗卫星导航、信号处理;纪元法(1975-),男,山东聊城人,教授,博士,主要研究方向:卫星通信、卫星导航;孙希延(1973-),女,山东莘县人,教授,博士,主要研究方向:北斗导航系统。
基金资助:
广西自然科学基金资助项目（2018GXNSFAA050123）；国防预研基金资助项目（61405180104）；认知无线电与信息处理省部共建教育部重点实验室主任基金资助项目（CRKL190105）；广西科技厅项目（桂科AA17202033）；桂林电子科技大学研究生教育创新计划项目（2019YCXS037）；广西科技计划项目（2017AB13014）。

Fast ambiguity resolution method based on lattice theory

WANG Shouhua^1,2, WU Lirong^1,2, JI Yuanfa^1,2, SUN Xiyan^1,2

1. Key Laboratory of Precision Navigation and Applications(Guilin University of Electronic Technology), Guilin Guangxi 541004, China;
2. National and Local Joint Engineering Research Center of Satellite Navigation and Location Awareness(Guilin University of Electronic Technology), Guilin Guangxi 541004, China

Received:2019-12-19 Revised:2020-04-19 Online:2020-08-10 Published:2020-05-14
Supported by:
This work is partially supported by the Guangxi Natural Science Foundation (2018GXNSFAA050123), the National Defense Pre-Research Fund (61405180104), the Director Foundation of Ministry of Education Key Laboratory of Cognitive Radio and Information Processing (CRKL190105), the Guangxi Science and Technology Department Project (AA17202033), the Graduate Education Innovation Program of Guilin Electronic Technology University (2019YCXS037), the Guangxi Science and Technology Program (2017AB13014).

摘要/Abstract

摘要： 为了兼顾未来全球卫星导航系统（GNSS）的兼容与互操作，解决多频多模高维模糊度在常规方法下解算效率低的问题，基于格理论，提出了一种最近格点（CLP）搜索算法对模糊度整型值进行搜索。首先，将模糊度搜索转化为对格中已知格点的最近格点搜索问题；然后，根据格基规约改进得出具有最小可能长度且相互正交的格基向量；最后，采用CLP搜索算法搜索出最优的模糊度参数值。通过模拟实验和实测数据实验验证得出，所提的CLP搜索算法理论上相较经典的最小二乘模糊度降相关（LAMBDA）和改进的LAMBDA（MLAMBDA）算法对模糊度参数的解算效率更高且更可靠，且CLP搜索算法每一个参数搜索时间稳定在0.01 s，即使在高维情况下，CLP搜索算法的搜索依然稳定可靠。

关键词: 高维模糊度, 格理论, 最近格点搜索算法, 降相关处理

Abstract: In order to take into account the compatibility and interoperability of the future Global Navigation Satellite System (GNSS), and solve the problem of low resolution efficiency of multi-frequency, multi-mode and high-dimensional ambiguity in conventional methods, based on the lattice theory, a Closest Lattice Point (CLP) search algorithm was proposed to search the ambiguity integer value. First, the ambiguity search was transformed into the closest lattice point search problem of the known lattice points in the lattice. Then, according to the lattice base specification, the lattice base vectors with the minimum possible length and orthogonal to each other were obtained. Finally, the CLP search algorithm was used to search the optimal ambiguity parameters. The results of simulation and testing data verify that, the proposed CLP search algorithm is theoretically more efficient and reliable on the resolution of ambiguity parameters compared to the classical Least squares AMBiguity Decorrelation Adjustment (LAMBDA) and Modified LAMBDA (MLAMBDA) algorithms, and it has the search time of each parameter stable at 0.01 seconds, which means even in high-dimensional case, the CLP search algorithm is still stable and reliable.

Key words: high dimensional ambiguity, lattice theory, Closest Lattice Point (CLP) search algorithm, decorrelation treatment

中图分类号:

TP301.6

王守华, 吴黎荣, 纪元法, 孙希延. 基于格理论的模糊度快速解算方法[J]. 计算机应用, 2020, 40(8): 2299-2304.

WANG Shouhua, WU Lirong, JI Yuanfa, SUN Xiyan. Fast ambiguity resolution method based on lattice theory[J]. Journal of Computer Applications, 2020, 40(8): 2299-2304.

参考文献

[1] 张晟歌,程乃平,倪淑燕. 基于GNSS系统的整周模糊度解算算法仿真[J]. 现代电子技术, 2019, 42(15):131-133. (ZHANG S G, CHENG N P, NI S Y. Simulation of integer ambiguity resolution algorithm based on GNSS system[J]. Modern Electronics Technique, 2019, 42(15):131-133.)
[2] TEUNISSEN P J G. Success probability of integer GPS ambiguity rounding and bootstrapping[J]. Journal of Geodesy, 1998, 72(10):606-612.
[3] CHANG X W, YANG X, ZHOU T. MLAMBDA:a modified LAMBDA method for integer least-squares estimation[J]. Journal of Geodesy, 2005, 79(9):552-565.
[4] 侯燕青. 多卫星导航系统RTK定位部分整周模糊度解算方法研究[D].长沙:国防科学技术大学, 2017:29-37. (HOU Y Q. Partial integer ambiguity resolution for RTK positioning using multi-constellation GNSS signals[D]. Changsha:National University of Defense Technology, 2017:29-37.)
[5] 邹龙宽,李英祥.基于LAMBDA算法搜索空间的研究[J].地理空间信息,2018,16(12):96-98. (ZOU L K, LI Y X. Research on search space based on LAMBDA algorithm[J]. Geospatial Information, 2018, 16(12):96-98.)
[6] JAZAERI S, AMIRI-SIMKOOEI A R, SHARIFI M A. Erratum to:fast integer least-squares estimation for GNSS high-dimensional ambiguity resolution using lattice theory[J]. Journal of Geodesy, 2012, 86(2):137-137.
[7] 刘经南,于兴旺,张小红. 基于格论的GNSS模糊度解算[J]. 测绘学报, 2012, 41(5):636-645. (LIU J N, YU X W, ZHANG X H. GNSS ambiguity solution based on lattice theory[J]. Acta Geodaetica et Cartographica Sinica, 2012, 41(5):636-645.)
[8] AGRELL E, ERIKSSON T, VARDY A. et al. Closest point search in lattices[J]. IEEE Transactions on Information Theory, 2002, 48(8):2201-2214.
[9] 刘志平,何秀凤. 改进的GPS模糊度降相关LLL算法[J]. 测绘学报, 2007, 36(3):286-289. (LIU Z P, HE X F. An improved LLL algorithm for GPS ambiguity solution[J]. Acta Geodaetica Et Cartographica Sinica, 2007, 36(3):286-289.)
[10] ZHOU Y. A new practical approach to GNSS high-dimensional ambiguity decorrelation[J]. GPS Solutions, 2011, 15(4):325-331.
[11] 刘万科,马立烨,卢立果,等. 一种改进的SEVB整数模糊度搜索算法[J]. 测绘学报, 2018, 47(1):17-24. (LIU W K, MA L K, LU L G, et al. A modified SEVB integer ambiguity search algorithm[J]. Acta Geodaetica Et Cartographica Sinica, 2018,47(1):17-24.)
[12] ODIJK D, ARORA B S, TEUNISSEN P JI G. Predicting the success rate of long-baseline GPS+Galileo (partial) ambiguity resolution[J]. Journal of Navigation, 2014, 67(3):385-401.
[13] SCHAFFRIN B, BOCK Y. A unified scheme for processing GPS dual-band phase observations[J]. Bulletin Géodésique, 1988, 62(2):142-160.
[14] 陈凯,孙希延,纪元法,等. 基于载波相位差分的形变监测高精度定位算法[J]. 计算机应用, 2019, 39(4):1234-1239. (CHEN K, SUN X Y, JI Y F, et al. High-precision positioning algorithm for deformation monitoring based on carrier phase difference[J]. Journal of Computer Applications, 2019, 39(4):1234-1239.)
[15] 王守华,李云柯,纪元法,等. 一种基于位置修正和卡尔曼滤波的姿态角推算算法[J]. 科学技术与工程, 2019, 19(7):115-119. (WANG S H, LI Y K, JI Y F, et al. Alternative algorithm for determing the attitude based on position correction and Kalman filtering[J]. Science Technology and Engineering, 2019, 19(7):115-119.)
[16] 王守华,李云柯,孙希延,等. 基于低成本接收机的双天线测姿算法[J]. 计算机应用, 2019, 39(8):2381-2385. (WANG S H, LI Y K, SUN X Y, et al. Dual-antenna attitude measurement algorithm based on low-cost receiver[J]. Journal of Computer Applications, 2019, 39(8):2381-2385.)

基于格理论的模糊度快速解算方法

Fast ambiguity resolution method based on lattice theory

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

[1]	肖智豪胡志华朱琳. 求解冷链物流时间依赖型车辆路径问题的混合自适应大邻域搜索算法[J]. 计算机应用, 0, (): 0-0.
[2]	沙林秀，聂凡，高倩，孟号. 基于布朗运动与梯度信息的交替优化算法[J]. 计算机应用, 0, (): 0-0.
[3]	董永峰孙跃华高立超韩鹏季海鹏. 基于改进一维卷积和双向长短期记忆神经网络的故障诊断方法[J]. 计算机应用, 0, (): 0-0.
[4]	李大海刘庆腾艾志刚王振东. 基于动态D向分割和混沌扰动的阴阳对算法[J]. 计算机应用, 0, (): 0-0.
[5]	雷鹰郑万波魏嵬夏云霓李晓波刘诚武谢洪. 基于概率性能感知演化博弈策略的混合“云+边”环境中任务卸载方法 [J]. 计算机应用, 0, (): 0-0.
[6]	乔钢柱王瑞孙超利. 基于分解的高维多目标改进进化算法[J]. 计算机应用, 0, (): 0-0.
[7]	朱诚潘旭华张勇. 基于趋化校正的哈里斯鹰优化算法[J]. 计算机应用, 0, (): 0-0.
[8]	平凡汤小春潘彦宇李战怀. 不规则任务在图形处理器集群上的调度策略[J]. 计算机应用, 0, (): 0-0.
[9]	杨杰张名扬芮晓彬王志晓. 融合节点覆盖范围和结构洞的影响力最大化算法[J]. 计算机应用, 0, (): 0-0.
[10]	汤安迪, 韩统, 徐登武, 谢磊. 混沌精英哈里斯鹰优化算法[J]. 计算机应用, 2021, 41(8): 2265-2272.
[11]	李蒙蒙, 秦伟, 刘艺, 刁兴春. 结合头脑风暴优化的混合蚁群优化算法[J]. 计算机应用, 2021, 41(8): 2412-2417.
[12]	张闻强, 邢征, 杨卫东. 基于多区域采样策略的混合粒子群优化求解多目标柔性作业车间调度问题[J]. 计算机应用, 2021, 41(8): 2249-2257.
[13]	张祥飞, 鲁宇明, 张平生. 基于协同进化的约束多目标优化算法[J]. 计算机应用, 2021, 41(7): 2012-2018.
[14]	张萌, 李维华. 用户互动表示下的影响力最大化算法[J]. 计算机应用, 2021, 41(7): 1964-1969.
[15]	王宇, 刘燕丽, 陈劭武. 基于顶点冲突学习的最大公共子图算法[J]. 计算机应用, 2021, 41(6): 1756-1760.