摘要
当捕获周期较长的序列时,传统的滑动相关捕获方式会消耗巨大的系统资源。为此提出位反向量和移位位反向量,使得由序列状态的试错结果可直接推断出后续序列状态的试错结果,从而避免重复的序列推算过程,提高滑动相关效率。随后通过证明控制状态的生成规律,节省了位反向量及移位位反向量的存储空间。据前述原理,设计出了移位位反序列捕获算法及其接收机,使得捕获复杂度从常规的O(n2)下降为O(n)。
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).
出处
《计算机应用》
CSCD
北大核心
2013年第8期2136-2139,共4页
journal of Computer Applications
基金
忻州师范学院院级基金项目(201016)
关键词
序列捕获
M序列
序列状态
移位位反向量
信息安全
sequential acquisition
m sequence
sequence state
shifted bit inverse vector
information security