US4700316A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Automated book layout in static CMOS
Assignee: International Business Machines Corp
•
Filing: 1985-03-01
•
Granted: 1987-10-13
•
Expires: 2005-03-01
Abstract
Abstract A method of generating the layout of CMOS cells from a high-level functional description of the cells, as well as generating the particular details of the CMOS device. In particular, the image of the chip is formed having the polysilicon gates of the transistors on the n-side vertically aligned with those of the p-side vertically aligned with those of the p-side to minimize the wiring effort. The interconnections between the source and drains are orthogonal to the gates, and run along one layer of metal.
Inventors
- 👤 Ravindra K. Nair
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 05:13
CPC Classifications
G; G06; G06F; G06F30/00; G06F30/30; G06F30/39
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
151 words
A method of operating a computing system to automatically generate a layout of a CMOS cell on a semiconductor chip from the Boolean representation of the function to be implemented by said cell on said semiconductor chip and from predetermined technology rules detailing widths and spacing of devices comprising said representation of said CMOS cell, said method comprising the steps of: reading said Boolean representation of the function to be implemented into said computing system; converting said Boolean representation into a special post fix notation; determining the optimal order of transistors in said CMOS cell layout, including the optimal interconnections therebetween to produce a representation of said CMOS cell layout in response to the said postfix representation of the function; reading said technology rules into said computing system; and determining the topology of the silicon diffusion layers and the metal interconenct layers for said CMOS cell based on said Boolean function.
Claim 2
Independent Claim
151 words
A method of operating a computing system to automatically generate a layout of a CMOS cell on a semiconductor chip from the Boolean representation of the function to be implemented by said cell on said semiconductor chip and from predetermined technology rules detailing widths and spacing of devices comprising said representation of said CMOS cell, said method comprising the steps of: reading said Boolean representation of the function to be implemented into said computing system; converting said Boolean representation into a special post fix notation; determining the optimal order of transistors in said CMOS cell layout, including the optimal interconnections therebetween to produce a representation of said CMOS cell layout in response to the said postfix representation of the function; reading said technology rules into said computing system; and determining the topology of the silicon diffusion layers and the metal interconenct layers for said CMOS cell based on said Boolean function.
Claim 3
Dependent Claim
62 words
The method of claim 1, wherein said step of determining the optimal order comprises the steps of: determining the optimal ordering of transistors and isolation devices in said CMOS cell to minimize circuit width, and determining the assignment of transistor interconnection segments of horizontal metal tracks such that the heights of the n and p sides of said CMOS cell are minimal.
Claim 4
Dependent Claim
88 words
The method of claim 2 wherein said step of determining the optimal ordering of transistors and isolation devices comprises the steps of: examining each element of the said postfix string in turn; pushing each said element along with its type on a push-down stack if the element is an operand; composing an order for the top operands in the stack according to tabulated rules if said element is an operator; pushing said composition on the push-down stack; and continuing the process until said postfix string is completely processed.
Claim 5
Dependent Claim
65 words
The method of claim 1 wherein said step of determining the optimal interconnections between the transistors comprises the steps of: assigning the power and output points on the cell in four different combinations; allocating track to the interconnection paths in an orderly manner for each of the assignments, and choosing that assignment and allocation which results in the occupation of the least number of tracks.
Claim 6
Dependent Claim
65 words
The method of claim 2 wherein said step of determining the optimal interconnections between the transistors comprises the steps of: assigning the power and output points on the cell in four different combinations; allocating tracks to the interconnection paths in an orderly manner for each of the assignments; and choosing that assignment and allocation which results in the occupation of the least number of tracks.
Claim 7
Independent Claim
151 words
A method of operating a computing system to automatically generate a layout of a CMOS cell on a semiconductor chip from the Boolean representation of the function to be implemented by said cell on said semiconductor chip technology rules detailing widths and spacings of devices comprising said representation of said CMOS cell, said method comprising the steps of: reading said Boolean representation of the function to be implemented into said computing system; converting said Boolean representation into a late operator reverse polish notation; determining the optimal order of transistors in said CMOS cell layout, including the optimal interconnections therebetween to produce a representation of said CMOS cell layout in response to the said late operator reverse representation of the function; reading said technology rules into said computing systems; and determining the topology of the silicon diffusion layers and the metal interconnect layers for said CMOS cell based on said Boolean function.
Claim 8
Independent Claim
151 words
A method of operating a computing system to automatically generate a layout of a CMOS cell on a semiconductor chip from the Boolean representation of the function to be implemented by said cell on said semiconductor chip technology rules detailing widths and spacings of devices comprising said representation of said CMOS cell, said method comprising the steps of: reading said Boolean representation of the function to be implemented into said computing system; converting said Boolean representation into a late operator reverse polish notation; determining the optimal order of transistors in said CMOS cell layout, including the optimal interconnections therebetween to produce a representation of said CMOS cell layout in response to the said late operator reverse representation of the function; reading said technology rules into said computing systems; and determining the topology of the silicon diffusion layers and the metal interconnect layers for said CMOS cell based on said Boolean function.
Claim 9
Dependent Claim
62 words
The method of claim 6, wherein said step of determining the optimal order comprises the steps of: determining the optimal ordering of transistors and isolation devices in said CMOS cell to minimize circuit width, and determining the assignment of transistors interconnection segment of horizontal metal tracks such that the heights of the n and p sides of said CMOS cell are minimal.
Claim 10
Dependent Claim
91 words
The method of claim 7 wherein said step of determining the optimal ordering of transistors and isolation devices comprises the steps of: examining each element of the late operator reverse polish string in turn; pushing said element along with its type on a push-down stack if the element is an operand; composing an order for the top operands in the stack according to tabulated rules if said element is an operator; pushing said composition on the push-down stack; and continuing the process until said late operator reverse string is completely processed.
Claim 11
Dependent Claim
65 words
The method of claim 7 wherein said step of determining the optimal interconnections between the transistors comprises the steps of: assigning the power and output points on the cell in four different combinations; allocating tracks to the interconnection paths in an orderly manner for each of the assignments; and choosing that assignment and allocation which results in the occupation of the least number of tracks.
Claim 12
Dependent Claim
65 words
The method of claim 6 wherein said step of determining the optimal interconnections between the transistors comprises the steps of: assigning the power and output points on the cell in four different combinations; allocating tracks to the interconnection paths in an orderly manner for each of the assignments, and choosing that assignment and allocation which results in the occupation of the least number of tracks.
Claim 13
Independent Claim
173 words
A method operating a computing system to automatically generate layouts of CMOS cells on a semiconductor chip from the Boolean representation of the function to be implemented by said cells on said semiconductor chip and from predetermined technology ground rules detailing widths and spacing of devices comprising said representation of said CMOS cell, said method comprising the steps of: reading said Boolean representation of the function to be implemented into said computing system; converting said Boolean representation into a late operator reverse polish form; combining contiguous strings of identical ones of the operators to form a single operator suffixed by 1 plus the number of operators combined; determining the optimal order of transistors in said CMOS cell layout, including the optimal interconnections therebetween to produce a representation of said CMOS cell layout in response to the combining of said contiguous strings; reading said technology ground rules into said computing systems; and determining the topology of the silicon diffusion layers and the metal interconnect layers for said CMOS cell based on said Boolean function.
Claim 14
Independent Claim
173 words
A method operating a computing system to automatically generate layouts of CMOS cells on a semiconductor chip from the Boolean representation of the function to be implemented by said cells on said semiconductor chip and from predetermined technology ground rules detailing widths and spacing of devices comprising said representation of said CMOS cell, said method comprising the steps of: reading said Boolean representation of the function to be implemented into said computing system; converting said Boolean representation into a late operator reverse polish form; combining contiguous strings of identical ones of the operators to form a single operator suffixed by 1 plus the number of operators combined; determining the optimal order of transistors in said CMOS cell layout, including the optimal interconnections therebetween to produce a representation of said CMOS cell layout in response to the combining of said contiguous strings; reading said technology ground rules into said computing systems; and determining the topology of the silicon diffusion layers and the metal interconnect layers for said CMOS cell based on said Boolean function.
References Cited (Backward Citations)
US4584653A
Cited
US4591993A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1990-10-12 | 1991-04-13 | 1991-10-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1994-10-12 | 1995-04-13 | 1995-10-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1998-10-12 | 1999-04-13 | 1999-10-13 | $7700.00 | Window Closed / Lapsed |