US5353235A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Wire length minimization in channel compactor
Assignee: Philips Semiconductors Inc
•
Filing: 1992-06-17
•
Granted: 1994-10-04
•
Expires: 2012-06-17
Abstract
Abstract A method of routing interconnections of devices in a planar field by the use of a computer. The method effectively shortens the length of all interconnections, including interconnections which connect points on the same device, in accordance with design rules. Also, the layers constituting the planar field can be assigned weights to effectively minimize the appearance of interconnections in the layer having the highest assigned weight.
Inventors
- 👤 Kieu-Huong Do
- 👤 Sunil Ashtaputre
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 13:09
CPC Classifications
G; G06; G06F; G06F30/00; G06F30/30; G06F30/39; G06F30/394; G06F30/398
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
124 words
A machine process for routing interconnections between devices, the process comprising: defining representations of the devices; defining columns in a channel bounded by representations of two devices to be interconnected; defining tracks in the channel, the tracks being substantially parallel to one another and substantially perpendicular to axes of the columns; defining nets representing interconnections of points on the devices; compressing the channel by moving all points of a net on a track toward a representation of a first of the devices within each column; straightening the nets to minimize the number of jogs appearing therein; and shortening nets which connect points on the second of the devices by moving all points of the net on a track toward a second of the devices.
Claim 2
Dependent Claim
124 words
A machine process for routing interconnections between devices, the process comprising: defining representations of the devices; defining columns in a channel bounded by representations of two devices to be interconnected; defining tracks in the channel, the tracks being substantially parallel to one another and substantially perpendicular to axes of the columns; defining nets representing interconnections of points on the devices; compressing the channel by moving all points of a net on a track toward a representation of a first of the devices within each column; straightening the nets to minimize the number of jogs appearing therein; and shortening nets which connect points on the second of the devices by moving all points of the net on a track toward a second of the devices.
Claim 3
Dependent Claim
35 words
A machine process according to claim 1, wherein the nets represent interconnections formed in layers, each layer including portions of the interconnections the axes of which travel in the direction of either columns or tracks.
Claim 4
Dependent Claim
45 words
A machine process according to claim 2, further comprising the step of assigning weights to each of the layers, wherein said weights relate to comparative cost of using respective layers and the layer having the highest assigned weight bears the least amount of the interconnections.
Claim 5
Dependent Claim
21 words
A machine process according to claim 3, wherein a user of the machine process inputs the weights assigned to the layers.
Claim 6
Dependent Claim
43 words
A machine process according to claim 2, further comprising a step of assigning weights to each of the layers, wherein the assigned weights govern the priority of moving the nets, thereby shortening the portions of the nets appearing in layers having greater weight.
Claim 7
Dependent Claim
21 words
A machine process according to claim 5, wherein a user of the machine process inputs the weights assigned to the layers.
Claim 8
Dependent Claim
156 words
A machine process for routing interconnections between devices, the process comprising: defining representations of the devices; defining columns in a channel bounded by representations of two devices to be interconnected; defining tracks in the channel, the tracks being substantially parallel to one another and substantially perpendicular to axes of the columns; defining nets representing interconnections of points on the devices wherein the nets represent interconnections formed in layers, each layer including portions of the interconnections the axes of which travel in the direction of either columns or tracks; compressing the channel by moving all points of a net in a track toward a representation of a first of the devices within each column; straightening the nets to minimize the number of jogs appearing therein; assigning weights to the layers, wherein said weights relate to comparative cost of using respective layers; and minimizing the amount of the nets appearing in each layer according to its assigned weight.
Claim 9
Dependent Claim
156 words
A machine process for routing interconnections between devices, the process comprising: defining representations of the devices; defining columns in a channel bounded by representations of two devices to be interconnected; defining tracks in the channel, the tracks being substantially parallel to one another and substantially perpendicular to axes of the columns; defining nets representing interconnections of points on the devices wherein the nets represent interconnections formed in layers, each layer including portions of the interconnections the axes of which travel in the direction of either columns or tracks; compressing the channel by moving all points of a net in a track toward a representation of a first of the devices within each column; straightening the nets to minimize the number of jogs appearing therein; assigning weights to the layers, wherein said weights relate to comparative cost of using respective layers; and minimizing the amount of the nets appearing in each layer according to its assigned weight.
Claim 10
Dependent Claim
38 words
A machine process according to claim 7, further comprising the step of moving all points of a net in a track toward a second of the devices when the net connects points on the second of the devices.
Claim 11
Dependent Claim
46 words
A machine process for routing interconnections between devices, the process comprising: compressing channels bounded by representations of devices; straightening nets representing interconnections between the devices to minimize the number of jogs appearing therein; and thereafter shortening nets which connect two points on one of the devices.
Claim 12
Dependent Claim
46 words
A machine process for routing interconnections between devices, the process comprising: compressing channels bounded by representations of devices; straightening nets representing interconnections between the devices to minimize the number of jogs appearing therein; and thereafter shortening nets which connect two points on one of the devices.
Claim 13
Dependent Claim
43 words
A machine process according to claim 9, wherein the nets represent interconnections formed in layers, each layer including portions of the interconnections the axes of which travel in the direction of either substantially perpendicular to the representations are substantially parallel to the representations.
Claim 14
Dependent Claim
45 words
A machine process according to claim 10, further comprising the step of assigning weights to each of the layers, wherein said weights relate to comparative cost of using respective layers and the layer having the highest assigned weight bears the least amount of the interconnections.
Claim 15
Dependent Claim
21 words
A machine process according to claim 11, wherein a user of the machine process inputs the weights assigned to the layers.
Claim 16
Dependent Claim
44 words
A machine process according to claim 10, further comprising a step of assigning weights to each of the layers, wherein the assigned weights govern the priority of moving the nets, such that portions of the nets appearing in layers having greater weight are shortened.
Claim 17
Dependent Claim
21 words
A machine process according to claim 13, wherein a user of the machine process inputs the weights assigned to the layers.
Claim 18
Dependent Claim
94 words
A machine process for routing interconnections between devices, the process comprising: compressing a channel bounded by representations of devices; straightening nets representing interconnections of points on the devices wherein the nets represent interconnections formed in layers, the layers including portions of the interconnections the axes of which travel in the direction of either perpendicular or parallel to the representations of the devices; assigning weights to the layers, wherein said weights relate to comparative cost of using respective layers; and minimizing the amount of the nets appearing in each layer according to its assigned weight.
Claim 19
Dependent Claim
94 words
A machine process for routing interconnections between devices, the process comprising: compressing a channel bounded by representations of devices; straightening nets representing interconnections of points on the devices wherein the nets represent interconnections formed in layers, the layers including portions of the interconnections the axes of which travel in the direction of either perpendicular or parallel to the representations of the devices; assigning weights to the layers, wherein said weights relate to comparative cost of using respective layers; and minimizing the amount of the nets appearing in each layer according to its assigned weight.
Claim 20
Dependent Claim
23 words
A machine process according to claim 15, further comprising the step of shortening nets which connect two points on one of the devices.
References Cited (Backward Citations)
US4630219A
Cited
US4615011A
Cited
US4903214A
Cited
US4965739A
Cited
US5124273A
Cited
US5267177A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-10-03 | 1998-04-04 | 1998-10-04 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-10-03 | 2002-04-04 | 2002-10-04 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-10-03 | 2006-04-04 | 2006-10-04 | $7700.00 | Window Closed / Lapsed |