このエントリーをはてなブックマークに追加
ID 15035
本文ファイル
著者
キーワード
Cellular automata
Finite fields
M-sequence
Pseudorandom number generation
VLSI
NDC
数学
抄録(英)
We propose an extremely simple and explicit construction of cellular automata (CA) generating pseudorandom m-sequences, which consist of only one type of cells. This construction has advantages over the previous researches in the following points. (1) There is no need to search for primitive polynomials; a simple sufficient number-theoretic condition realizes maximal periodic CA with periods 2m - 1, m = 2, 3, 5, 89, 9689, 21701, 859433. (2) The configuration does not require hybrid constructions. This makes the implementation much easier. This is a modification of the Rule-90 by Wolfram. We list our CAs with maximal period, up to the size 300. We also discuss the controllability of the CA, randomness of the generated sequence, and a two-dimensional version.
掲載誌名
ACM Transactions on Modeling and Computer Simulation
8巻
1号
開始ページ
31
終了ページ
42
出版年月日
1998-01
出版者
ACM
ISSN
1049-3301
NCID
出版者DOI
言語
英語
NII資源タイプ
学術雑誌論文
広大資料タイプ
学術雑誌論文
DCMIタイプ
text
フォーマット
application/pdf
著者版フラグ
author
権利情報
Copyright (c) 1998 ACM. This is the author version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Transactions on Modeling and Computer Simulation,Vol.8 No.1 ; http://dx.doi.org/10.1145/272991.273007
関連情報URL(IsVersionOf)
http://dx.doi.org/10.1145/272991.273007
部局名
理学研究科