一種快速生成k元de Bruijn序列的算法
A FAST ALGORITHM FOR THE GENERATION OF k-ARY DE BRUIJN SEQUENCES
-
摘要: De Bruijn序列是一類最重要的非線性移位寄存器序列。本文通過并置所有循環(huán)圈的周期約化,提出了一個(gè)新的生成k元de Bruijn序列的算法。該算法每步運(yùn)算可生成一列元素而不是一個(gè)元素,因此減少了運(yùn)算次數(shù),加快了生成速度。
-
關(guān)鍵詞:
- 移位寄存器; De Bruijn序列; 循環(huán)圈
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]高鴻勛.應(yīng)用數(shù)學(xué)學(xué)報(bào),1979,2(4): 314-324.[5]章照止,羅喬林.系統(tǒng)科學(xué)與數(shù)學(xué),1987,7:355-343.[6]熊榮華.中國(guó)科學(xué),A輯,1988,31(8); 877-886.[7]朱士信.電子科學(xué)學(xué)刊,1993,15(5): 523-521.[8]朱士信.高校應(yīng)用數(shù)學(xué)學(xué)報(bào),1993,8(3):308-313. -
計(jì)量
- 文章訪問數(shù): 2338
- HTML全文瀏覽量: 212
- PDF下載量: 430
- 被引次數(shù): 0
下載:
