State Diagrams of Elementary Cellular Automata with Arbitrary Boundary Conditions
Summary :
One-dimensional Cellular Automata (CA's) are considered as potential pseudorandom pattern generators to generate highly random parallel patterns with simple hardware configurations. A class of linear, binary, and of nearest neighbor (radius = 1) CA's is referred to here as elementary ones. This paper investigates operations of such CA's with fixed boundary conditions when non-null boundary values are applied to them. By modifying transition matrices of elementary CA's to include the influence of boundary values, structures of state transition diagrams are determined.
- Publication
- IEICE TRANSACTIONS on Information Vol.E81-D No.7 pp.753-758
- Publication Date
- 1998/07/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section LETTER (Special Issue on Test and Diagnosis of VLSI)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Poh Yong KOH, Kiyoshi FURUYA, "State Diagrams of Elementary Cellular Automata with Arbitrary Boundary Conditions" in IEICE TRANSACTIONS on Information,
vol. E81-D, no. 7, pp. 753-758, July 1998, doi: .
Abstract: One-dimensional Cellular Automata (CA's) are considered as potential pseudorandom pattern generators to generate highly random parallel patterns with simple hardware configurations. A class of linear, binary, and of nearest neighbor (radius = 1) CA's is referred to here as elementary ones. This paper investigates operations of such CA's with fixed boundary conditions when non-null boundary values are applied to them. By modifying transition matrices of elementary CA's to include the influence of boundary values, structures of state transition diagrams are determined.
URL: https://global.ieice.org/en_transactions/information/10.1587/e81-d_7_753/_p
Copy
@ARTICLE{e81-d_7_753,
author={Poh Yong KOH, Kiyoshi FURUYA, },
journal={IEICE TRANSACTIONS on Information},
title={State Diagrams of Elementary Cellular Automata with Arbitrary Boundary Conditions},
year={1998},
volume={E81-D},
number={7},
pages={753-758},
abstract={One-dimensional Cellular Automata (CA's) are considered as potential pseudorandom pattern generators to generate highly random parallel patterns with simple hardware configurations. A class of linear, binary, and of nearest neighbor (radius = 1) CA's is referred to here as elementary ones. This paper investigates operations of such CA's with fixed boundary conditions when non-null boundary values are applied to them. By modifying transition matrices of elementary CA's to include the influence of boundary values, structures of state transition diagrams are determined.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - State Diagrams of Elementary Cellular Automata with Arbitrary Boundary Conditions
T2 - IEICE TRANSACTIONS on Information
SP - 753
EP - 758
AU - Poh Yong KOH
AU - Kiyoshi FURUYA
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E81-D
IS - 7
JA - IEICE TRANSACTIONS on Information
Y1 - July 1998
AB - One-dimensional Cellular Automata (CA's) are considered as potential pseudorandom pattern generators to generate highly random parallel patterns with simple hardware configurations. A class of linear, binary, and of nearest neighbor (radius = 1) CA's is referred to here as elementary ones. This paper investigates operations of such CA's with fixed boundary conditions when non-null boundary values are applied to them. By modifying transition matrices of elementary CA's to include the influence of boundary values, structures of state transition diagrams are determined.
ER -
English
