Advertisement

Synthesis of Finite State Machines

Functional Optimization

  • Timothy Kam
  • Tiziano Villa
  • Robert Brayton
  • Alberto Sangiovanni-Vincentelli

Table of contents

  1. Front Matter
    Pages i-xiii
  2. Preliminaries

    1. Front Matter
      Pages 1-1
    2. Timothy Kam, Tiziano Villa, Robert Brayton, Alberto Sangiovanni-Vincentelli
      Pages 3-10
    3. Timothy Kam, Tiziano Villa, Robert Brayton, Alberto Sangiovanni-Vincentelli
      Pages 11-35
    4. Timothy Kam, Tiziano Villa, Robert Brayton, Alberto Sangiovanni-Vincentelli
      Pages 37-70
  3. State Minimization of Incompletely Specified FSMs

    1. Front Matter
      Pages 71-71
    2. Timothy Kam, Tiziano Villa, Robert Brayton, Alberto Sangiovanni-Vincentelli
      Pages 73-113
    3. Timothy Kam, Tiziano Villa, Robert Brayton, Alberto Sangiovanni-Vincentelli
      Pages 115-173
  4. Flexibility in Networks of FSMs and Non-Deterministic FSMs

    1. Front Matter
      Pages 175-175
    2. Timothy Kam, Tiziano Villa, Robert Brayton, Alberto Sangiovanni-Vincentelli
      Pages 177-218
    3. Timothy Kam, Tiziano Villa, Robert Brayton, Alberto Sangiovanni-Vincentelli
      Pages 219-242
    4. Timothy Kam, Tiziano Villa, Robert Brayton, Alberto Sangiovanni-Vincentelli
      Pages 243-262
    5. Timothy Kam, Tiziano Villa, Robert Brayton, Alberto Sangiovanni-Vincentelli
      Pages 263-266
  5. Back Matter
    Pages 267-282

About this book

Introduction

Synthesis of Finite State Machines: Functional Optimization is one of two monographs devoted to the synthesis of Finite State Machines (FSMs). This volume addresses functional optimization, whereas the second addresses logic optimization. By functional optimization here we mean the body of techniques that:
  • compute all permissible sequential functions for a given topology of interconnected FSMs, and
  • select a `best' sequential function out of the permissible ones.

The result is a symbolic description of the FSM representing the chosen sequential function. By logic optimization here we mean the steps that convert a symbolic description of an FSM into a hardware implementation, with the goal to optimize objectives like area, testability, performance and so on.
Synthesis of Finite State Machines: Functional Optimization is divided into three parts. The first part presents some preliminary definitions, theories and techniques related to the exploration of behaviors of FSMs. The second part presents an implicit algorithm for exact state minimization of incompletely specified finite state machines (ISFSMs), and an exhaustive presentation of explicit and implicit algorithms for the binate covering problem. The third part addresses the computation of permissible behaviors at a node of a network of FSMs and the related minimization problems of non-deterministic finite state machines (NDFSMs).
Key themes running through the book are the exploration of behaviors contained in a non-deterministic FSM (NDFSM), and the representation of combinatorial problems arising in FSM synthesis by means of Binary Decision Diagrams (BDDs).
Synthesis of Finite State Machines: Functional Optimization will be of interest to researchers and designers in logic synthesis, CAD and design automation.

Keywords

Hardware algorithms automation computer-aided design (CAD) design automation interconnect logic network networks optimization stability

Authors and affiliations

  • Timothy Kam
    • 1
  • Tiziano Villa
    • 2
  • Robert Brayton
    • 2
  • Alberto Sangiovanni-Vincentelli
    • 2
  1. 1.Intel CorporationUSA
  2. 2.University of CaliforniaBerkeleyUSA

Bibliographic information

Industry Sectors
Automotive
Biotechnology
Electronics
IT & Software
Telecommunications
Energy, Utilities & Environment
Aerospace
Oil, Gas & Geosciences
Engineering