Artículos relacionados a Synthesis of Finite State Machines: Logic Optimization

Synthesis of Finite State Machines: Logic Optimization - Tapa blanda

 
9781461378211: Synthesis of Finite State Machines: Logic Optimization

Sinopsis

Synthesis of Finite State Machines: Logic Optimization is the second in a set of two monographs devoted to the synthesis of Finite State Machines (FSMs). The first volume, Synthesis of Finite State Machines: Functional Optimization, 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.
Synthesis of Finite State Machines: Logic Optimization will be of interest to researchers and professional engineers who work in the area of computer-aided design of integrated circuits.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

Synthesis of Finite State Machines: Logic Optimization is the second in a set of two monographs devoted to the synthesis of Finite State Machines (FSMs). The first volume, Synthesis of Finite State Machines: Functional Optimization, 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 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.
Synthesis of Finite State Machines: Logic Optimization will be of interest to researchers and professional engineers who work in the area of computer-aided design of integrated circuits.

"Sobre este título" puede pertenecer a otra edición de este libro.

  • EditorialSpringer
  • Año de publicación2012
  • ISBN 10 1461378214
  • ISBN 13 9781461378211
  • EncuadernaciónTapa blanda
  • IdiomaInglés
  • Número de páginas400
  • Contacto del fabricanteno disponible

Comprar usado

Condición: Como Nuevo
Like New
Ver este artículo

EUR 29,80 gastos de envío desde Reino Unido a España

Destinos, gastos y plazos de envío

Comprar nuevo

Ver este artículo

EUR 19,49 gastos de envío desde Alemania a España

Destinos, gastos y plazos de envío

Otras ediciones populares con el mismo título

9780792398929: Synthesis of Finite State Machines: Logic Optimization

Edición Destacada

ISBN 10:  0792398920 ISBN 13:  9780792398929
Editorial: Springer, 1997
Tapa dura

Resultados de la búsqueda para Synthesis of Finite State Machines: Logic Optimization

Imagen del vendedor

Tiziano Villa|Timothy Kam|Robert K. Brayton|Alberto L. Sangiovanni-Vincentelli
Publicado por Springer US, 2012
ISBN 10: 1461378214 ISBN 13: 9781461378211
Nuevo Tapa blanda
Impresión bajo demanda

Librería: moluna, Greven, Alemania

Calificación del vendedor: 4 de 5 estrellas Valoración 4 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Synthesis of Finite State Machines: Logic Optimization is the second in a set of two monographs devoted to the synthesis of Finite State Machines (FSMs). The first volume, Synthesis of Finite State Machines: Functional Optimization. Nº de ref. del artículo: 4195940

Contactar al vendedor

Comprar nuevo

EUR 93,00
Convertir moneda
Gastos de envío: EUR 19,49
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: Más de 20 disponibles

Añadir al carrito

Imagen del vendedor

Tiziano Villa
Publicado por Springer US Okt 2012, 2012
ISBN 10: 1461378214 ISBN 13: 9781461378211
Nuevo Taschenbuch
Impresión bajo demanda

Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Synthesis of Finite State Machines: Logic Optimization is the second in a set of two monographs devoted to the synthesis of Finite State Machines (FSMs). The first volume, Synthesis of Finite State Machines: Functional Optimization, 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 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. Synthesis of Finite State Machines: Logic Optimization will be of interest to researchers and professional engineers who work in the area of computer-aided design of integrated circuits. 400 pp. Englisch. Nº de ref. del artículo: 9781461378211

Contactar al vendedor

Comprar nuevo

EUR 106,99
Convertir moneda
Gastos de envío: EUR 11,00
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: 2 disponibles

Añadir al carrito

Imagen del vendedor

Tiziano Villa
Publicado por Springer US, 2012
ISBN 10: 1461378214 ISBN 13: 9781461378211
Nuevo Taschenbuch

Librería: AHA-BUCH GmbH, Einbeck, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Synthesis of Finite State Machines: Logic Optimization is the second in a set of two monographs devoted to the synthesis of Finite State Machines (FSMs). The first volume, Synthesis of Finite State Machines: Functional Optimization, 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. Synthesis of Finite State Machines: Logic Optimization will be of interest to researchers and professional engineers who work in the area of computer-aided design of integrated circuits. Nº de ref. del artículo: 9781461378211

Contactar al vendedor

Comprar nuevo

EUR 111,53
Convertir moneda
Gastos de envío: EUR 11,99
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: 1 disponibles

Añadir al carrito

Imagen de archivo

Villa, Tiziano; Kam, Timothy; Brayton, Robert K.; Sangiovanni-Vincentelli, Alberto L.
Publicado por Springer, 2012
ISBN 10: 1461378214 ISBN 13: 9781461378211
Nuevo Tapa blanda

Librería: Ria Christie Collections, Uxbridge, Reino Unido

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. In. Nº de ref. del artículo: ria9781461378211_new

Contactar al vendedor

Comprar nuevo

EUR 119,85
Convertir moneda
Gastos de envío: EUR 4,74
De Reino Unido a España
Destinos, gastos y plazos de envío

Cantidad disponible: Más de 20 disponibles

Añadir al carrito

Imagen de archivo

Tiziano Villa
Publicado por Springer-Verlag New York Inc., 2012
ISBN 10: 1461378214 ISBN 13: 9781461378211
Nuevo Paperback / softback
Impresión bajo demanda

Librería: THE SAINT BOOKSTORE, Southport, Reino Unido

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Paperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 588. Nº de ref. del artículo: C9781461378211

Contactar al vendedor

Comprar nuevo

EUR 139,27
Convertir moneda
Gastos de envío: EUR 8,57
De Reino Unido a España
Destinos, gastos y plazos de envío

Cantidad disponible: Más de 20 disponibles

Añadir al carrito

Imagen de archivo

Villa, Tiziano; Kam, Timothy; Brayton, Robert K.; Sangiovanni-Vincentelli, Alberto L.
Publicado por Springer, 2012
ISBN 10: 1461378214 ISBN 13: 9781461378211
Nuevo Tapa blanda

Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. Nº de ref. del artículo: ABLIING23Mar2716030034248

Contactar al vendedor

Comprar nuevo

EUR 105,79
Convertir moneda
Gastos de envío: EUR 66,16
De Estados Unidos de America a España
Destinos, gastos y plazos de envío

Cantidad disponible: Más de 20 disponibles

Añadir al carrito

Imagen del vendedor

Tiziano Villa
ISBN 10: 1461378214 ISBN 13: 9781461378211
Nuevo Taschenbuch

Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Taschenbuch. Condición: Neu. Neuware -Synthesis of Finite State Machines: Logic Optimization is the second in a set of two monographs devoted to the synthesis of Finite State Machines (FSMs). The first volume, Synthesis of Finite State Machines: Functional Optimization, 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.Synthesis of Finite State Machines: Logic Optimization will be of interest to researchers and professional engineers who work in the area of computer-aided design of integrated circuits.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 400 pp. Englisch. Nº de ref. del artículo: 9781461378211

Contactar al vendedor

Comprar nuevo

EUR 160,49
Convertir moneda
Gastos de envío: EUR 35,00
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: 2 disponibles

Añadir al carrito

Imagen de archivo

Villa, Tiziano, Kam, Timothy, Brayton, Robert K., Sangiovann
Publicado por Springer, 2012
ISBN 10: 1461378214 ISBN 13: 9781461378211
Antiguo o usado Paperback

Librería: Mispah books, Redhill, SURRE, Reino Unido

Calificación del vendedor: 4 de 5 estrellas Valoración 4 estrellas, Más información sobre las valoraciones de los vendedores

Paperback. Condición: Like New. Like New. book. Nº de ref. del artículo: ERICA79614613782146

Contactar al vendedor

Comprar usado

EUR 168,20
Convertir moneda
Gastos de envío: EUR 29,80
De Reino Unido a España
Destinos, gastos y plazos de envío

Cantidad disponible: 1 disponibles

Añadir al carrito