2022
DOI: 10.29292/jics.v17i3.645
|View full text |Cite
|
Sign up to set email alerts
|

VLSI Placement Optimization Algorithms

Abstract: Placement is a fundamental optimization step to compute cell locations. The quality of results in Clock Tree Synthesis (CTS) and routing stages is impacted by the placement solution. The placement optimization flow is split into (1)global placement, (2) legalization, and (3) detailed placement. In global placement, cell locations are computed to minimize total wire length subject to a maximum cell density threshold. The cell overlapping and cell alignment to site row boundaries are relaxed. In legalization, ce… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 92 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?