| 摘要 |
PROBLEM TO BE SOLVED: To provide a computing method for cabling difficulty which is quick in processing speed of computation and high in computing precision. SOLUTION: Hierarchical clustering is performed by sequentially grouping those who are interconnected with more numbers of networks to each cell of netlist (S1). Each network of the netlist is made to belong to any of hierarchies of the hierarchical clustering by making it belong to the n-th hierarchy when the group which contains collectively all cells connected to the network exists in each group of the n-th hierarchy and does not exist in each group of the (n-1)th hierarchy (S2). An estimated value of wiring length of each network of the above netlist is set a smaller value when the hierarchy to which the network belongs is lower rank (S3). The estimated value of the total wiring length of the netlist is calculated by totaling the estimated values of wiring length of each network of the netlist based on the setting (S4). A cabling difficulty level of the netlist is calculated by dividing the result of computation by circuit scale of the netlist (S5). COPYRIGHT: (C)2009,JPO&INPIT
|
