Automatic wiring device and its wiring method

Claim 2

An automatic wiring method for performing wiring processing between terminals that are circuit elements, according to the pattern on a coordinate plane surface for wiring arrangement with the circuit elements arranged thereon, in the wiring processing of a pattern design on an integrated circuit or a printed wiring board, comprising the steps of: first, performing initial wiring processing, on the coordinate plane surface for wiring arrangement to be processed, without permitting any wiring to be shorted; second, when there remains a terminal pair unconnected in the wiring processing by said first step, setting a cost value on every unit cell including the unit cells through which a connected wiring is going, excepting the unit cells on a given wiring prohibited area, of all the unit cells set on the coordinate plane surface for wiring arrangement, according to a predetermined rule that the cost value of the unit cell on the connected wiring in the vicinity of the terminals of the connected wiring is set larger than the cost values of any other unit cells; and third, deciding a wiring route by the cost-attached labyrinth method, using the cost values set by said second step, so as to perform wiring processing along the wiring route while peeling off another wiring in case of necessity, and if peeling off another wiring in the above wiring processing, performing rewiring processing for connecting a terminal pair getting unconnected owing to the wiring being peeled off; said second step of setting a cost value on each unit cell including the steps of: setting a cost value on each unit cell on a connected wiring in such a way that the largest cost value is set on the unit cell adjacent to a terminal of the connected wiring and that the cost value of the unit cell becomes smaller according as the unit cell is further away from the terminal, and setting on the other unit cells, the minimum of the cost values set on the above unit cells on the connected wiring or the smaller cost value.

Claim 3

An automatic wiring method as set forth in claim 1, wherein said second step of setting a cost value on each unit cell including a step of setting a cost value on each unit cell on a connected wiring in such a way that the largest cost value is set on the unit cell adjacent to a terminal of the connected wiring and that the cost value of the unit cell becomes smaller according as the unit cell is further away from the terminal, and setting on the other unit cells, the minimum of the cost values set on the above unit cells on the connected wiring or the smaller cost value, and a step of, when the degree of freedom on the possible direction to draw wiring from the terminal is restricted, multiplying the cost value of each unit cell on the connected wiring by a predetermined number so as to make the cost value larger according as the restriction becomes severer.

Claim 4

An automatic wiring method as set forth in claim 1, wherein said third step of peeling off another wiring so to perform wiring processing including a step of accumulating each cost value set by said second step, as for each unit cell existing on a route from one terminal to the other terminal of a terminal pair to be connected, and when there exist a plurality of routes, deciding a route having the minimum accumulated value as a wiring route for the terminal pair, by comparison among the accumulated cost value of each route, a step of carrying out wiring processing along the wiring route decided above, while peeling off another wiring that would be shorted by the wiring route, in the wiring processing, and a step of, as for a terminal pair getting unconnected by the wiring being peeled off, performing rewiring processing along the wiring route, as far as there exists a wiring route capable of detouring all the obstacles.

Claim 5

An automatic wiring method as set forth in claim 1, wherein said second step of setting a cost value on each unit cell including a step of setting a cost value on each unit cell on a connected wiring in such a way that the largest cost value is set on the unit cell adjacent to a terminal of the connected wiring and that the cost value of the unit cell becomes smaller according as the unit cell is further away from the terminal, and setting on the other unit cells, the minimum of the cost values set on the above unit cells on the connected wiring or the smaller cost value, and a step of, when the degree of freedom on the possible direction to draw wiring from the terminal is restricted, multiplying the cost value of each unit cell on the connected wiring by a predetermined number so as to make the cost value larger according as the restriction becomes severer, while said third step of peeling off another wiring so to perform wiring processing including a step of accumulating each cost value set by said second step, as for each unit cell existing on a route from one terminal to the other terminal of a terminal pair to be connected, and when there exist a plurality of routes, deciding a route having the minimum accumulated value as a wiring route for the terminal pair, by comparison among the accumulated cost value of each route, a step of carrying out wiring processing along the wiring route decided above, while peeling off another wiring that would be shorted by the wiring route, in the wiring processing, and a step of, as for a terminal pair getting unconnected by the wiring being peeled off, performing rewiring processing along the wiring route, as far as there exists a wiring route capable of detouring all the obstacles.

Claim 6

An automatic wiring device for use in a pattern design of an integrated circuit or a printed wiring board, for performing wiring processing between terminals that are circuit elements, according to the pattern on a coordinate plane surface for wiring arrangement with the circuit elements arranged thereon, comprising: an initial wiring means for performing initial wiring processing, on said coordinate plane surface for wiring arrangement to be processed, without permitting any wiring to be shorted; a short cost value setting means for setting a cost value on each unit cell arranged on said coordinate plane surface for wiring arrangement, on the basis of a predetermined rule, when there remains a terminal pair unconnected in the wiring processing by said initial wiring means; a peeling and rewiring means for deciding a wiring route by the cost-attached labyrinth method, using the cost values set by said short cost value setting means, so as to perform wiring processing along the wiring route while peeling off another wiring in case of necessity, and if peeling off another wiring in the above wiring processing, performing rewiring processing for connecting a terminal pair getting unconnected owing to the wiring being peeled off; wherein said short cost value setting means sets a cost value on every unit cell including the unit cells through which a connected wiring is going, excepting the unit cells on a given wiring prohibited area, in such a way that the cost value of the unit cell on the connected wiring in the vicinity of the terminals of the connected wiring is set larger than the cost values of any other unit cells, wherein said short cost setting means: sets a cost value on each unit cell on a connected wiring in such a way that the largest cost value is set on the unit cell adjacent to a terminal of the connected wiring and that the cost value of the unit cell becomes smaller according as the unit cell is further away from the terminal, and sets on the other unit cells, the minimum of the cost values set on the above unit cells on the connected wiring or the smaller cost value.

Claim 7

An automatic wiring device for use in a pattern design of an integrated circuit or a printed wiring board, for performing wiring processing between terminals that are circuit elements, according to the pattern on a coordinate plane surface for wiring arrangement with the circuit elements arranged thereon, comprising: an initial wiring means for performing initial wiring processing, on said coordinate plane surface for wiring arrangement to be processed, without permitting any wiring to be shorted; a short cost value setting means for setting a cost value on each unit cell arranged on said coordinate plane surface for wiring arrangement, on the basis of a predetermined rule, when there remains a terminal pair unconnected in the wiring processing by said initial wiring means; a peeling and rewiring means for deciding a wiring route by the cost-attached labyrinth method, using the cost values set by said short cost value setting means, so as to perform wiring processing along the wiring route while peeling off another wiring in case of necessity, and if peeling off another wiring in the above wiring processing, performing rewiring processing for connecting a terminal pair getting unconnected owing to the wiring being peeled off; wherein said short cost value setting means sets a cost value on every unit cell including the unit cells through which a connected wiring is going, excepting the unit cells on a given wiring prohibited area, in such a way that the cost value of the unit cell on the connected wiring in the vicinity of the terminals of the connected wiring is set larger than the cost values of any other unit cells, wherein said short cost setting means: sets a cost value on each unit cell on a connected wiring in such a way that the largest cost value is set on the unit cell adjacent to a terminal of the connected wiring and that the cost value of the unit cell becomes smaller according as the unit cell is further away from the terminal, and sets on the other unit cells, the minimum of the cost values set on the above unit cells on the connected wiring or the smaller cost value.

Claim 8

An automatic wiring device as set forth in claim 5, wherein said short cost setting means further sets a cost value on each unit cell on a connected wiring in such a way that the gradient between the cost values of the unit cells becomes sharper according as the unit cell is nearer to the terminal.

Claim 9

An automatic wiring device as set for the in claim 5, wherein said short cost setting means further sets a cost value on each unit cell on a connected wiring in such a way that when the degree of freedom on the possible direction to draw wiring from the terminal is restricted, multiplies the cost value of each unit cell on the connected wiring by a predetermined number so as to make the cost value larger according as the restriction becomes more severe.

Claim 10

An automatic wiring device as set forth in claim 5, wherein said short cost setting means sets a cost value on each unit cell on a connected wiring in such a way that the largest cost value is set on the unit cell adjacent to a terminal of the connected wiring and that the cost value of the unit cell becomes smaller according as the unit cell is further away from the terminal, when the degree of freedom on the possible direction to draw wiring from the terminal is restricted, multiplies the cost value of each unit cell on the connected wiring by the number of "1" larger than the restricted number from all originally possible direction to draw wiring, and sets on the other unit cells, the minimum of the cost values set on the above unit cells on the connected wiring or the smaller cost value.

Claim 11

An automatic wiring device as set forth in claim 5, wherein said peeling and rewiring means accumulates each cost value set by said short cost value setting means, as for each unit cell existing on a route from one terminal to the other terminal of a terminal pair to be connected, and when there exist a plurality of routes, decides a route having the minimum accumulated value as a wiring route for the terminal pair, by comparison among the accumulated cost value of each route, carries out wiring processing along the wiring route decided above, while peeling off another wiring that would be shorted by the wiring route, in the wiring processing, and as for a terminal pair getting unconnected by the wiring being peeled off, performs rewiring processing along the wiring route, as far as there exists a wiring route capable of detouring all the obstacles.

Claim 12

A COMPUTER READABLE MEMORY storing a computer program controlling an automatic wiring device realized by a computer system, for use in a pattern design of an integrated circuit or a printed wiring board, for performing wiring processing between terminals that are circuit elements according to the pattern on a coordinate plane surface for wiring arrangement with the circuit elements arranged thereon, said computer program comprising: a first step of performing initial wiring processing, on the coordinate plane surface for wiring arrangement to be processed, without permitting any wiring to be shorted; a second step of, when there remains a terminal pair unconnected in the wiring processing by said first step, setting a cost value on every unit cell including the unit cells through which a connected wiring is going, excepting the unit cells on a given wiring prohibited area, of all the unit cells set on the coordinate plane surface for wiring arrangement, according to a predetermined rule that the cost value of the unit cell on the connected wiring in the vicinity of the terminals of the connected wiring is set larger than the cost values of any other unit cells; and a third step of deciding a wiring route by the cost-attached labyrinth method, using the cost value set by said second step, so as to perform wiring processing along the wiring route while peeling off another wiring in case of necessity, and if peeling off another wiring in the above wiring processing, performing rewiring processing for connecting a terminal pair getting unconnected owing to the wiring being peeled off; said second step of setting a cost value on each unit cell including a step of setting a cost value on each unit cell on a connected wiring in such a way that the largest cost value is set on the unit cell adjacent to a terminal of the connected wiring and that the cost value of the unit cell becomes smaller according as the unit cell is further away from the terminal, and setting on the other unit cells, the minimum of the cost values set on the above unit cells on the connected wiring or the smaller cost value.

Claim 13

A COMPUTER READABLE MEMORY storing a computer program controlling an automatic wiring device realized by a computer system, for use in a pattern design of an integrated circuit or a printed wiring board, for performing wiring processing between terminals that are circuit elements according to the pattern on a coordinate plane surface for wiring arrangement with the circuit elements arranged thereon, said computer program comprising: a first step of performing initial wiring processing, on the coordinate plane surface for wiring arrangement to be processed, without permitting any wiring to be shorted; a second step of, when there remains a terminal pair unconnected in the wiring processing by said first step, setting a cost value on every unit cell including the unit cells through which a connected wiring is going, excepting the unit cells on a given wiring prohibited area, of all the unit cells set on the coordinate plane surface for wiring arrangement, according to a predetermined rule that the cost value of the unit cell on the connected wiring in the vicinity of the terminals of the connected wiring is set larger than the cost values of any other unit cells; and a third step of deciding a wiring route by the cost-attached labyrinth method, using the cost value set by said second step, so as to perform wiring processing along the wiring route while peeling off another wiring in case of necessity, and if peeling off another wiring in the above wiring processing, performing rewiring processing for connecting a terminal pair getting unconnected owing to the wiring being peeled off; said second step of setting a cost value on each unit cell including a step of setting a cost value on each unit cell on a connected wiring in such a way that the largest cost value is set on the unit cell adjacent to a terminal of the connected wiring and that the cost value of the unit cell becomes smaller according as the unit cell is further away from the terminal, and setting on the other unit cells, the minimum of the cost values set on the above unit cells on the connected wiring or the smaller cost value.

Claim 14

A COMPUTER READABLE MEMORY as set forth in claim 10, wherein said second step of setting a cost value on each unit cell including a step of setting a cost value on each unit cell on a connected wiring in such a way that the largest cost value is set on the unit cell adjacent to a terminal of the connected wiring and that the cost value of the unit cell becomes smaller according as the unit cell is further away from the terminal, and setting on the other unit cells, the minimum of the cost values set on the above unit cells on the connected wiring or the smaller cost value, and a step of, when the degree of freedom on the possible direction to draw wiring from the terminal is restricted, multiplying the cost value of each unit cell on the connected wiring by a predetermined number so as to make the cost value larger according as the restriction becomes severer.

Claim 15

A COMPUTER READABLE MEMORY as set forth in claim 10, wherein said third step of peeling off another wiring so to perform wiring processing including a step of accumulating each cost value set by said second step, as for each unit cell existing on a route from one terminal to the other terminal of a terminal pair to be connected, and when there exist a plurality of routes, deciding a route having the minimum accumulated value as a wiring route for the terminal pair, by comparison among the accumulated cost value of each route, a step of carrying out wiring processing along the wiring route decided above, while peeling off another wiring that would be shorted by the wiring route, in the wiring processing, and a step of, as for a terminal pair getting unconnected by the wiring being peeled off, performing rewiring processing along the wiring route, as far as there exists a wiring route capable of detouring all the obstacles.

Claim 16

A COMPUTER READABLE MEMORY as set forth in claim 10, wherein said second step of setting a cost value on each unit cell including a step of setting a cost value on each unit cell on a connected wiring in such a way that the largest cost value is set on the unit cell adjacent to a terminal of the connected wiring and that the cost value of the unit cell becomes smaller according as the unit cell is further away from the terminal, and setting on the other unit cells, the minimum of the cost values set on the above unit cells on the connected wiring or the smaller cost value, and a step of, when the degree of freedom on the possible direction to draw wiring from the terminal is restricted, multiplying the cost value of each unit cell on the connected wiring by a predetermined number so as to make the cost value larger according as the restriction becomes severer, while said third step of peeling off another wiring so to perform wiring processing including a step of accumulating each cost value set by said second step, as for each unit cell existing on a route from one terminal to the other terminal of a terminal pair to be connected, and when there exist a plurality of routes, deciding a route having the minimum accumulated value as a wiring route for the terminal pair, by comparison among the accumulated cost value of each route, a step of carrying out wiring processing along the wiring route decided above, while peeling off another wiring that would be shorted by the wiring route, in the wiring processing, and a step of, as for a terminal pair getting unconnected by the wiring being peeled off, performing rewiring processing along the wiring route, as far as there exists a wiring route capable of detouring all the obstacles.