Synthesis of four-phase asynchronous control circuits from pipeline dependency graphs

H. Kagotani, T. Okamoto, T. Nanya

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

    1 Citation (Scopus)

    Abstract

    We propose a method of synthesizing pipeline controllers as four-phase asynchronous circuits from specifications described as two-phase dependency graphs. Pipeline two-phase dependency graphs are transformed into four-phase ones by applying a transformation rule to each simple loop in the graphs. Four-phase dependency graphs are easily mapped onto four-phase asynchronous control circuits. We also discuss some simplification of four-phase dependency graphs.

    Original languageEnglish
    Title of host publicationProceedings of the ASP-DAC 2001
    Subtitle of host publicationAsia and South Pacific Design Automation Conference 2001
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages425-430
    Number of pages6
    ISBN (Electronic)0780366336
    DOIs
    Publication statusPublished - Jan 1 2001
    EventAsia and South Pacific Design Automation Conference 2001, ASP-DAC 2001 - Yokohama, Japan
    Duration: Jan 30 2001Feb 2 2001

    Publication series

    NameProceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC
    Volume2001-January

    Other

    OtherAsia and South Pacific Design Automation Conference 2001, ASP-DAC 2001
    Country/TerritoryJapan
    CityYokohama
    Period1/30/012/2/01

    Keywords

    • Asynchronous circuits
    • Circuit synthesis
    • Communication networks
    • Communication system control
    • Electronic mail
    • Hardware
    • Logic circuits
    • Network synthesis
    • Pipelines
    • Writing

    ASJC Scopus subject areas

    • Computer Science Applications
    • Computer Graphics and Computer-Aided Design
    • Electrical and Electronic Engineering

    Fingerprint

    Dive into the research topics of 'Synthesis of four-phase asynchronous control circuits from pipeline dependency graphs'. Together they form a unique fingerprint.

    Cite this