Synthesis of asynchronous circuits from signal transition graph specifications

被引:0
作者
Park, SB
Nanya, T
机构
[1] Univ of California at San Diego, La Jolla, United States
来源
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | 1997年 / E80D卷 / 03期
关键词
asynchronous synthesis; logic synthesis; signal transition graphs; Petri nets; speed-independent circuits;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper proposes a synthesis method to obtain speed-independent asynchronous circuits directly from signal transition graph (STG) specifications with single cycle signals which can be non-persistent and have free-choice operations. The resulting circuits are implemented with basic gates and asynchronous latches, and operate correctly under finite but unbounded gate delays and the zero wire delay assumptions. The proposed method introduces 5 types of lock relations to implement a non-persistent STG. A non-persistent STG can be implemented if every non-persistent signal to a signal t is super-locked with t. The resulting circuits are optimized by extracting of literals, mapping onto asymmetric C-elements, etc. Experimental results show that the proposed synthesis method outperforms the existing synthesis systems such as SYN and SIS.
引用
收藏
页码:326 / 335
页数:10
相关论文
共 22 条
[21]  
YKMANCOUVREUR C, 1995, ASSASSIN SYNTHESIS S
[22]  
YUN KY, 1994, THESIS STANFORD U