一种快速生成k元de Bruijn序列的算法
A FAST ALGORITHM FOR THE GENERATION OF k-ARY DE BRUIJN SEQUENCES
-
摘要: De Bruijn序列是一类最重要的非线性移位寄存器序列。本文通过并置所有循环圈的周期约化,提出了一个新的生成k元de Bruijn序列的算法。该算法每步运算可生成一列元素而不是一个元素,因此减少了运算次数,加快了生成速度。Abstract: De Bruijn sequences are highly important nonlinear shift register sequences. This paper presents a new algorithm for the generation of k-ary de Bruijn sequences by juxtaposing the periodic reductions of the necklaces. Its each step produces a string of elements instead of one element. Hence the algorithm reduces the lime of operation, and accelerates the speed of generation.
-
Etzion T. J. Algorithms, 1986, 7(2):331-340.[2]Yan Junhui, Systems Science and Mathematical Science, 1991, 4(1): 32-40.[3]Fredricksen H. SIAM Review, 1982, 24(2):195-221.[4]高鸿勋.应用数学学报,1979,2(4): 314-324.[5]章照止,罗乔林.系统科学与数学,1987,7:355-343.[6]熊荣华.中国科学,A辑,1988,31(8); 877-886.[7]朱士信.电子科学学刊,1993,15(5): 523-521.[8]朱士信.高校应用数学学报,1993,8(3):308-313. -
计量
- 文章访问数: 2279
- HTML全文浏览量: 200
- PDF下载量: 425
- 被引次数: 0
下载:
