| 摘要 |
<P>PROBLEM TO BE SOLVED: To automatically search for, concerning a program for creating a wiring path for wiring one driver and two or more drivers, a wiring path whose total wiring length becomes the minimum, and to, when the several wiring paths mentioned above are present, search for a wiring path whose maximum inter-DR wiring length becomes the smallest among those wiring paths. <P>SOLUTION: As for two or more vectors going from a driver to each receiver, the duplicate length of a vector pair configured of arbitrary two vectors is calculated, and the vector pair whose duplicate length is the maximum is defined as a selection vector pair. As for the selection vector pair, three types of connection points for commonizing the selection vector pair until the middle are created so that the vectors can be commonized, and three types of vector patterns are obtained. The above mentioned operation is repeated, and when the commonization of the vectors ends, each vector pattern is determined as a connection candidate. The connection candidate whose total wiring length is the minimum among the connection candidates is determined as an optimal wiring path. When the several optimal wiring paths mentioned above are present, the optimal wiring path whose maximum inter-DR wiring length is the smallest is determined as the optimal wiring path. <P>COPYRIGHT: (C)2012,JPO&INPIT |
