2004
DOI: 10.1109/tvlsi.2003.820527
|View full text |Cite
|
Sign up to set email alerts
|

Timing driven gate duplication

Abstract: Abstract-In the past few years, gate duplication has been studied as a strategy for cutset minimization in partitioning problems. This paper addresses the problem of delay optimization by gate duplication. We present an algorithm to solve the gate duplication problem. It traverses the network from primary outputs(PO) to primary inputs(PI) in topologically sorted order evaluating tuples at the input pins of gates. The tuple's first component corresponds to the input pin required time if that gate is not duplica… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
12
0

Year Published

2004
2004
2020
2020

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(12 citation statements)
references
References 27 publications
0
12
0
Order By: Relevance
“…Table 2 reports the circuit's area increase caused by gate duplication. As reported in [7], gate duplication will increase the area by 8.1% on average. In DUP PREWM, the area penalty gets reduced by up to 5.24% compared to the output of DUP EPSILON .…”
Section: Resultsmentioning
confidence: 87%
See 3 more Smart Citations
“…Table 2 reports the circuit's area increase caused by gate duplication. As reported in [7], gate duplication will increase the area by 8.1% on average. In DUP PREWM, the area penalty gets reduced by up to 5.24% compared to the output of DUP EPSILON .…”
Section: Resultsmentioning
confidence: 87%
“…In this section, we illustrate the proposed CAD tool and algorithm protection approach by developing pre-and post-processing techniques to protect a timing driven gate duplication algorithm [7].…”
Section: Protecting a Gate Duplication Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…We have integrated these architectures and implementations with novel power aware design methodologies and paradigms for synthesizing highly power optimized implementations. The overall results are given in ref [6] - [25].…”
Section: Power Efficient Architectures For Crypto-algorithmsmentioning
confidence: 99%