• DocumentCode
    1976103
  • Title

    The analysis of one dimensional multiple-valued linear cellular automata

  • Author

    Cattell, K. ; Serra, M.

  • Author_Institution
    Dept. of Comput. Sci., Victoria Univ., BC, Canada
  • fYear
    1990
  • fDate
    23-25 May 1990
  • Firstpage
    402
  • Lastpage
    409
  • Abstract
    The authors present an analysis of multiple-valued linear cellular automata (CA) and their properties over GF(q). An application for pseudorandom pattern generation over a finite alphabet is discussed. For these cellular automata, the legal computational rules are defined and classified. The desired cellular automata must also have a maximal-length cycle in their state transition graph. An efficient recurrence relation and similarity transformations are presented. Three separate methods are outlined to produce minimal-cost CA with the above properties
  • Keywords
    finite automata; many-valued logics; random number generation; legal computational rules; maximal-length cycle; minimal-cost CA; one dimensional multiple-valued linear cellular automata; pseudorandom pattern generation; recurrence relation; similarity transformations; state transition graph; Automata; Automatic testing; Circuit testing; Computational modeling; Computer architecture; Costs; Galois fields; Law; Legal factors; Very large scale integration;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Multiple-Valued Logic, 1990., Proceedings of the Twentieth International Symposium on
  • Conference_Location
    Charlotte, NC
  • Print_ISBN
    0-8186-2046-3
  • Type

    conf

  • DOI
    10.1109/ISMVL.1990.122655
  • Filename
    122655
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1976103