Synthesis of asynchronous circuits - testing unique circuit behavior of signal transition graphs

Calvin J A Hsia, Chien Yi Roger Chen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

An important work related to the synthesis of asynchronous circuits from a signal transition graph (STG) specification is studied in this paper. The work is to test the satisfaction of one-token restriction. The one-token restriction is essential for an STG to avoid possible ambiguity in a behavioral specification. A graph reduction method which uses five reduction operations: series, parallel, unique-cycle, group-collapse, and conflict-block reductions, is proposed to achieve the task. Experimental results show that our proposed techniques are also very efficient for STGs of very large sizes.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
Editors Anon
PublisherIEEE Computer Society
Pages1074-1077
Number of pages4
Volume2
StatePublished - 1995
EventProceedings of the 1995 IEEE International Symposium on Circuits and Systems-ISCAS 95. Part 3 (of 3) - Seattle, WA, USA
Duration: Apr 30 1995May 3 1995

Other

OtherProceedings of the 1995 IEEE International Symposium on Circuits and Systems-ISCAS 95. Part 3 (of 3)
CitySeattle, WA, USA
Period4/30/955/3/95

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Electronic, Optical and Magnetic Materials

Fingerprint Dive into the research topics of 'Synthesis of asynchronous circuits - testing unique circuit behavior of signal transition graphs'. Together they form a unique fingerprint.

  • Cite this

    Hsia, C. J. A., & Chen, C. Y. R. (1995). Synthesis of asynchronous circuits - testing unique circuit behavior of signal transition graphs. In Anon (Ed.), Proceedings - IEEE International Symposium on Circuits and Systems (Vol. 2, pp. 1074-1077). IEEE Computer Society.