Synthesis of Finite State Machines

Logic Optimization
1997
ISBN: 978-0-7923-9892-9
Verlag: Springer US

Buch, Englisch, 381 Seiten, HC runder Rücken kaschiert, Format (B × H): 160 mm x 241 mm, Gewicht: 1640 g

is the second in a set of two monographs devoted to the synthesis of Finite State Machines (FSMs). The first volume, , addresses functional optimization, whereas this one addresses logic optimization. The result of functional optimization is a symbolic description of an FSM which represents a sequential function chosen from a collection of permissible candidates. Logic optimization is the body of techniques for converting a symbolic description of an FSM into a hardware implementation. The mapping of a given symbolic representation into a two-valued logic implementation is called state encoding (or state assignment) and it impacts heavily area, speed, testability and power consumption of the realized circuit.
The first part of the book introduces the relevant background, presents results previously scattered in the literature on the computational complexity of encoding problems, and surveys in depth old and new approaches to encoding in logic synthesis.
The second part of the book presents two main results about symbolic minimization; a new procedure to find minimal two-level symbolic covers, under face, dominance and disjunctive constraints, and a unified frame to check encodability of encoding constraints and find codes of minimum length that satisfy them.
The third part of the book introduces generalized prime implicants (GPIs), which are the counterpart, in symbolic minimization of two-level logic, to prime implicants in two-valued two-level minimization. GPIs enable the design of an exact procedure for two-level symbolic minimization, based on a covering step which is complicated by the need to guarantee encodability of the final cover. A new efficient algorithm to verify encodability of a selected cover is presented. If a cover is not encodable, it is shown how to augment itminimally until an encodable superset of GPIs is determined. To handle encodability the authors have extended the frame to satisfy encoding constraints presented in the second part.
The covering problems generated in the minimization of GPIs tend to be very large. Recently large covering problems have been attacked successfully by representing the covering table with binary decision diagrams (BDD). In the fourth part of the book the authors introduce such techniques and extend them to the case of the implicit minimization of GPIs, where the encodability and augmentation steps are also performed implicitly.
will be of interest to researchers and professional engineers who work in the area of computer-aided design of integrated circuits.

Zielgruppe

Research

Autoren/Hrsg.

Villa, Tiziano

Sangiovanni-Vincentelli, Alberto L.

Kam, Timothy

Brayton, Robert K.

Fachgebiete

• Technische Wissenschaften Technik Allgemein Computeranwendungen in der Technik
• Mathematik | Informatik EDV | Informatik Angewandte Informatik Computeranwendungen in Wissenschaft & Technologie
• Mathematik | Informatik Mathematik Mathematik Allgemein Mathematische Logik
• Geisteswissenschaften Design Produktdesign, Industriedesign
• Technische Wissenschaften Elektronik | Nachrichtentechnik Elektronik Bauelemente, Schaltkreise
• Technische Wissenschaften Elektronik | Nachrichtentechnik Elektronik Mikroprozessoren
• Technische Wissenschaften Technik Allgemein Konstruktionslehre und -technik
• Mathematik | Informatik EDV | Informatik Professionelle Anwendung Computer-Aided Design (CAD)

Inhaltsverzeichnis

I From Symbolic To Logic Representations.- 1 Introduction.- 2 Definitions.- 3 Complexity Issues.- 4 Encoding For Synthesis.- II Constrained Encoding.- 5 Symbolic Minimization.- 6 Encoding Constraints.- III Generalized Prime Implicants.- 7 Generalized Prime Implicants.- 8 Minimization of GPIS.- 9 Encodeability of GPIS.- IV Implicit Techniques for Encoding.- 10 Implicit Formulation of Unate Covering.- 11 Implicit Minimization of GPIS.- V Conclusions.- 12 Conclusions.- References.