NOVA: State Assignment of Finite State Machines for Optimal Two-Level Logic Implementations

The problem of encoding the states of a synchronous finite state machine (FSM) so that the area of a two-level implementation of the combinational logic is minimized is addressed. As in previous approaches, the problem is reduced to the solution of the combinatorial optimization problems defined by the translation of the cover obtained by a multiple-valued logic minimization or by a symbolic minimization into a compatible Boolean representation. The authors present algorithms for this solution, based on a novel theoretical framework that offers advantages over previous approaches to develop effective heuristics. The algorithms are part of NOVA, a program for optimal encoding of control logic. Final areas averaging 20% less than other state assignment programs and 30% less than the best random solution have been obtained. Literal counts averaging 30% less than the best random solutions have been obtained. >

[1]  Tiziano Villa,et al.  Computer-aided synthesis of PLA-based finite-state machines , 1983 .

[2]  Juris Hartmanis,et al.  On the State Assignment Problem for Sequential Machines. I , 1961, IRE Trans. Electron. Comput..

[3]  Gabriele Saucier.  State Assignment of Asynchronous Sequential Machines Using Graph Techniques , 1972, IEEE Transactions on Computers.

[4]  Gabriele Saucier,et al.  ASYL: A Rule-Based System for Controller Synthesis , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[5]  Giovanni De Micheli.  Symbolic Design of Combinational and Sequential Logic Circuits Implemented by Two-Level Logic Macros , 1986, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Edward J. McCluskey,et al.  The Coding of Internal States of Sequential Circuits , 1964, IEEE Trans. Electron. Comput..

[7]  Robert K. Brayton,et al.  Optimal State Assignment for Finite State Machines , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[8]  Kurt Keutzer,et al.  A kernel-finding state assignment algorithm for multi-level logic , 1988, DAC '88.

[9]  Srinivas Devadas,et al.  Exact algorithms for output encoding, state assignment, and four-level Boolean minimization , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Jeanine Weekes Schroer,et al.  The Finite String Newsletter Abstracts of Current Literature Glisp User's Manual , 2022 .

[11]  Richard M. Karp,et al.  Some Techniques of State Assignment for Synchronous Sequential Machines , 1964, IEEE Trans. Electron. Comput..

[12]  T. Villa.  Constrained encoding in hypercubes: algorithms and applications tological synthesis , 1987 .

[13]  Douglas B. Armstrong,et al.  A Programmed Algorithm for Assigning Internal Codes to Sequential Machines , 1962, IRE Trans. Electron. Comput..

[14]  Alexander Saldanha,et al.  PLA optimization using output encoding , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.