计算机应用 ›› 2013, Vol. 33 ›› Issue (08): 2136-2139.

• 网络与通信 • 上一篇    下一篇

移位位反序列捕获算法

任国凤1,吉江1,2,田竹梅1   

  1. 1. 忻州师范学院 电子系,山西 忻州 034000
    2. 国家数字交换系统工程技术研究中心,郑州 450002
  • 收稿日期:2013-03-05 修回日期:2013-05-06 出版日期:2013-08-01 发布日期:2013-09-11
  • 通讯作者: 吉江
  • 作者简介:任国凤(1979-)女,山西忻州人,讲师,硕士,主要研究方向:现代编码理论、计算机网络安全;
    吉江(1983-),男,山西忻州人,博士研究生,主要研究方向:无线宽带通信、物理层安全;
    田竹梅(1980-),女,山西原平人,讲师,硕士,主要研究方向:自组织网络、盲信号处理。
  • 基金资助:

    忻州师范学院院级基金项目

The Shifted Bit Inverse Sequential Acquisition Algorithm

REN Guofeng1,JI Jiang1,2,TIAN Zhumei1   

  1. 1. Department of Electronics, Xinzhou Teachers University, Xinzhou Shanxi 034000, China
    2. China National Digital Switching System Engineering and Technological R&D Center, Zhengzhou Henan 450002, China
  • Received:2013-03-05 Revised:2013-05-06 Online:2013-09-11 Published:2013-08-01
  • Contact: JI Jiang

摘要: 当捕获周期较长的序列时,传统的滑动相关捕获方式会消耗巨大的系统资源。为此提出位反向量和移位位反向量,使得由序列状态的试错结果可直接推断出后续序列状态的试错结果,从而避免重复的序列推算过程,提高滑动相关效率。随后通过证明控制状态的生成规律,节省了位反向量及移位位反向量的存储空间。据前述原理,设计出了移位位反序列捕获算法及其接收机,使得捕获复杂度从常规的O(n2)下降为O(n)。

关键词: 序列捕获, m序列, 序列状态, 移位位反向量, 信息安全

Abstract: When the period of objective sequence is long enough, the traditional acquisition algorithm will consume a lot of system resource. The shifted bit inverse sequential acquisition algorithm was proposed, which could be utilized to deduce the trail-and-error results of following sequence state from the previous trail-and-error result. As a result, the complicated sequence shifting calculation was avoided. Then the rule of the control state was proved, which led to the storage space reduction of the bit inverse vector and shifted bit inverse vector. Finally, an acquisition system based on the theory mentioned above was designed, which could acquire sequence with high efficiency, and the complexity decreased from conventional O(n2) to O(n).

Key words: sequential acquisition, m sequence, sequence state, shifted bit inverse vector, information security

中图分类号: