基于SFT的卫星导航信号快速捕获算法分析  

Analysis of Fast Acquisition Algorithm of Navigation Satellite Signal Based on SFT

作　　者：杨尧 李传军[1] 史永清 李兴城[1] YANG Yao;LI Chuanjun;SHI Yongqing;LI Xingcheng(School of Aerospace Engineering,Beijing Institute of Technology,Beijing 100081,China)

机构地区：[1]北京理工大学宇航学院,北京100081

出　　处：《电子信息对抗技术》2023年第1期30-36,共7页Electronic Information Warfare Technology

基　　金：国家自然科学基金资助项目(61473039)。

摘　　要：卫星导航接收机中捕获阶段的用时直接影响了接收机的首次定位时间(Time to First Fix,TTFF),许多场景对卫星导航接收机的捕获速度提出了更高的要求。基于稀疏傅立叶变换(Sparse Fourier Transform,SFT)的卫星导航信号快速捕获算法利用捕获相关值的稀疏特性,通过对输入信号进行混叠处理,优化捕获过程中相关运算的效率,减少运算量。对基于SFT的卫星导航信号快速捕获算法性能进行分析和仿真验证,仿真结果表明,与基于快速傅立叶变换(Fast Fourier Transform,FFT)的并行码相位捕获算法相比,基于SFT的并行码相位捕获算法能大幅提高运算效率,减少运算量,具有一定的工程参考价值。The time to first fix(TTFF)is affected by the cost of acquisition in the satellite receiver directly.In many scenarios,higher requirements are placed on the acquisition speed of the satellite receiver.Based on sparse Fourier transform(SFT),the fast acquisition algorithm utilizes the sparsity of the correlation value by aliasing the input signal.In the acquisition process,the efficiency of the correlation operation is optimized and the amount of computation is reduced.The performance of the fast acquisition algorithm for navigation satellite signals,which is based on SFT,is analyzed and verified by simulation.The simulation results show that the calculation efficiency is greatly improved and the amount of calculation is reduced by the parallel code phase acquisition algorithm based on SFT,compared with the algorithm based on fast Fourier transform(FFT).

关 键 词：卫星导航信号 快速捕获 混叠 稀疏傅立叶变换 

分 类 号：TN927[电子电信—通信与信息系统]