Synthesis of one-dimensional linear hybrid cellular automata

被引：92

作者：

Cattell, K

Muzio, JC

机构：

[1] Department of Computer Science, University of Victoria, Victoria, BC

来源：

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS | 1996年 / 15卷 / 03期

基金：

加拿大自然科学与工程研究理事会;

关键词：

D O I：

10.1109/43.489103

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper presents a method for the synthesis of a one-dimensional linear hybrid cellular automaton (CA) from a given irreducible polynomial, A detailed description of the algorithm is given, together with an outline of the theoretical background, It is shown that two CA exist for each irreducible polynomial, solving the previously open CA existence conjecture. An in-depth example of the synthesis is presented, along with timing benchmarks and an operation count, The algorithm solves the previously open problem of synthesizing CA for all practical applications.

引用

页码：325 / 335

页数：11

共 20 条

[1]

BARDELL PH, 1990, PROCEEDINGS : INTERNATIONAL TEST CONFERENCE 1990, P762, DOI 10.1109/TEST.1990.114093

[2]

BARDELL PH, 1987, BUILT TEST VLSI

[3]

CATTELL K, 1990, PROCEEDINGS OF THE TWENTIETH INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC, P402, DOI 10.1109/ISMVL.1990.122655

[4]

CATTELL K, 1991, DCS161IR U VICT DEP