产生k元M序列的一种新算法
A NEW ALGORITHM FOR GENERATING k-ARY M SEQUENCES
-
摘要: 本文给出了生成k元M序列的一种新的算法.该算法不再采用主圈并一个圈的经典并圈法,而是利用了主圈并一组共轭圈的新的并圈方法.这样减少了选择桥状态的次数,进而加快了并圈速度.
-
关键词:
- M序列; 状态图; 桥状态
Abstract: A new algorithm for generating k-ary M sequences is given. Not the classical method that the main cycle is extended by joining to it one cycle but a new method that the main cycle is exended by joining to it a subset of cycles is used in the algorithm. The algorithm reduces the time of choosing bridging states, and accelerates the speed of joining cycles. -
H Fredrickson, J. Maiorana, Discrete Moth.,28(1978)1,207-210.[2]T. Etzion, J. Algorithms, 7(1986)2, 331-340.[3]A. Ralston, J. Algorithms, 2(1981)1, 50-62.[4]Yan Junhui, Systems Science and Mathematical Sciences, 4(1991), 32-40.[5]朱士信, 高校应用数学学报 6(1991)2,236-240.[6]熊荣华, 中国科学,A辑,1988年,第8期,第877-886页. -
计量
- 文章访问数: 2032
- HTML全文浏览量: 110
- PDF下载量: 520
- 被引次数: 0
下载:
