This paper presents a unified synthesis method for dealing with generalized asynchronous circuits which comprise specifications of both Asynchronous Finite State Machines (AFSMs) and Signal Transition Graphs (STGs). By comparing the similarities and differences of two different synthesis methods, we describe algorithms and techniques underlying our CAD system for automating the design of the generalized asynchronous circuits based on the well-developed synthesis procedures of Huffman-modeled asynchronous circuits. Experimental results show that the developed system, implemented in C, can handle concurrence and sequencing of STGs and fundamental mode operation of AFSMs at the same time, therefore, it allows for a more natural and compact specification of asynchronous behavior.
|Number of pages||4|
|Journal||Proceedings - IEEE International Symposium on Circuits and Systems|
|Publication status||Published - 1996 Jan 1|
|Event||Proceedings of the 1996 IEEE International Symposium on Circuits and Systems, ISCAS. Part 1 (of 4) - Atlanta, GA, USA|
Duration: 1996 May 12 → 1996 May 15
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering