GPS接收机并行捕获算法的研究  

Study on parallel acquisition algorithm for GPS receiver

作　　者：袁建国[1] 欧松林[1] 

机构地区：[1]重庆邮电大学光纤通信技术重点实验室,重庆400065

出　　处：《重庆邮电大学学报（自然科学版）》2013年第4期470-474,共5页Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)

基　　金：国家自然科学基金项目(61071117;61275077;61003256);重庆市自然科学基金(CSTC;2010BB2409);重庆市教委项目(KJ110519)~~

摘　　要：对全球定位系统(global positioning system,GPS)中3种并行捕获算法进行了理论分析,同时针对捕获算法运算量、捕获时间、捕获灵敏度以及捕获结果 4个方面进行了对比分析和仿真验证。仿真分析表明:3种并行捕获算法均能有效捕获GPS信号。其中,匹配滤波算法硬件实现简单,但运算量大、捕获速度慢;C/A(coarse/acquisi-tion)码循环相关算法运算量小、捕获速度快,但硬件实现复杂;部分匹配滤波-快速傅里叶变换(partial matched fil-ter-fast Fourier transform,PMF-FFT)算法运算量适中、捕获速度快、硬件实现简单,但其捕获灵敏度相对于另2种算法低0.9 dB。所以,PMF-FFT算法更适合硬件大规模推广且实用价值高。The theoretical analysis on three kinds of the parallel acquisition algorithms for global positioning system（GPS） receiver is performed.The four aspects of the acquisition computation amount,acquisition time,acquisition sensitivity and acquisition results for acquisition algorithms are comparatively analyzed and simulated.The simulation analysis shows that three parallel acquisition algorithms can effectively acquire the GPS signal.The matched filtering algorithm is simpler in hardware implementation,but larger in computation amount and slower in acquisition speed;the coarse/acquisition（C/A） code-cycle-related algorithm is smaller in computation and more rapid in acquisition speed,but more complex in hardware implementation;the partial matching filter-fast Fourier transformation（PMF-FFT） algorithm is moderate in computation amount,more rapid in acquisition speed and simpler in hardware implementation,but its acquisition sensitivity is lower 0.9 dB than that of the two other algorithms.On the whole,the scheme of PMF-FFT algorithm can better be suitable for large scale hardware application and has a higher practical value.

关 键 词：全球定位系统（GPS） 并行捕获 匹配滤波 C A码循环相关 部分匹配滤波-快速傅里叶变换（PMF-FFT） 

分 类 号：TN967.1[电子电信—信号与信息处理]