摘 要 i
ABSTRACT iii
誌 謝 iv
List of Figures vii
List of Tables x
Chapter 1. Introduction 1
1.1 Background 1
1.2 Review of Previous Technique 3
1.2.1 Congestion Estimation Model 3
1.2.2 Cell Reordering by Net Direction 6
1.2.3 Wirelength Minimization 7
1.2.4 Legalization 14
1.3 Contribution 16
Chapter 2. Problem Formulation and Overview of Our Algorithm 17
2.1 Problem Formulation 17
2.2 Placement Initialization 18
Chapter 3. Routability-Driven Placement Algorithm 20
3.1 Routability Optimization 20
3.2 Bin Density Mitigation 21
3.3 BinResize and Cell Redistribution 22
3.3.1 Bin Resizing Constraints 22
3.3.2 Linear Expansion 25
3.3.3 Cell Redistribution 28
3.3.4 Congestion Mitigation Cell Redistribution 28
3.4 Review of the Whole Design Flow 30
Chapter 4. Experimental Result 32
Chapter 5. Conclusion 38
REFERENCES 39
|