An efficient heuristic procedure for solving the state assignment problem for event-based specifications
In: IEEE transactions on computer-aided design of integrated circuits and systems, Jg. 14 (1995), Heft 1, S. 45-60
Online
academicJournal
- print, 27 ref
Zugriff:
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 STG's and finite state machines (FSM's). 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.
Titel: |
An efficient heuristic procedure for solving the state assignment problem for event-based specifications
|
---|---|
Autor/in / Beteiligte Person: | LAVAGNO, L ; MOON, C. W ; BRAYTON, R. K ; SANGIOVANNI-VINCENTELLI, A. L |
Link: | |
Zeitschrift: | IEEE transactions on computer-aided design of integrated circuits and systems, Jg. 14 (1995), Heft 1, S. 45-60 |
Veröffentlichung: | New York, NY: Institute of Electrical and Electronics Engineers, 1995 |
Medientyp: | academicJournal |
Umfang: | print, 27 ref |
ISSN: | 0278-0070 (print) |
Schlagwort: |
|
Sonstiges: |
|