Structural Simplification and Decomposition of Asynchronous Sequential Circuits
In this paper, we extend the partition theory developed by Hartmanis and Stearns for synchronous sequential circuits to asynchronous sequential circuits. A method which utilizes the concept of partition pairs to obtain single transition time asynchronous state assignments with reduced dependence is...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on computers 1969-09, Vol.C-18 (9), p.830-838 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In this paper, we extend the partition theory developed by Hartmanis and Stearns for synchronous sequential circuits to asynchronous sequential circuits. A method which utilizes the concept of partition pairs to obtain single transition time asynchronous state assignments with reduced dependence is presented. Parallel and serial decompositions of asynchronous sequential circuits are also considered. Single transition time and multiple transition time serial decompositions are discussed and procedures for obtaining such decompositions are presented. |
---|---|
ISSN: | 0018-9340 1557-9956 |
DOI: | 10.1109/T-C.1969.222780 |