{"product_id":"synthesis-of-finite-state-machines-logic-optimization-von-robert-k-brayton-timothy-kam-alberto-sangiovanni-vincentelli-tiziano-villa","title":"Synthesis of Finite State Machines","description":"\n                                \n                \u003cem\u003eSynthesis of Finite State Machines: Logic Optimization\u003c\/em\u003e\n                                 is  the second in a set of two monographs devoted to the synthesis of  Finite State Machines (FSMs). The first volume, \n                \n                \u003cem\u003eSynthesis of Finite  State Machines:\u003c\/em\u003e\n                                 \n                \n                \u003cem\u003eFunctional Optimization\u003c\/em\u003e\n                                , 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. \n                \n                \u003cbr\u003e\n                                  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. \n                \n                \u003cbr\u003e\n                                  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. \n                \n                \u003cbr\u003e\n                                  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. \n                \n                \u003cbr\u003e\n                                  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. \n                \n                \u003cbr\u003e\n                                  \n                \n                \u003cem\u003eSynthesis of Finite State Machines: Logic Optimization\u003c\/em\u003e\n                                 will be  of interest to researchers and professional engineers who work in the  area of computer-aided design of integrated circuits.\n            \n            \u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9780792398929\"\u003e\u003ch3\u003eLogic Optimization\u003c\/h3\u003e\u003c\/div\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9781461378211\"\u003e\u003ch3\u003eLogic Optimization\u003c\/h3\u003e\u003c\/div\u003e","brand":"Libri","offers":[{"title":"Hardcover - 9780792398929","offer_id":50726419590,"sku":"9780792398929","price":106.99,"currency_code":"EUR","in_stock":true},{"title":"Softcover - 9781461378211","offer_id":39415611457629,"sku":"9781461378211","price":106.99,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/4c485dd0-a03e-4480-b233-d06828a82c12.jpg?v=1781324573","url":"https:\/\/shop.autorenwelt.de\/products\/synthesis-of-finite-state-machines-logic-optimization-von-robert-k-brayton-timothy-kam-alberto-sangiovanni-vincentelli-tiziano-villa","provider":"Autorenwelt Shop","version":"1.0","type":"link"}