Efficient state assignment framework for asynchronous state graphs
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636404,p. 692-697
- https://doi.org/10.1109/iccd.1995.528943
Abstract
This paper presents a new efficient state assignment framework for synthesizing asynchronous state graphs. This framework operates purely at the state graph level and is applicable to a broad class of behaviors. In this paper we focus the framework for solving the complete state coding problem. This method has been automated and applied to a large set of asynchronous circuits. It achieves significant improvements in terms of both circuit area and computation time.Keywords
This publication has 15 references indexed in Scilit:
- Sequential circuit design using synthesis and optimizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Polynomial algorithms for the synthesis of hazard-free circuits from signal transition graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A generalized signal transition graph model for specification of complex interfacesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Area efficient synthesis of asynchronous interface circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Optimized synthesis of asynchronous control circuits from graph-theoretic specificationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Externally hazard-free implementations of asynchronous circuitsPublished by Association for Computing Machinery (ACM) ,1995
- A generalized state assignment theory for transformations on signal transition graphsJournal of Signal Processing Systems, 1994
- Basic gate implementation of speed-independent circuitsPublished by Association for Computing Machinery (ACM) ,1994
- A modular partitioning approach for asynchronous circuit synthesisPublished by Association for Computing Machinery (ACM) ,1994
- A Linear-Time Heuristic for Improving Network PartitionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982