低复杂度伪码迭代捕获方法  

Iterative acquisition of PN code with low complexity

作　　者：王伟[1] 踪念科[1] 熊晔[1] 

机构地区：[1]哈尔滨工程大学自动化学院,黑龙江哈尔滨150001

出　　处：《华中科技大学学报（自然科学版）》2011年第7期30-35,共6页Journal of Huazhong University of Science and Technology(Natural Science Edition)

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

摘　　要：针对迭代消息传递的伪码捕获算法复杂度过高的问题,提出一种低复杂度伪码迭代捕获方法.将伪码迭代捕获方法分成迭代译码算法和向量选择算法2个步骤来讨论:首先,采用归一化简化方法对迭代译码算法进行改进,降低了算法的空间复杂度;其次,提出一种新的伪码向量选择算法,大大降低了算法的时间和空间复杂度.仿真结果显示:提出的伪码迭代捕获算法以低的复杂度,实现了较低信噪比下长伪码的快速捕获,且其捕获性能优于现有的伪码迭代捕获方法.As the pseudo noise （PN） code acquisition based on iterative message passing algorithm is very complicated, thus, a PN code acquisition with low algorithm complexity was proposed. The method was divided into two parts： iterative decode algorithm, and vector selecting algorithm. First, the iterative decode algorithm was improved by a normalization method to reduce the space complexi- ty. Second, a new vector selecting algorithm was proposed, which could reduce the time and space complexity of the algorithms greatly. Simulations show that the iterative acquisition method can real- ize a rapid acquisition of long PN code with a very low complexity at low signal to noise ratio （SNR） and has a higher performance than existant iterative acquisition methods.

关 键 词：长伪码快速捕获 迭代译码 迭代捕获算法 向量选择 算法复杂度 

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