Title :
Race-free state assignments using bipartite graphs
Author :
Kang, Jun-Woo ; Wey, Chin-Long ; Fisher, P. David
Author_Institution :
Dept. of Electr. Eng., Michigan State Univ., East Lansing, MI, USA
Abstract :
The authors present a race-free state assignment algorithm which maps a bipartite adjacency diagram (BAT) to an n-cube. With the bipartite representation table (BRT) for an n-cube, the problem of embedding of a BAT in an n-cube is equivalent to that of matching the patterns of the BAT and the BRT. Based on the special characteristics of the BAT, several matching rules are presented to solve the problem. Experimental results have shown that the algorithm is better than existing algorithms in terms of compute time, particularly for encoding states of large asynchronous sequential logic circuits
Keywords :
asynchronous circuits; asynchronous sequential logic; graph theory; hazards and race conditions; logic design; pattern matching; state assignment; bipartite adjacency diagram; bipartite graphs; bipartite representation table; compute time; large asynchronous sequential logic circuits; matching rules; n-cube; race-free state assignment algorithm; Analytical models; Bipartite graph; Circuit synthesis; Encoding; Hypercubes; Merging; Partitioning algorithms; Pattern matching; Sequential circuits; Visualization;
Conference_Titel :
Circuits and Systems, 1993., ISCAS '93, 1993 IEEE International Symposium on
Conference_Location :
Chicago, IL
Print_ISBN :
0-7803-1281-3
DOI :
10.1109/ISCAS.1993.394288
