Proceedings of the 19th ACM Great Lakes Symposium on VLSI 2009
DOI: 10.1145/1531542.1531624
|View full text |Cite
|
Sign up to set email alerts
|

Timing-driven N-way decomposition

Abstract: Logic decomposition has been extensively used to optimize the worst-case delay and the area in the technology independent phase. Bi-decomposition is one of the state-of-art techniques to reduce the depth of the netlist due to the affordable computational cost. We present a novel n-way decomposition technique that improves bi-decomposition. The problem of decomposition is formulated as a Boolean relation which captures a larger set of possible solutions compared to bi-decomposition. The solution obtained from t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…1) The sum of squares of the BDD sizes [31], targeting a balanced solution, which favors delay reduction.…”
Section: A Cost Functionmentioning
confidence: 99%
“…1) The sum of squares of the BDD sizes [31], targeting a balanced solution, which favors delay reduction.…”
Section: A Cost Functionmentioning
confidence: 99%
“…1. The sum of squares of the BDD sizes [10], targeting a balanced solution, which favors delay reduction.…”
Section: Cost Functionmentioning
confidence: 99%