A Spare Cell Selection Algorithm for Functional Change
Date Issued
2009
Date
2009
Author(s)
Chang, Tian-Bao
Abstract
The modern IC design complexity is getting higher and higher, resulting in more and more bugs discovered after placement. These bugs can be fixed by chip design revisions. Such functional changes on chip design can be realized by spare cells. Since the spare cells are limited, they should be used more efficiently. We propose a spare cell selection algorithm to complete the functional changes and generate the revised netlist with the minimum total wiring cost of all nets. There are three phase in the algorithm. In the first phase, we applied a circuit partition matching from ECO (Engineering Change Order) to find the relative spare cell types of every change. In the second phase, we used ILP (Integer Linear Programming) to choose the best spare cells selection after phase one. In the third phase, we connect the nets of spare cells and complete the functional change.
Subjects
Spare Cell
Functional Change
Integer Linear Programming
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-98-R96943107-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):2462dc4df03a201a0d26321f2c6dde1c