论文部分内容阅读
为解决低信噪比下长伪码序列快速捕获问题,提出一种基于迭代消息传递算法的快速捕获方法.通过证明m序列是一种特殊的线性分组码,将m序列用Tanner型因子图表示,然后在得到的图模型上迭代运行消息传递算法来估计m序列的初始相位.在低信噪比下的分析和仿真结果均表明:该算法能稳定工作.相比混合捕获算法,其检测性能下降了大约5 dB,但其平均捕获时间约为同条件下混合捕获方法的1/10,其计算复杂度仅为传统捕获算法的几十分之一.
In order to solve the problem of fast capture of long pseudo-code sequences with low signal-to-noise ratio (SNR), a fast acquisition method based on iterative message passing algorithm is proposed. By proving that m-sequence is a special linear block code, , And then run the message transfer algorithm iteratively on the graph model to estimate the initial phase of m sequence.Analysis and simulation results under low SNR show that the algorithm can work stably.Compared with hybrid acquisition algorithm, About 5 dB, but the average acquisition time is about 1/10 of the hybrid capture method under the same conditions, and its computational complexity is only a fraction of the traditional capture algorithm.