Proceedings of 1993 International Conference on Computer Aided Design (ICCAD)
DOI: 10.1109/iccad.1993.580073
|View full text |Cite
|
Sign up to set email alerts
|

Retiming gated-clocks and precharged circuit structures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 2 publications
0
3
0
Order By: Relevance
“…The OV 2 di erence constraints speci ed by Inequalities 3 and 8 can be computed in OV E + V 2 lg V steps by an all-pairs shortest-paths algorithm and can be solved in OV 3 steps by a Bellman-Ford algorithm for single-source shortest-paths. An asymptotically more e cient procedure that solves these constraints in OV E steps has been presented in 8 .…”
Section: Preliminariesmentioning
confidence: 99%
“…The OV 2 di erence constraints speci ed by Inequalities 3 and 8 can be computed in OV E + V 2 lg V steps by an all-pairs shortest-paths algorithm and can be solved in OV 3 steps by a Bellman-Ford algorithm for single-source shortest-paths. An asymptotically more e cient procedure that solves these constraints in OV E steps has been presented in 8 .…”
Section: Preliminariesmentioning
confidence: 99%
“…Thus, a retiming approach should be able to move registers together with their load enables across logic blocks. This problem was addressed in [1] and [6]. Camposano and Plöger [1] stated several conditions for a valid retiming step involving load enable registers.…”
Section: Introductionmentioning
confidence: 99%
“…If the gated clock latches are marked as latches that caimot be moved, then the gated clock structure is preserved; however, optimality may be sacrificed. A better approach can be obtained by developing the techniques in [45].…”
Section: Some Of These Restrictions Arementioning
confidence: 99%