A realization algorithm of asynchronous circuits from STG
Resource
Design Automation, 1992. Proceedings. [3rd] European Conference on
Journal
Design Automation, 1992. Proceedings. [3rd] European Conference on
Pages
-
Date Issued
1992-03
Date
1992-03
Author(s)
Lin, Kuan-Jen
Lin, Chen-Shang
DOI
N/A
Abstract
The synthesis of asynchronous circuits from the behavioral descriptions in signal transition graphs (STG) is studied. A new realization algorithm is proposed to synthesize asynchronous circuits directly from STGs and thereby to maintain the problem size proportional to the signal number only. In previous methods, the state diagram was involved in the synthesis, which has a worst-case size exponential to the signal number. Based on the transitive lock relation, the authors' realization algorithm is shown to realize a one-level circuit when the given STG is L/sup t2/. The simple one-level realization ensures that the realized circuit is hazard-free under the gate delay model without any post-realization modification.>
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
00205946.pdf
Size
347.51 KB
Format
Adobe PDF
Checksum
(MD5):6df9a5e7a0c1eb2e1e20a3fec46dbc26