Browse by author
Lookup NU author(s): Dr Victor Khomenko
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling edges of signals. One of the crucial problems in the synthesis of such circuits is deriving the set and reset covers for the state-holding elements implementing each output signal of the circuit. The derived covers must satisfy certain correctness constraints, in particular the Monotonic Cover condition must hold for the standard-C implementation. The covers are usually derived using state graphs. In this paper, we avoid constructing the state graph of an STG, which can lead to state space explosion, and instead use a finite and complete prefix of its unfolding. We propose an efficient algorithm for deriving the set and reset covers for the standard-C implementation based on the Incremental Boolean Satisfiability (SAT) approach. Experimental results show that this technique leads not only to huge memory savings when compared with the methods based on state graphs, but also to significant speedups in many cases, without affecting the quality of the solution. © 2008 IEEE.
Author(s): Khomenko V
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: 14th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC)
Year of Conference: 2008
Pages: 141-150
Date deposited: 28/05/2010
Publisher: IEEE
URL: http://dx.doi.org/10.1109/ASYNC.2008.12
DOI: 10.1109/ASYNC.2008.12
Library holdings: Search Newcastle University Library for this item
ISBN: 9780769531076
