A Visual Approach for Asynchronous Circuit Synthesis

Authors:
Radhakrishna Nagalla;Graham Hellestrand
Affiliations:
-;-
Venue:
VLSID '97 Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications
Year:
1997

Citing 6
Cited 0

Automatic synthesis of asynchronous circuits

DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
A generalized state assignment theory for transformations on signal transition graphs

ICCAD '92 1992 IEEE/ACM international conference proceedings on Computer-aided design
Solving the state assignment problem for signal transition graphs

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
A modular partitioning approach for asynchronous circuit synthesis

DAC '94 Proceedings of the 31st annual Design Automation Conference
Signal transition graph constraints for synthesis of hazard-free asynchronous circuits with unbounded-gate delays

Formal Methods in System Design
Area Efficient Synthesis of Asynchronous Interface Circuits

ICCS '94 Proceedings of the1994 IEEE International Conference on Computer Design: VLSI in Computer & Processors

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a new approach for the synthesis of asynchronous interface circuits from the Signal Transition Graph (STG) specifications will be discussed. As a novel contribution we propose a visual path-oriented algorithm to ascertain whether a given STG has Complete State Coding (CSC) property. Unlike most of the existing algorithms which operate on a state graph, this algorithm operates on the STG. This approach has the advantage of being either easily automated or easier to visually correlate with the STG specifications and to perform by a paper and pencil. Experimental results with a large number of practical asynchronous bench marks are presented.