US3621208A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Signal point interconnection routing
Assignee: Texas Instruments Inc
•
Filing: 1969-07-15
•
Granted: 1971-11-16
•
Expires: 1989-07-15
Abstract
Abstract Active components, such as logic gates or flip-flops, formed in a semiconductor substrate are interconnected to input/output bonding pads and other active components in a circuit array in four separate operations. First, after arranging the active components in rows, signal points of all components in one row are interconnected by considering the longest interconnection and proceeding to the shortest. Next, component signal points between rows are interconnected again by considering the longest interconnecting path and proceeding to the shortest path. Third, input/output component signal points are assigned to input/output conductive pads. Finally, interconnecting paths are completed between the input/output component signal points and an assigned pad in a numbered order. Each operation uses a distinct algorithm to complete the necessary steps.
Inventors
- 👤 Donald D Isett
- 👤 Judy A Hellmer
- 👤 Herman W Van Beek
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 15:38
CPC Classifications
H; H10; H10P; H10P72/00; H10P72/04; H10P72/0444; G; G06; G06F; G06F30/00; G06F30/30; G06F30/39; G06F30/394; H05; H05K; H05K13/00; H05K13/06; H10D; H10D84/00; H10D84/90; H10W; H10W20/00; H10W20/20
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
81 words
The method of interconnecting signal points by an automated data processing machine for active components arranged in rows comprising: generating and storing representations of interconnecting paths between selected component signal points in a row in an order considering the longest interconnecting path first and proceeding to the shortest interconnecting path, and generating and storing representations of interconnecting paths between selected component signal points between rows in an order considering the longest interconnecting path first and proceeding to the shortest interconnecting path.
Claim 2
Independent Claim
81 words
The method of interconnecting signal points by an automated data processing machine for active components arranged in rows comprising: generating and storing representations of interconnecting paths between selected component signal points in a row in an order considering the longest interconnecting path first and proceeding to the shortest interconnecting path, and generating and storing representations of interconnecting paths between selected component signal points between rows in an order considering the longest interconnecting path first and proceeding to the shortest interconnecting path.
Claim 3
Dependent Claim
74 words
The method of interconnecting signal points by an automated data processing machine as set forth in claim 1 wherein the step of generating and storing representations of interconnecting paths between selective component signal points between rows includes arranging the interconnecting paths in a first category, a second category to be considered after completion of category one interconnections, and a third category to be considered after completion of the interconnections of categories one and two.
Claim 4
Dependent Claim
82 words
The method of interconnecting signal points by an automated data processing machine as set forth in claim 2 wherein the interconnections in category one are made in stacking channels associated with a first row of active components, the interconnections in category two are made in stacking channels associated with the active components in a second row, and the interconnections in category three are made in stacking channels associated with both rows of active components and are considered on a ''''best fit'''' basis.
Claim 5
Dependent Claim
115 words
The method of interconnecting signal points by an automated data processing machine as set forth in claim 3 wherein an interconnecting path will be considered in category one if the interconnection can be made in stacking channels associated with the first component row and the connection does not interfere with a connection to any other signal point, an interconnecting path will be considered in category two if it can be made in a stacking channel associated with the second component row and it does not interfere with a connection to any other signal point, and an interconnecting path will be considered in category three if it cannot be placed in either of the other categories.
Claim 6
Independent Claim
159 words
The method of interconnecting signal points by an automated data processing machine for active compOnents arranged in rows in a semiconductor substrate, comprising: generating and storing representations of interconnecting paths which include both conductors formed into the semiconductor substrate and metal conductors on the surface of said substrate between selected component signal points in a row and in order considering the longest interconnecting path first and proceeding to the shortest interconnecting path, generating and storing representations of interconnecting paths which include both conductors formed into the semiconductor substrate and metal conductors on the surface of the substrate between selected component signal points between rows in an order considering the longest interconnecting path first and proceeding to the shortest interconnecting path, and generating circuit patterns from the representations of the interconnecting paths, one of said patterns representing the interconnecting paths to be formed into the semiconductor substrate, and another of said patterns outlining the metal conductors of the interconnecting paths.
Claim 7
Independent Claim
159 words
The method of interconnecting signal points by an automated data processing machine for active compOnents arranged in rows in a semiconductor substrate, comprising: generating and storing representations of interconnecting paths which include both conductors formed into the semiconductor substrate and metal conductors on the surface of said substrate between selected component signal points in a row and in order considering the longest interconnecting path first and proceeding to the shortest interconnecting path, generating and storing representations of interconnecting paths which include both conductors formed into the semiconductor substrate and metal conductors on the surface of the substrate between selected component signal points between rows in an order considering the longest interconnecting path first and proceeding to the shortest interconnecting path, and generating circuit patterns from the representations of the interconnecting paths, one of said patterns representing the interconnecting paths to be formed into the semiconductor substrate, and another of said patterns outlining the metal conductors of the interconnecting paths.
Claim 8
Dependent Claim
74 words
The method of interconnecting signal points by an automated data processing machine as set forth in claim 5 wherein the step of generating and storing representations of interconnecting paths between selective component signal points between rows includes arranging the interconnecting paths in a first category, a second category to be considered after completion of category one interconnections, and a third category to be considered after completion of the interconnections of categories one and two.
Claim 9
Dependent Claim
82 words
The method of interconnecting signal points by an automated data processing machine as set forth in claim 6 wherein the interconnections in category one are made in stacking channels associated with a first row of active components, the interconnections in category two are made in stacking channels associated with the active components in a second row, and the interconnections in category three are made in stacking channels associated with both rows of active components and are considered on a ''''best fit'''' basis.
Claim 10
Dependent Claim
115 words
The method of interconnecting signal points by an automated data processing machine as set forth in claim 7 wherein an interconnecting path will be considered in category one if the interconnection can be made in stacking channels associated with the first component row and the connection does not interfere with a connection to any other signal point, an interconnecting path will be considered in category two if it can be made in a stacking channel associated with the second component row and it does not interfere with a connection to any other signal point, and an interconnecting path will be considered in category three if it cannot be placed in either of the other categories.
Claim 11
Independent Claim
123 words
The method of interconnecting signal points by an automated data processing machine comprising: generating and storing representations of an arrangement of active components in rows formed into a semiconductor substrate through an insulating layer, generating and storing representations of interconnecting paths stacked in a plurality of parallel channels between selected component signal points in a row in an order considering the longest interconnecting path first and proceeding to the shortest interconnecting path, generating and storing representations of interconnecting paths stacked in a plurality of channels between selected component signal points between rows in an order considering the longest interconnecting path first and proceeding to the shortest interconnecting path, and generating circuit fabricating patterns from the representations of active components and the interconnecting paths.
Claim 12
Independent Claim
123 words
The method of interconnecting signal points by an automated data processing machine comprising: generating and storing representations of an arrangement of active components in rows formed into a semiconductor substrate through an insulating layer, generating and storing representations of interconnecting paths stacked in a plurality of parallel channels between selected component signal points in a row in an order considering the longest interconnecting path first and proceeding to the shortest interconnecting path, generating and storing representations of interconnecting paths stacked in a plurality of channels between selected component signal points between rows in an order considering the longest interconnecting path first and proceeding to the shortest interconnecting path, and generating circuit fabricating patterns from the representations of active components and the interconnecting paths.
Claim 13
Dependent Claim
95 words
The method of interconnecting signal points as set forth in claim 9 wherein the generated and stored representations of interconnecting paths between selected component signal points in a row are arranged in an order starting from the longest interconnecting path and then selected tO maximize the use of a first of said plurality of channels and then starting with the remaining longest interconnecting paths and selecting paths to maximize the use of a second plurality of channels and proceeding in the same order until all the interconnecting paths are fit into the plurality of channels.
Claim 14
Dependent Claim
74 words
The method of interconnecting signal points by an automated data processing machine as set forth in claim 9 wherein the step of generating and storing representations of interconnecting paths between selective component signal points between rows includes arranging the interconnecting paths in a first category, a second category to be considered after completion of category one interconnections, and a third category to be considered after completion of the interconnections of categories one and two.
Claim 15
Dependent Claim
115 words
The method of interconnecting signal points by an automated data processing machine as set forth in claim 11 wherein the generated and stored representations of interconnecting paths between selected component signal points in category one are considered in an order proceeding from the longest of said interconnecting paths and then selected to maximize the use of the first plurality of channels associated with the first row of active components, and then starting with the remaining longest interconnecting paths and selecting paths to maximize the use of the second of said plurality of channels, and continuing in the same order until all the interconnecting paths of category one have been fit into the plurality of channels.
Claim 16
Dependent Claim
115 words
The method of interconnecting signal points by an automated data processing machine as set forth in claim 12 wherein the generated and stored representations of interconnecting paths between selected component signal points in category two are considered in an order proceeding from the longest of said interconnecting paths and then selected to maximize the use of the first plurality of channels associated with the second row of active components, and then starting with the remaining longest interconnecting paths and selecting paths to maximize the use of the second of said plurality of channels, and continuing in the same order until all the interconnecting paths of category two have been fit into the plurality of channels.
Claim 17
Dependent Claim
118 words
The method of interconnecting signal points by an automated data processing machine as set forth in claim 13 wherein the generated and stored representations of interconnecting paths between selected component signal points between rows in category three are considered in an order proceeding from the longest of said interconnecting paths and then selected to maximize the use of the first of the unused plurality of channels for either of the active component rows, and then starting with the remaining longest interconnecting path of category three, selecting paths to maximize the use of the second available channel, and continuing in the same order until all the interconnecting paths of category three have been fit into the plurality of channels.
Claim 18
Dependent Claim
45 words
The method of interconnecting signal points as set forth in claim 14 wherein the first plurality of channels for the interconnecting paths between selected component signal points between rows starts from the last plurality of channels for interconnecting paths between selected components in a row.
Claim 19
Dependent Claim
40 words
The method of interconnecting signal points as set forth in claim 15 wherein the generated and stored representations of the interconnecting paths are separated into areas formed into the semiconductor substrate and conductors formed by metallization on said insulating layer.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1974-11-15 | 1975-05-17 | 1975-11-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1978-11-15 | 1979-05-17 | 1979-11-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1982-11-15 | 1983-05-17 | 1983-11-16 | $7700.00 | Window Closed / Lapsed |