Zhu Shixin. A FAST ALGORITHM FOR THE GENERATION OF k-ARY DE BRUIJN SEQUENCES[J]. Journal of Electronics & Information Technology, 1995, 17(6): 618-622.
Citation:
Zhu Shixin. A FAST ALGORITHM FOR THE GENERATION OF k-ARY DE BRUIJN SEQUENCES[J]. Journal of Electronics & Information Technology, 1995, 17(6): 618-622.
Zhu Shixin. A FAST ALGORITHM FOR THE GENERATION OF k-ARY DE BRUIJN SEQUENCES[J]. Journal of Electronics & Information Technology, 1995, 17(6): 618-622.
Citation:
Zhu Shixin. A FAST ALGORITHM FOR THE GENERATION OF k-ARY DE BRUIJN SEQUENCES[J]. Journal of Electronics & Information Technology, 1995, 17(6): 618-622.
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.
DownLoad: