Proceedings of the ASP-DAC '99 Asia and South Pacific Design Automation Conference 1999 (Cat. No.99EX198) 1999
DOI: 10.1109/aspdac.1999.759775
|View full text |Cite
|
Sign up to set email alerts
|

Clock period minimization of semi-synchronous circuits by gate-level delay insertion

Abstract: A semi-synchronous circuit is a circuit in which every register is ticked by a clock periodically, but not necessarily simultaneously. A feature of semi-synchronous circuits is that the minimum delay between registers may be critical with respect to the clock period of the circuit. In this paper, we discuss a delay insertion method which makes such a semi-synchronous circuit faster. The maximum delay-to-register ratio of the cycles on the circuit gives a lower bound of the clock period. We show that this bound… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
24
0

Year Published

2005
2005
2009
2009

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 10 publications
(24 citation statements)
references
References 10 publications
0
24
0
Order By: Relevance
“…Step 1 : Determine T L (G) from the constraint graph consisting of Z-edges ( [10]). If T S (G) = T L (G), a critical-cycle which consists of only Z-edges exists in the constraint graph [9]. So, if T S (G) = T L (G), the proposed method cannot improve the minimum clock period in g-frame since no target register exists on the critical-cycle.…”
Section: Inputs : Circuit G Outputs : Circuit Obtained By Target Conementioning
confidence: 99%
See 2 more Smart Citations
“…Step 1 : Determine T L (G) from the constraint graph consisting of Z-edges ( [10]). If T S (G) = T L (G), a critical-cycle which consists of only Z-edges exists in the constraint graph [9]. So, if T S (G) = T L (G), the proposed method cannot improve the minimum clock period in g-frame since no target register exists on the critical-cycle.…”
Section: Inputs : Circuit G Outputs : Circuit Obtained By Target Conementioning
confidence: 99%
“…Since the minimum clock Proof. If T S (G) = T L (G), a critical-cycle which consists of only Z-edges exists in H(G) [9]. Since a critical-cycle which consists of only Z-edges contains no target register, the critical-cycle is a maximal critical-cycle.…”
Section: Inputs : Circuit G Outputs : Circuit Obtained By Target Conementioning
confidence: 99%
See 1 more Smart Citation
“…Therefore, the optimization of circuit synthesis that takes g-frame into account must be investigated. In this paper, we focus on delay insertion methods [6]- [9]. Even though we do not consider the detailed delay insertion methods, the delay insertion will be realized by replacing a large module with a small module synthesized under looser delay constraints, by using smaller transistors and narrower wires, and by deleting buffers from long interconnects, as well as by inserting buffers to short interconnects.…”
Section: Introductionmentioning
confidence: 99%
“…In [6], a delay insertion method that minimizes the clock period was proposed. Since the amount of an inserted delay is iteratively determined by searching the whole circuit, the method takes too much computation time.…”
Section: Introductionmentioning
confidence: 99%