US4786613A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of combining gate array and standard cell circuits on a common semiconductor chip
Assignee: International Business Machines Corp
•
Filing: 1987-02-24
•
Granted: 1988-11-22
•
Expires: 2007-02-24
Abstract
Abstract A method and semiconductor structure are provided for intermixing circuits of two or more different cell classes, such as standard cells and gate array cells, on a common chip or substrate with minimum ground rule separation between adjacent cells of different classes. Cell locations are defined with given boundaries and contiguosuly arranged on the surface of a semiconductor chip, and then either standard cell type or gate array type circuits are formed within any of the cell locations to provide a structure for balancing the chips density and performance versus hardware turn-around-time.
Inventors
- 👤 Elliot L. Gould
- 👤 Douglas W. Kemerer
- 👤 Lance A. McAllister
- 👤 Ronald A. Piro
- 👤 Guy R. Richardson
- 👤 Deborah A. Wellburn
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 22:44
CPC Classifications
H; H10; H10D; H10D89/00; H10D89/10; H10D84/00; H10D84/90; H10D84/903; H10D84/907; Y; Y10; Y10S; Y10S257/00; Y10S257/909
Claims Analysis
Total Claims: 31
Claim 1
Independent Claim
199 words
A method of making a logic chip which includes the steps of defining a plurality n of cell locations, each having a boundary, within a semiconductor chip, forming standard cell circuits within n-x of said plurality n of cell locations, where x is a smaller number than n, x cell locations being unoccupied, each of said standard cell circuits being disposed within an active circuit area spaced at least a given distance from the boundary of its associated cell location, and forming a plurality of gate array cells within said unoccupied cell locations, each of said gate array cells having an active circuit area spaced at least said given distance from the boundary on one side of its associated cell location and extending without the boundary on the side of its associated cell location opposite to that of said one side for a distance at least equal to said given distance for contacting the active circuit area of an adjacent one of said plurality of gate array cells and extending within said opposite boundary so as to be spaced therefrom by at least said given distance when one of said standard cells is disposed adjacent to said opposite boundary.
Claim 2
Independent Claim
199 words
A method of making a logic chip which includes the steps of defining a plurality n of cell locations, each having a boundary, within a semiconductor chip, forming standard cell circuits within n-x of said plurality n of cell locations, where x is a smaller number than n, x cell locations being unoccupied, each of said standard cell circuits being disposed within an active circuit area spaced at least a given distance from the boundary of its associated cell location, and forming a plurality of gate array cells within said unoccupied cell locations, each of said gate array cells having an active circuit area spaced at least said given distance from the boundary on one side of its associated cell location and extending without the boundary on the side of its associated cell location opposite to that of said one side for a distance at least equal to said given distance for contacting the active circuit area of an adjacent one of said plurality of gate array cells and extending within said opposite boundary so as to be spaced therefrom by at least said given distance when one of said standard cells is disposed adjacent to said opposite boundary.
Claim 3
Dependent Claim
80 words
A method as set forth in claim 1 further including the steps of forming a plurality of input/output cell locations along the periphery of said chip, a first plurality of said input/output cell locations having an isolation region spaced from the edge of said chip by a first distance and a second plurality of said input/output cell locations having an isolation region spaced from the edge of said chip by a second distance different from that of said first distance.
Claim 4
Dependent Claim
28 words
A method as set forth in claim 2 wherein said isolation regions form a guard ring dividing each of said input/output cell locations into first and second regions.
Claim 5
Dependent Claim
57 words
A method as set forth in claim 3 further including the steps of forming input/output circuits having a plurality of transistors in each of said input/output cell locations, said first region of each of said input/output cell locations having formed therein at least one of said transistors with the remaining transistors being formed within said second regions.
Claim 6
Independent Claim
208 words
A method of making a logic chip which includes the steps of defining a plurality n of cell locations, each having a boundary, within a semiconductor chip, forming a plurality n-x standard cells within n-x of said plurality n of cell locations, where x is a smaller number than n, x cell locations being unoccupied, each of said standard cells having an active circuit area disposed at least a given distance from the boundary of its associated cell location, and forming a plurality of gate array cells within said unoccupied cell locations, said plurality of gate array cells being equal to or less than x, each of said gate array cells having an active circuit area disposed at least said given distance from the boundary on one side of its associated cell location and extending without the boundary on the side of its associated cell location opposite to that of said one side for a distance at least equal to said given distance to contact the active circuit area of an adjacent one of said plurality of gate array cells and extending to within said opposite boundary no closer than at least said given distance when one of said standard cells is disposed adjacent to said opposite boundary.
Claim 7
Independent Claim
208 words
A method of making a logic chip which includes the steps of defining a plurality n of cell locations, each having a boundary, within a semiconductor chip, forming a plurality n-x standard cells within n-x of said plurality n of cell locations, where x is a smaller number than n, x cell locations being unoccupied, each of said standard cells having an active circuit area disposed at least a given distance from the boundary of its associated cell location, and forming a plurality of gate array cells within said unoccupied cell locations, said plurality of gate array cells being equal to or less than x, each of said gate array cells having an active circuit area disposed at least said given distance from the boundary on one side of its associated cell location and extending without the boundary on the side of its associated cell location opposite to that of said one side for a distance at least equal to said given distance to contact the active circuit area of an adjacent one of said plurality of gate array cells and extending to within said opposite boundary no closer than at least said given distance when one of said standard cells is disposed adjacent to said opposite boundary.
Claim 8
Independent Claim
195 words
A method of making a logic chip which includes the steps of defining a plurality of contiguous cell locations, each having a boundary, within a semiconductor chip, forming first and second standard cell circuits in spaced apart first and second cell locations, respectively, of said plurality of cell locations, each of said standard cell circuits being disposed within an active area of its associated cell location spaced at least a given distance from the boundary of its associated cell location, forming a first gate array cell in a third cell location of said plurality of cell locations contiguous with said first cell location between said first and second cell locations, said first gate array cell having an active circuit area spaced at least a given distance from the common boundary between said first and third cell locations, and forming a second gate array cell in a fourth cell location of said plurality of cell locations contiguous to said second cell location between said first and second cell locations, said second gate array cell having an active circuit area spaced at least said given distance from the common boundary between said second and fourth cell locations.
Claim 9
Independent Claim
195 words
A method of making a logic chip which includes the steps of defining a plurality of contiguous cell locations, each having a boundary, within a semiconductor chip, forming first and second standard cell circuits in spaced apart first and second cell locations, respectively, of said plurality of cell locations, each of said standard cell circuits being disposed within an active area of its associated cell location spaced at least a given distance from the boundary of its associated cell location, forming a first gate array cell in a third cell location of said plurality of cell locations contiguous with said first cell location between said first and second cell locations, said first gate array cell having an active circuit area spaced at least a given distance from the common boundary between said first and third cell locations, and forming a second gate array cell in a fourth cell location of said plurality of cell locations contiguous to said second cell location between said first and second cell locations, said second gate array cell having an active circuit area spaced at least said given distance from the common boundary between said second and fourth cell locations.
Claim 10
Dependent Claim
67 words
A method as set forth in claim 6 wherein said first gate array cell includes a given number of source/drain diffusion regions of a first conductivity type within its cell location boundary and one source/drain diffusion region without its cell location boundary and said second gate array cell includes only said given number of source/drain diffusion regions of said first conductivity type within its cell location boundary.
Claim 11
Dependent Claim
35 words
A method as set forth in claim 7 further including the step of forming a row of gate array cells similar to said first gate array cell between said first and second gate array cells.
Claim 12
Dependent Claim
73 words
A method as set forth in claim 8 wherein said one source/drain diffusion region of said first gate array cell overlaps a source and drain region of one of the gate array cells of said row of gate array cells and the one source/drain diffusion region of another of the gate array cells of said row of gate array cell overlaps one of said source/drain diffusion regions of said second gate array cell.
Claim 13
Dependent Claim
74 words
A method as set forth in claim 7 wherein said first gate array cell further includes said given number of source/drain diffusion regions of a second conductivity type within its cell location boundary and one source/drain diffusion region of said second conductivity type without its cell location boundary and said second gate array cell further includes only said given number of source/drain diffusion regions of said second conductivity type within its cell location boundary.
Claim 14
Dependent Claim
23 words
A method as set forth in claim 10 wherein both P-channel and N-channel transistors are formed in each of said gate array cells.
Claim 15
Dependent Claim
33 words
A method as set forth in claim 7 wherein said one source/drain diffusion region of said first gate array cell overlaps one of said source/drain diffusion regions of said second gate array cell.
Claim 16
Dependent Claim
41 words
A method as set forth in claim 6 further including the step of forming insulating regions between the active circuit areas of said first and third cell locations and between the active circuit areas of said second and fourth cell locations.
Claim 17
Dependent Claim
35 words
A method as set forth in claim 6 further including the step of forming a row of gate array cells similar to said first gate array cell between said first and second gate array cells.
Claim 18
Dependent Claim
25 words
A method as set forth in claim 6 further including the steps of forming electrical contacts within said first, second, third and fourth cell locations.
Claim 19
Dependent Claim
78 words
A method as set forth in claim 6 further including the step of forming a plurality of input/output cell locations along the periphery of said chip, a first plurality of said input/output cell locations having an isolation region spaced from the edge of said chip by a first distance and a second plurality of said input/output cell locations having an isolation region spaced from the edge of said chip by a second distance longer than said first distance.
Claim 20
Dependent Claim
30 words
A method as set forth in claim 16 wherein said isolation regions form a guard ring dividing each of said input/output cell locations into first and second active circuit regions.
Claim 21
Dependent Claim
28 words
A method as set forth in claim 17 further including the step of forming gate array cells in each input/output cell of said second plurality of input/output cells.
Claim 22
Dependent Claim
57 words
A method as set forth in claim 18 further including the steps of forming input/output circuits having a plurality of transistors in each of said input/output cell locations, said first region of each of said input/output cell locations having formed therein at least one of said transistors with the remaining transistors being formed within said second regions.
Claim 23
Dependent Claim
66 words
A method as set forth in claim 19 wherein said first regions are formed between said isolation regions and the edge of said chip and further including the step of forming three field effect transistors in each of the first regions of said second plurality of cell locations and two field effect transistors in each of the first regions of said first plurality of cell locations.
Claim 24
Dependent Claim
23 words
A method as set forth in claim 20 wherein said three field effect transistors include a P channel transistor and two N-channel transistors.
Claim 25
Dependent Claim
21 words
A method as set forth in claim 21 wherein each of said two field effect transistors is an N channel transistor.
Claim 26
Dependent Claim
35 words
A method as set forth in claim 21 wherein one of said two field effect transistors is an N channel transistor and the other of said two field effect transistors is a P channel transistor.
Claim 27
Independent Claim
220 words
A method of making a logic chip which includes the steps of defining a plurality of contiguous cell locations, each having a boundary, within a semiconductor chip, forming a first and second cell of a first type in spaced apart first and second cell locations, respectively, of said plurality of cell locations, each of said first and second cell locations having an active circuit area spaced a given distance from the boundary of its associated cell location, forming a first cell of a second type in a third cell location contiguous with said first cell location between said first and second cell locations, the first cell of said second type having an active circuit area spaced at least a given distance from the common boundary between said first and third cell locations and extending to at least the boundary of said third cell location on its opposite side, and forming a second cell of said second type in a fourth cell location of said plurality of cell locations between said first and second cell locations, said second cell of said second type having an active circuit area spaced at least said given distance from the common boundary between said second and fourth cell locations and extending to at least the boundary of said fourth cell location on its opposite side.
Claim 28
Independent Claim
220 words
A method of making a logic chip which includes the steps of defining a plurality of contiguous cell locations, each having a boundary, within a semiconductor chip, forming a first and second cell of a first type in spaced apart first and second cell locations, respectively, of said plurality of cell locations, each of said first and second cell locations having an active circuit area spaced a given distance from the boundary of its associated cell location, forming a first cell of a second type in a third cell location contiguous with said first cell location between said first and second cell locations, the first cell of said second type having an active circuit area spaced at least a given distance from the common boundary between said first and third cell locations and extending to at least the boundary of said third cell location on its opposite side, and forming a second cell of said second type in a fourth cell location of said plurality of cell locations between said first and second cell locations, said second cell of said second type having an active circuit area spaced at least said given distance from the common boundary between said second and fourth cell locations and extending to at least the boundary of said fourth cell location on its opposite side.
Claim 29
Dependent Claim
80 words
A method as set forth in claim 24 further including the step of forming a plurality of input/output cell locations along the periphery of said chip, a first plurality of said input/output cell locations having a diffused isolation region spaced from the edge of said chip by a first distance and a second plurality of said input/output cell locations having a diffused isolation region spaced from the edge of said chip by a second distance longer than said first distance.
Claim 30
Dependent Claim
25 words
A method as set forth in claim 25 wherein said diffused isolation regions form a guard ring extending through said plurality of input/output cell locations.
Claim 31
Dependent Claim
24 words
A method as set forth in claim 26 wherein said guard ring includes N type impurities and said semiconductor chip includes P type impurities.
References Cited (Backward Citations)
US814122A
Cited
US4412237A
Cited
US4562453A
Cited
US4513307A
Cited
US4589007A
Cited
JPS60177650A
Cited
US4570176A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1991-11-22 | 1992-05-23 | 1992-11-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1995-11-22 | 1996-05-23 | 1996-11-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1999-11-22 | 2000-05-23 | 2000-11-22 | $7700.00 | Window Closed / Lapsed |