產(chǎn)生k元M序列的一種新算法
A NEW ALGORITHM FOR GENERATING k-ARY M SEQUENCES
-
摘要: 本文給出了生成k元M序列的一種新的算法.該算法不再采用主圈并一個(gè)圈的經(jīng)典并圈法,而是利用了主圈并一組共軛圈的新的并圈方法.這樣減少了選擇橋狀態(tài)的次數(shù),進(jìn)而加快了并圈速度.
-
關(guān)鍵詞:
- M序列; 狀態(tài)圖; 橋狀態(tài)
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]朱士信, 高校應(yīng)用數(shù)學(xué)學(xué)報(bào) 6(1991)2,236-240.[6]熊榮華, 中國(guó)科學(xué),A輯,1988年,第8期,第877-886頁(yè). -
計(jì)量
- 文章訪問(wèn)數(shù): 2039
- HTML全文瀏覽量: 112
- PDF下載量: 520
- 被引次數(shù): 0
下載:
