摘要
在深入研究准最佳二进序列偶性质的基础上,提出了一种准最佳二进序列偶的快速生成算法,该算法利用移位序列的思想,借助原序列的列向量和移位序列,能够快速的生成任意长度为4的倍数的准最佳二进序列偶,比计算机穷举搜索法简单易行且容易理解,在最后本文给出了实验加以验证。
By studying the characters of quasi-perfect binary sequence pairs,an algorithm for constructing quasi-perfect binary sequence pairs is presented here.Based on shift sequence,it uses the row vectors of original sequence and the shift sequence.This algorithm can construct quasi-perfect binary sequence pairs quickly whose length is an integer multiple of 4 and it is more easy to understand than searching by computer.At last the paper gives some examples to explain this algorithm.
出处
《电子技术（上海）》
2008年第12期80-81,共2页
Electronic Technology
基金
国家自然科学基金"差集偶理论与扩频通信地址码设计研究"(National Natural Science Foundation.No.60272026)
关键词
准最佳二进序列偶
移位序列
计算机搜索法
列向量
quasi-perfect binary sequence pairs
shift sequence
searching by computer
row vectors
