US4768154A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Computer aided printed circuit board wiring
Assignee: Telesis Systems Corp
•
Filing: 1987-05-08
•
Granted: 1988-08-30
•
Expires: 2007-05-08
Abstract
Abstract Method and apparatus for computer aided completion of the interconnection pattern of a printed circuit board left after an automatic interconnect routing system fails to connect all points needing connection. The invention utilizes operator and/or automatic intervention in combination with system provided indicia representative of regions, about each of a set of points to be interconnected on the board, where conductors can be placed according to predesignated interconnect protocols or constraints. The system provides selectable logical operations on the regions that permit operator display of indicia from which the operator can intervene to complete the interconnection by providing a minimal sacrifice of protocols or through automatic intervention to complete the interconnect pattern between points in each region according to a data base of acceptable protocol modifications. A list of sets of points which failed to be connected by the automatic router is prioritized to permit the system to take up each unconnected set of points for completion in an order that optimizes efficiency or success likelihood. The interconnect completion system can be utilized on part or all of a printed circuit board wiring project in order to improve overall interconnect efficiency or cost minimization without regard to whether or not automatic routing would provide a connection between points.
Inventors
- 👤 Joseph Sliwkowski
- 👤 Robert Fisher
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 21:23
CPC Classifications
G; G06; G06F; G06F30/00; G06F30/30; G06F30/39; G06F30/394; H; H05; H05K; H05K3/00; H05K3/0005
Claims Analysis
Total Claims: 44
Claim 1
Independent Claim
193 words
A system for designing printed circuit board conductor patterns comprising: means for identifying sets of points between which conductors are to run on said board; means for identifying protocols for placing conductors between points of a set; means for automatically routing conductors between points of a set; means for maintaining a map of the automatically identified conductor routing between points of a set where said routing means is able to succeed in providing a conductor between points according to the protocol; means for identifying the sets of points for which said automatic routing means is unsuccessful in providing a conductor between points of a set; means for identifying regions to which conductor can be provided from each point of a set of points for which said routing means was unsuccessful in providing a conductor between those points; means for providing operator viewable indicia representative of said regions; means for providing operator interaction to identify a conductor route between points of a set of points for which said routing means was unsuccessful thereby to complete conductor between the points of said set; means for adding to said map the operator identified route between points.
Claim 2
Independent Claim
193 words
A system for designing printed circuit board conductor patterns comprising: means for identifying sets of points between which conductors are to run on said board; means for identifying protocols for placing conductors between points of a set; means for automatically routing conductors between points of a set; means for maintaining a map of the automatically identified conductor routing between points of a set where said routing means is able to succeed in providing a conductor between points according to the protocol; means for identifying the sets of points for which said automatic routing means is unsuccessful in providing a conductor between points of a set; means for identifying regions to which conductor can be provided from each point of a set of points for which said routing means was unsuccessful in providing a conductor between those points; means for providing operator viewable indicia representative of said regions; means for providing operator interaction to identify a conductor route between points of a set of points for which said routing means was unsuccessful thereby to complete conductor between the points of said set; means for adding to said map the operator identified route between points.
Claim 3
Dependent Claim
31 words
The system of claim 1 wherein said means for identifying sets of points to be interconnected includes means for identifying points on one or more layers of a printed circuit board.
Claim 4
Dependent Claim
33 words
The system of claim 1 wherein said means for identifying protocols includes means for identifying protocols selected from the group consisting of conductor size, conductor spacing, conductive vias, and conductor length between points.
Claim 5
Dependent Claim
65 words
The system of claim 1 wherein: said routing means includes means for identifying regions of conductor placement about one point of a set of points to be interconnected until said region incorporates the other point of said set; and said means for identifying regions about each point is operative to cause said routing means to develop regions about each point of a set of points.
Claim 6
Dependent Claim
17 words
The system of claim 4 wherein said regions are provided as temporary maps of possible conductor placement.
Claim 7
Dependent Claim
34 words
The system of claim 1 wherein said means for providing operator viewable indicia includes means operative in response to the identified regions about each point of a set for providing a logical operation thereon.
Claim 8
Dependent Claim
30 words
The system of claim 6 wherein said logical operation providing means includes means for displaying a temporary map of regions for a selected one point of said set of points.
Claim 9
Dependent Claim
29 words
The system of claim 6 wherein said logical operation providing means includes means for providing the logical AND of the regions about the points of said set of points.
Claim 10
Dependent Claim
24 words
The system of claim 6 wherein said logical operation providing means includes means for providing an indication of jumper wire locations between the regions.
Claim 11
Dependent Claim
22 words
The system of claim 6 wherein said logical operation providing means includes means for providing a logical OR operation on the regions.
Claim 12
Dependent Claim
31 words
The system of claim 6 wherein said logical operation providing means includes means for identifying the closest points of approach for the regions about each point of a set of points.
Claim 13
Dependent Claim
13 words
The system of claim 6 wherein said logical operation is a Boolean operation.
Claim 14
Dependent Claim
17 words
The system of claim 1 wherein said operator interaction providing means includes means for providing protocol modification.
Claim 15
Dependent Claim
32 words
The system of claim 13 wherein said protocol modification providing means includes means automatically operative for identifying protocol modification according to a predetermined scheme to accomplish interconnection between points of a set.
Claim 16
Dependent Claim
38 words
The system of claim 1 further including: means for prioritizing the identified sets of unsuccessful routing; and said means for identifying regions being operative to identify regions in a sequential order according to said priority of identified sets.
Claim 17
Independent Claim
60 words
A system for designing interconnections for printed circuit boards comprising: means for identifying regions of possible locations for conductors between points of a set of points to have printed circuit conductors therebetween; means for providing a logical operation on said identified regions; means for routing conductors between identified regions in response to said logical operation according to an interconnection protocol.
Claim 18
Independent Claim
60 words
A system for designing interconnections for printed circuit boards comprising: means for identifying regions of possible locations for conductors between points of a set of points to have printed circuit conductors therebetween; means for providing a logical operation on said identified regions; means for routing conductors between identified regions in response to said logical operation according to an interconnection protocol.
Claim 19
Dependent Claim
48 words
The system of claim 16 wherein said logical operation includes one or more operations selected from the group consisting of displaying one region alone, displaying a logical AND of the regions, displaying a logical OR of said regions, displaying indicia representative of points of closest approach between regions.
Claim 20
Dependent Claim
19 words
The system of claim 16 wherein paid protocol includes means for minimizing cost factors in the interconnecting of points.
Claim 21
Dependent Claim
19 words
The system of claim 18 wherein said cost factors have costs assigned to conductor size, spacing, vias, and length.
Claim 22
Dependent Claim
13 words
The system of claim 16 wherein said logical operation is a Boolean operation.
Claim 23
Independent Claim
175 words
A method for designing printed circuit board conductor patterns comprising: identifying sets of points between which conductors are to run on said board; identifying protocols for placing conductors between points of a set; automatically routing conductors between points of a set; maintaining a map of the automatically identified conductor routing between points of a set where said routing step is able to succeed in providing a conductor between points according to the protocol; identifying the sets of points for which said automatic routing step is unsuccessful in providing a conductor between points of a set; identifying regions to which conductor can be provided from each point of a set of points for which said routing step was unsuccessful in providing a conductor between those points; providing operator viewable indicia representative of said regions; providing operator interaction to identify a conductor route between points of a set of points for which said routing step was unsuccessful thereby to complete conductor between the points of said set; adding to said map the operator identified route between points.
Claim 24
Independent Claim
175 words
A method for designing printed circuit board conductor patterns comprising: identifying sets of points between which conductors are to run on said board; identifying protocols for placing conductors between points of a set; automatically routing conductors between points of a set; maintaining a map of the automatically identified conductor routing between points of a set where said routing step is able to succeed in providing a conductor between points according to the protocol; identifying the sets of points for which said automatic routing step is unsuccessful in providing a conductor between points of a set; identifying regions to which conductor can be provided from each point of a set of points for which said routing step was unsuccessful in providing a conductor between those points; providing operator viewable indicia representative of said regions; providing operator interaction to identify a conductor route between points of a set of points for which said routing step was unsuccessful thereby to complete conductor between the points of said set; adding to said map the operator identified route between points.
Claim 25
Dependent Claim
32 words
The method of claim 21 wherein said step of identifying sets of points to be interconnected includes the step of identifying points on one or more layers of a printed circuit board.
Claim 26
Dependent Claim
34 words
The method of claim 21 wherein said step of identifying protocols includes the step of identifying protocols selected from the group consisting of conductor size, conductor spacing, conductive vias, and conductor length between points.
Claim 27
Dependent Claim
66 words
The method of claim 21 wherein: said routing step includes the step of identifying regions of conductor placement about one point of a set of points to be interconnected until said region incorporates the other point of said set; and said step of identifying regions about each point is operative to cause said routing step to develop regions about each point of a set of points.
Claim 28
Dependent Claim
17 words
The method of claim 24 wherein said regions are provided as temporary maps of possible conductor placement.
Claim 29
Dependent Claim
35 words
The method of claim 21 wherein said step of providing operator viewable indicia includes the step operative in response to the identified regions about each point of a set, of providing a logical operation thereon.
Claim 30
Dependent Claim
30 words
The method of claim 26 wherein said logical operation step includes the step of displaying a temporary map of regions for a selected one point of said set of points.
Claim 31
Dependent Claim
29 words
The method of claim 26 wherein said logical operation step includes the step of providing the logical AND of the regions about the points of said set of points.
Claim 32
Dependent Claim
24 words
The method of claim 26 wherein said logical operation step includes the step of providing an indication of jumper wire locations between the regions.
Claim 33
Dependent Claim
22 words
The method of claim 26 wherein said logical operation step includes the step of providing a logical OR operation on the regions.
Claim 34
Dependent Claim
31 words
The method of claim 26 wherein said logical operation step includes the step of identifying the closest points of approach for the regions about each point of a set of points.
Claim 35
Dependent Claim
13 words
The method of claim 26 wherein said logical operation is a Boolean operation.
Claim 36
Dependent Claim
18 words
The method of claim 21 wherein said operator interaction providing step includes the step of providing protocol modification.
Claim 37
Dependent Claim
32 words
The method of claim 33 wherein said protocol modification step includes the step automatically operative, of identifying protocol modification according to a predetermined scheme to accomplish interconnection between points of a set.
Claim 38
Dependent Claim
39 words
The method of claim 21 further including the steps of: prioritizing the identified sets of unsuccessful routing; and said step of identifying regions being operative to identify regions in a sequential order according to said priority of identified sets.
Claim 39
Independent Claim
54 words
A method for designing interconnections for printed circuit boards comprising: identifying regions of possible locations for conductors between points of a set of points to have printed circuit conductors therebetween; providing a logical operation on said identified regions; routing conductors between identified regions in response to said logical operation according to an interconnection protocol.
Claim 40
Independent Claim
54 words
A method for designing interconnections for printed circuit boards comprising: identifying regions of possible locations for conductors between points of a set of points to have printed circuit conductors therebetween; providing a logical operation on said identified regions; routing conductors between identified regions in response to said logical operation according to an interconnection protocol.
Claim 41
Dependent Claim
48 words
The method of claim 36 wherein said logical operation includes one or more operations selected form the group consisting of displaying one region alone, displaying a logical AND of the regions, displaying a logical OR of said regions, displaying indicia representative of points of closest approach between regions.
Claim 42
Dependent Claim
20 words
The method of claim 36 wherein said protocol includes the step of minimizing cost factors in the interconnecting of points.
Claim 43
Dependent Claim
19 words
The method of claim 31 wherein said cost factors have costs assigned to conductor size, spacing, vias, and length.
Claim 44
Dependent Claim
13 words
The method of claim 36 wherein said logical operation is a Boolean operation.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1991-08-30 | 1992-02-29 | 1992-08-30 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1995-08-30 | 1996-02-29 | 1996-08-30 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1999-08-30 | 2000-02-29 | 2000-08-30 | $7700.00 | Window Closed / Lapsed |