Algebraic decomposition of MCNC benchmark FSMs for logic synthesis

An interactive application of algebraic structure theory is presented to decompose finite state machines (FSMs) for logic synthesis purposes. Parallel and serial decompositions with symbolic states are achieved. CASTOR, JEDI ESPRESSO, and MIS are utilized to perform state assignment and logic minimization. Experimental results of two-level and multi-level implementations of MCNC benchmark FSMs are presented.<<ETX>>

[1]  Srinivas Devadas,et al.  Decomposition and factorization of sequential finite state machines , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Srinivas Devadas,et al.  Optimum and heuristic algorithms for finite state machine decomposition and partitioning , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[3]  Gabriele Saucier,et al.  State Assignment Using a New Embedding Method Based on an Intersecting Cube Theory , 1989, 26th ACM/IEEE Design Automation Conference.

[4]  Franz Pichler,et al.  CAST Computerunterstützte Systemtheorie , 1990 .

[5]  Wilhelm Burger.  A versatile development tool for knowledge-based computer vision , 1991 .

[6]  Srinivas Devadas,et al.  A unified approach to the decomposition and re-decomposition of sequential machines , 1991, DAC '90.

[7]  Robert K. Brayton,et al.  MIS: A Multiple-Level Logic Optimization System , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[8]  J. Hartmanis,et al.  Algebraic Structure Theory Of Sequential Machines , 1966 .

[9]  G. Rietsche,et al.  CASTOR: state assignment in a finite state machine synthesis system , 1990, [Proceedings] EURO ASIC `90.