rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Synthesis of Finite State Machines
    sub title: Logic Optimization
  name:
    name part: Villa, Tiziano.
    role:
      role term: creator
  name:
    name part: Kam, Timothy.
  name:
    name part: Brayton, Robert K.
  name:
    name part: Sangiovanni-Vincentelli, Alberto.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  genre: Electronic books.
  origin info:
    place:
      place term: mau
    date issued: 1997
    issuance: monographic
  language:
    language term: eng
  physical description:
    reformatting quality: access
    form: remote
    extent: 1 online resource (xiii, 381 pages)
  abstract: 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 enc…
  note: by Tiziano Villa, Timothy Kam, Robert K. Brayton, Alberto Sangiovanni-Vincentelli.
  note: Electronic resource.
  subject:
    topic: Engineering
  subject:
    topic: Computer-aided design
  subject:
    topic: Computer engineering
  subject:
    topic: Systems engineering
  subject:
    topic: Computer-aided design
  subject:
    topic: Computer engineering
  subject:
    topic: Engineering
  subject:
    topic: Systems engineering
  classification: TK7888.4
  classification: 621.3815
  identifier: 9781461561552 (electronic bk.)
  identifier: 1461561558 (electronic bk.)
  identifier: 9781461378211
  identifier: 1461378214
  identifier: 1461561558
  identifier: http://proxy.library.tamu.edu/login
  record info:
    record content source: AU@
    record creation date: 121227
    record change date: 20260422222706.6
    record identifier: in00003570402
    language of cataloging:
      language term: eng