Free Delivery Over $100
|
|
|||
|
||||
OverviewThe result of functional optimization is a symbolic description of an FSM which represents a sequential function chosen from a collection of permissible candidates. This volume addresses logic optimization, 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 minization. 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 it minimally 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. Full Product DetailsAuthor: Tiziano Villa , Timothy Kam , Robert K. Brayton , Alberto L. Sangiovanni-VincentelliPublisher: Springer Imprint: Springer Edition: 1997 ed. Dimensions: Width: 15.50cm , Height: 2.30cm , Length: 23.50cm Weight: 1.640kg ISBN: 9780792398929ISBN 10: 0792398920 Pages: 381 Publication Date: 30 April 1997 Audience: Professional and scholarly , General/trade , Professional & Vocational Format: Hardback Publisher's Status: Active Availability: In Print  This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsI 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.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |
||||
