摘要
为降低Gold码的捕获时间与复杂度,提出将基于因子图的迭代m序列捕获算法应用于Gold码捕获.以全球定位系统(GPS)信号的C/A码为例,首先根据Gold码的生成多项式确定1组具有稀疏结构的校验关系;然后为降低迭代计算的复杂度,提出了不同校验关系顺次校验与混合校验的迭代捕获算法;最后通过仿真研究比较了不同的校验关系和校验方法对迭代捕获算法性能的影响.仿真结果表明,顺次迭代且迭代次数递减的校验方法最优,该方法能在不损失检测概率的情况下降低Gold码捕获的复杂度,同时降低其捕获时间.
To decrease the acquisition time and complexity of Gold code acquisition, m-sequence iterative acquisition algorithm is applied to Gold code. In considering global position system （GPS） C/A code, a group of sparse check relations are found according to creating polynomials of Gold code. And for the purpose of decreasing the complexity of iterative computation, the ordinal check and mixed check method are proposed. Finally, the influences on iterative acquisition performance made by different check relations and different check method are verified by simulation, it shows that the ordinal check with degressive iterative number is getting optimized and effectively decrease the complexity and acquisition time.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2010年第1期38-42,共5页
Journal of Beijing University of Posts and Telecommunications
基金
国家自然科学基金项目(60704018)
