Loading...
Please wait, while we are loading the content...
Similar Documents
A novel framework for solving the state assignment problem for event-based specifications.
| Content Provider | CiteSeerX |
|---|---|
| Author | Lavagno, Luciano Moon, Cho W. Brayton, Robert K. Sangiovanni-Vincentelli, Alberto |
| Abstract | We propose a novel framework to solve the state assignment problem arising from the signal transition graph (STG) representation of an asynchronous circuit. We first establish a relation between STGs and finite state machines (FSMs). Then we solve the STG state assignment problem by minimizing the number of states in the corresponding FSM and by using a critical race-free state assignment technique. State signal transitions may be added to the original STG. A lower bound on the number of signals necessary to implement the STG is given. Our technique significantly increases the STG applicability as a specification for asynchronous circuits. 1 Introduction Asynchronous circuits are playing an increasingly important role in digital designs for two main reasons: 1. Interface circuits, which are inevitably asynchronous, are becoming a bottleneck in the design process. The overall system throughput depends heavily on interface circuits, but unlike data paths or synchronous controllers they ... |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Novel Framework State Assignment Problem Event-based Specification Interface Circuit Asynchronous Circuit Overall System Critical Race-free State Assignment Technique Stg Applicability Synchronous Controller Introduction Asynchronous Circuit Main Reason Signal Transition Graph Finite State Machine Original Stg Digital Design Stg State Assignment Problem Design Process Data Path Corresponding Fsm Important Role State Signal Transition |
| Content Type | Text |
