北京邮电大学学报

  • EI核心期刊

北京邮电大学学报

• 学术论文 • 上一篇    下一篇

基于 GCC算法的m-序列捕获概率的渐进性分析

    

  1. 北京邮电大学 信息工程学院 , 北京 100876
  • 基金资助:
    国家自然科学基金项目资助 (60172051) 

The Analysis to Asymptotic Property of M-sequence
Acquisition Based on GCC Algorithm 

    

  1. Information Engineering School, Beijing University of Posts and Telecommunications, Beijing 100876, China 
  • Supported by:
     

摘要: 给出了基于GCC算法的m-序列捕获概率计算公式,证明该捕获概率随序列长度变化的渐进性性质,并给出了一般传输条件下,捕获概率随信噪比变化的仿真结果

关键词:

Abstract: Gives the formula for calculating the probability of the m-sequence acquisition. The asymptotic characteristic for the acquisition probability to vary with the length of m-sequence is proved, which is justified by the simulation results.

Key words:

中图分类号: