欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
为解决常规基于滑动相关伪码捕获算法的捕获时间较长的问题,提出了一种基于Tanner图的伪随机码迭代捕获算法,给出了伪随机码的Tanner图表示和在该图上的和积算法流程.通过仿真的方法分析了迭代捕获算法的性能,并指出当迭代码长为200~300、迭代次数为15次左右时,迭代效果与复杂度之比最大.同时仿真结果表明,该算法在信噪比大于-11 dB时,其最大后验估计误码率能稳定收敛到0,证明了该算法的实用性.最后给出了迭代捕获算法的改进方法,使得该方法能应用于低信噪比条件.
英文摘要：
To solve the problem of long acquisition time of routine pseudo noise（PN）code acquisition algorithms, a PN code iterative acquisition algorithm based on Tanner graph is proposed based on sliding correlation. The Tanner graph show of PN code and the sum-product algorithm process on the graph are presented. The performance of iterative acquisition algorithm is analyzed. When the iterative length enters 200--300 and the iterative number is about 15, the ratio of performance and complexity will reach its maximum value. Simulations show that when the signal-noise ratio is bigger than - 11 dB, the bit-error rate of the maximum a posteriori（MAP）will convergence to zero. The improved method of iterative algorithm is also presented, thus the algorithm can be used at low signal-noise ratio.
同期刊论文项目
同项目期刊论文
期刊信息
位置：