• DocumentCode
    1079492
  • Title

    Three-dimensional cellular automata and VLSI applications

  • Author

    Tsalides, Ph. ; Hicks, P J ; York, T.A.

  • Author_Institution
    Dept. of Electr. Eng., Democritus Univ. of Thrace, Xanthi, Greece
  • Volume
    136
  • Issue
    6
  • fYear
    1989
  • fDate
    11/1/1989 12:00:00 AM
  • Firstpage
    490
  • Lastpage
    495
  • Abstract
    Finite, three-dimensional (3-D), N*(N*N) cellular automata with boundary conditions are presented and discussed. It is shown that, depending on their local rule and the dimension N, these cellular automata exhibit group or semigroup algebraic structures similar to those in the one and two-dimensional (2-D) cases. The algebraic properties of these 3-D cellular automata are exploited in the implementation of integer modulo arithmetic units. Lower bounds on area A, time T, energy AT and AT2 complexity metrics of 3-D cellular automata-based modulo arithmetic units are also presented.
  • Keywords
    VLSI; finite automata; group theory; 3-D cellular automata; complexity metrics; integer modulo arithmetic units; modulo arithmetic units; multilayer VLSI chip; null boundary conditions; semigroup algebraic structures;
  • fLanguage
    English
  • Journal_Title
    Computers and Digital Techniques, IEE Proceedings E
  • Publisher
    iet
  • ISSN
    0143-7062
  • Type

    jour

  • Filename
    42817
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1079492