Abstract:
This paper presents theory and practical implementation of a method for multi-level logic synthesis of speedindependent circuits. An initial circuit implementation is assumed to satisfy the monotonous cover conditions but is technology independent. The proposed method performs both combinational (inserting new gates) and sequential (inserting new memory elements) decomposition of complex gates in a given standard cell library, while preserving original behaviour and speed-independence. The algorithm applies known efficient algebraic factorization techniques from combinational multi-level logic synthesis, but achieves also boolean simplification and sequential decomposition. The method allows sharing of decomposed logic. 1
Citations
|
97
|
Multilevel logic synthesis
– Brayton, Hachtel, et al.
|
|
83
|
A theory of asynchronous circuits
– Muller, Bartky, et al.
- 1959
|
|
73
|
Automatic Gate- Level Synthesis of Speed-Independent Circuits
– Beerel, Meng
- 1992
|
|
70
|
Algorithms for Synthesis and Testing of Asynchronous Circuits
– Lavagno, Sangiovanni-Vincentelli
- 1993
|
|
44
|
Basic gate implementation of speed-independent circuits
– Kondratyev, Kishinevsky, et al.
- 1994
|
|
43
|
A generalized state assignment theory for transformations on signal transition graphs
– Vanbekbergen, Lin, et al.
- 1992
|
|
35
|
General conditions for the decomposition of state holding elements
– Burns
- 1996
|
|
30
|
Automatic technology mapping for generalized fundamental-mode asynchronous designs
– Siegel, Micheli, et al.
- 1993
|
|
24
|
Structural methods for the synthesis of speed-independent circuits
– Pastor, Cortadella, et al.
- 1998
|
|
22
|
Complete state encoding based on the theory of regions
– Cortadella, Kishinevsky, et al.
- 1996
|
|
22
|
Decomposition and technology mapping of speed-independent circuits using Boolean relations
– Cortadella, Kishinevsky, et al.
- 1997
|
|
16
|
Decomposition methods for library binding of speed-independent asynchronous designs
– Siegel, Micheli
- 1994
|
|
12
|
A synthesis method for self-timed VLSI circuits
– Burns, Martin
- 1987
|
|
9
|
Logic transformations and observability don't cares in speed-independent circuits
– Beerel, Meng
- 1993
|
|
7
|
Externally hazard-free implementations of asynchronous control circuits
– Sawasaki, Ykman, et al.
- 1997
|
|
3
|
Technology mapping of timed circuits
– Myers, Beerel, et al.
- 1995
|
|
1
|
Technology mapping of speedindependentcircuits basedoncombinational decomposition and resynthesis
– Cortadella, Kishinevsky, et al.
- 1997
|
|
