WEKO3
アイテム
Simple Cellular Automata as Pseudorandom m-Sequence Generators for Built-In Self-Test
https://hiroshima.repo.nii.ac.jp/records/2006126
https://hiroshima.repo.nii.ac.jp/records/20061262a067b53-e3c1-43dc-9d13-b571f1ad83f3
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
ACMTraModel_8_31.pdf (237.1 KB)
|
| Item type | デフォルトアイテムタイプ_（フル）(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2023-03-18 | |||||||
| タイトル | ||||||||
| タイトル | Simple Cellular Automata as Pseudorandom m-Sequence Generators for Built-In Self-Test | |||||||
| 言語 | en | |||||||
| 作成者 |
Matsumoto, Makoto
× Matsumoto, Makoto
|
|||||||
| アクセス権 | ||||||||
| アクセス権 | open access | |||||||
| アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||||
| 権利情報 | ||||||||
| 権利情報 | 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 | |||||||
| 主題 | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | Cellular automata | |||||||
| 主題 | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | Finite fields | |||||||
| 主題 | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | M-sequence | |||||||
| 主題 | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | Pseudorandom number generation | |||||||
| 主題 | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | VLSI | |||||||
| 主題 | ||||||||
| 主題Scheme | NDC | |||||||
| 主題 | 410 | |||||||
| 内容記述 | ||||||||
| 内容記述 | 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. | |||||||
| 言語 | en | |||||||
| 出版者 | ||||||||
| 出版者 | ACM | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 出版タイプ | ||||||||
| 出版タイプ | AO | |||||||
| 出版タイプResource | http://purl.org/coar/version/c_b1a7d7d4d402bcce | |||||||
| 関連情報 | ||||||||
| 識別子タイプ | DOI | |||||||
| 関連識別子 | 10.1145/272991.273007 | |||||||
| 関連情報 | ||||||||
| 関連タイプ | isVersionOf | |||||||
| 識別子タイプ | DOI | |||||||
| 関連識別子 | http://dx.doi.org/10.1145/272991.273007 | |||||||
| 収録物識別子 | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1049-3301 | |||||||
| 収録物識別子 | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA10779230 | |||||||
| 開始ページ | ||||||||
| 開始ページ | 31 | |||||||
| 書誌情報 |
ACM Transactions on Modeling and Computer Simulation ACM Transactions on Modeling and Computer Simulation 巻 8, 号 1, p. 31-42, 発行日 1998-01 |
|||||||
| 旧ID | 15035 | |||||||
