Simple Cellular Automata as Pseudorandom m-Sequence Generators for Built-In Self-Test
ACM Transactions on Modeling and Computer Simulation 8 巻 1 号
31-42 頁
1998-01 発行
アクセス数 : 727 件
ダウンロード数 : 166 件
今月のアクセス数 : 4 件
今月のダウンロード数 : 3 件
この文献の参照には次のURLをご利用ください : https://ir.lib.hiroshima-u.ac.jp/00015035
| ファイル情報(添付) | |
| タイトル ( eng ) |
Simple Cellular Automata as Pseudorandom m-Sequence Generators for Built-In Self-Test
|
| 作成者 | |
| 収録物名 |
ACM Transactions on Modeling and Computer Simulation
|
| 巻 | 8 |
| 号 | 1 |
| 開始ページ | 31 |
| 終了ページ | 42 |
| 抄録 |
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.
|
| 著者キーワード |
Cellular automata
Finite fields
M-sequence
Pseudorandom number generation
VLSI
|
| NDC分類 |
数学 [ 410 ]
|
| 言語 |
英語
|
| 資源タイプ | 学術雑誌論文 |
| 出版者 |
ACM
|
| 発行日 | 1998-01 |
| 権利情報 |
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
|
| 出版タイプ | Author’s Original（十分な品質であるとして、著者から正式な査読に提出される版） |
| アクセス権 | オープンアクセス |
| 収録物識別子 |
[ISSN] 1049-3301
[DOI] 10.1145/272991.273007
[NCID] AA10779230
[DOI] http://dx.doi.org/10.1145/272991.273007
～の異版である
|
