GB1352988A - Method for fabricating integrated circuits - Google Patents
Method for fabricating integrated circuitsInfo
- Publication number
- GB1352988A GB1352988A GB4530272A GB4530272A GB1352988A GB 1352988 A GB1352988 A GB 1352988A GB 4530272 A GB4530272 A GB 4530272A GB 4530272 A GB4530272 A GB 4530272A GB 1352988 A GB1352988 A GB 1352988A
- Authority
- GB
- United Kingdom
- Prior art keywords
- circuit
- array
- circuits
- load
- delay
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired
Links
- 238000000034 method Methods 0.000 title abstract 2
- 238000009792 diffusion process Methods 0.000 abstract 2
- 238000005457 optimization Methods 0.000 abstract 2
- 230000001934 delay Effects 0.000 abstract 1
- 238000004519 manufacturing process Methods 0.000 abstract 1
- 239000002184 metal Substances 0.000 abstract 1
- 238000001465 metallisation Methods 0.000 abstract 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/30—Circuit design
-
- H—ELECTRICITY
- H01—ELECTRIC ELEMENTS
- H01L—SEMICONDUCTOR DEVICES NOT COVERED BY CLASS H10
- H01L27/00—Devices consisting of a plurality of semiconductor or other solid-state components formed in or on a common substrate
- H01L27/02—Devices consisting of a plurality of semiconductor or other solid-state components formed in or on a common substrate including semiconductor components specially adapted for rectifying, oscillating, amplifying or switching and having potential barriers; including integrated passive circuit elements having potential barriers
- H01L27/0203—Particular design considerations for integrated circuits
- H01L27/0207—Geometrical layout of the components, e.g. computer aided design; custom LSI, semi-custom LSI, standard cell technique
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2119/00—Details relating to the type or aim of the analysis or the optimisation
- G06F2119/06—Power analysis or power optimisation
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- Computer Hardware Design (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Strategic Management (AREA)
- Human Resources & Organizations (AREA)
- Power Engineering (AREA)
- General Engineering & Computer Science (AREA)
- Economics (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Game Theory and Decision Science (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Condensed Matter Physics & Semiconductors (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Microelectronics & Electronic Packaging (AREA)
- Evolutionary Computation (AREA)
- Geometry (AREA)
- Design And Manufacture Of Integrated Circuits (AREA)
- Semiconductor Integrated Circuits (AREA)
Abstract
1352988 Fabricating integrated circuits INTERNATIONAL BUSINESS MACHINES CORP 2 Oct 1972 [30 Dec 1971] 45302/72 Heading G4A An integrated circuit is designed from a user specification comprising a circuit block graph and details of available circuit characteristics by computing the load associated with each circuit of the graph and its electrical characteristics, the latter being compared with the specified characteristics so that each circuit which does not satisfy the specification is replaced. As described for FET circuits the circuit block graph input (Fig. 5, not shown) includes, for each circuit, a number assigned to the circuit, a net number identifying the output net of a circuit, an indication of all the circuits connected to output net, the identifying numbers of the input net, the number of input lines, a maximum time delay, an indication of the logic function of the circuit and the cell position in the circuit chip where the circuit is to be placed. From additional information provided by the user an array AFS (Fig. 4, not shown) is formed comprising for each circuit, constants m, K for use in computing delay times, load-in values, constants ZC1, ZC2 for use in computing the circuit load, the power dissipated by the circuit, a size parameter (used in conjunction with the number of inputs to the circuit to determine the physical area required) and a maximum cell size, this information being stored on disc. Each circuit in the circuit block graph input is initially associated with an address in the array containing the characteristics of the user specified circuit which will satisfy the circuit block graph. The circuits in adjacent addresses of the array perform the same function, faster circuits having higher address numbers. Initially the programme computes at step 10 (Fig. 1A), for each circuit C i the metal and diffusion interconnection lengths required for its output net. This is effected by computing the vertical and horizontal co-ordinate distances VM, HD between the circuit C i and the circuits of its output net from the X and Y co-ordinate positions of the array. The vertical and horizontal distances represent metallization and diffusion fabrication respectively. Next, at step 20, the load 2T i and delay D i associated with that load is computed. The circuit load ZC is first calculated by fetching from the circuit block graph input the number NFAN of input lines to the circuit C i and from the array AFS the constants ZC1, ZC2 to compute the value 2C1 + 2C2 x NFAN. The circuit interconnect load is computed from the length VM, HD by using the formula where KM, KD are constants fed in by the user. The driven circuit load ZD is computed by accessing the circuit block graph input to determine the circuit numbers of the circuits driven by the circuit C i and the corresponding addressesin the array of their characteristics. The load parameters for these circuits are fetched from the array and added to derive the load ZD. The total load ZT i is given by the sum of ZC + ZI + ZD. From the array the components m and K are fetched so that the delay D i = m x ZT + K may be computed. The specified delay SPD i for the circuit C i is fetched from the user array and if it is greater or equal to D i the circuit is considered to satisfy the requirements. If it is less than D i the array address is incremented to find, if available, the characteristics of a faster circuit. The cell size for the faster circuit is computed using the size parameter in the array and the number of inputs specified in the circuit block graph input and if it exceeds the cell size limitations the programme proceeds to operate on the next circuit C i+1 . If however the circuit size does not exceed the cell size limit an optimization programme 40 (Fig 1B) is effected. In the optimization process any delays D i which have not been calculated are determined. For each circuit C i the difference # between the delay time D; and the specified delay time SPD i for each circuit connected to the inputs of the circuit C i is computed. A critical input circuit is identified by finding the maximum value D crit of #. This maximum value is added to the delay D i to derive a total delay DT. A hypothetical increment of the sizes of all the circuits driven by the critical input circuit is then made and a new total delay DT<SP>1</SP> is computed. If DT<SP>1</SP> is less than DT the circuit block graph input is updated with the address of the characteristics of the faster circuit and if the circuit size is increased the programme branches back to step 20. Otherwise, after all the circuits C i have been processed, a test is made to determine whether the total circuit chip power dissipation has been exceeded for all circuits and if it has the updated circuit block graph input is fed out to the user.
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US21414371A | 1971-12-30 | 1971-12-30 |
Publications (1)
Publication Number | Publication Date |
---|---|
GB1352988A true GB1352988A (en) | 1974-05-15 |
Family
ID=22797942
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
GB4530272A Expired GB1352988A (en) | 1971-12-30 | 1972-10-02 | Method for fabricating integrated circuits |
Country Status (4)
Country | Link |
---|---|
JP (1) | JPS4879984A (en) |
DE (1) | DE2259726A1 (en) |
GB (1) | GB1352988A (en) |
IT (1) | IT972512B (en) |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPS6116558A (en) * | 1984-07-03 | 1986-01-24 | Sharp Corp | Arranging method of pad for lsi |
US4698760A (en) * | 1985-06-06 | 1987-10-06 | International Business Machines | Method of optimizing signal timing delays and power consumption in LSI circuits |
JPS63250152A (en) * | 1987-04-07 | 1988-10-18 | Nec Corp | Layout of semiconductor integrated circuit |
DE69009067T2 (en) * | 1989-10-23 | 1994-12-22 | Vlsi Technology Inc | METHOD FOR PRODUCING DIGITAL SIGNAL PROCESSORS USING A PROGRAMMED COMPILATOR. |
JP2888708B2 (en) * | 1992-10-23 | 1999-05-10 | ローム株式会社 | How to design logic circuits |
-
1972
- 1972-10-02 GB GB4530272A patent/GB1352988A/en not_active Expired
- 1972-12-06 DE DE2259726A patent/DE2259726A1/en active Pending
- 1972-12-19 IT IT33109/72A patent/IT972512B/en active
- 1972-12-19 JP JP47126821A patent/JPS4879984A/ja active Pending
Also Published As
Publication number | Publication date |
---|---|
IT972512B (en) | 1974-05-31 |
DE2259726A1 (en) | 1973-07-12 |
JPS4879984A (en) | 1973-10-26 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Dhar et al. | Optimum buffer circuits for driving long uniform lines | |
US3728532A (en) | Carry skip-ahead network | |
US5140402A (en) | Automatic placement method for arranging logic cells | |
JPH0527982B2 (en) | ||
WO1994019741A3 (en) | Real-time rule based processing system | |
US6024478A (en) | Design aiding apparatus and method for designing a semiconductor device | |
EP0079127A1 (en) | Programmable system component | |
US4280190A (en) | Incrementer/decrementer circuit | |
US3970833A (en) | High-speed adder | |
GB1352988A (en) | Method for fabricating integrated circuits | |
UST935003I4 (en) | Process for selecting circuits with optimum | |
US5815406A (en) | Method and system for designing a circuit using RC and timing weighting of nets | |
GB1505812A (en) | Address decoder | |
EP0590251A2 (en) | High-speed adder | |
Dehkordi et al. | Impact of packaging technology on system partitioning: A case study | |
WO2018209978A1 (en) | Xiu-accumulation register, xiu-accumulation register circuit and electronic device | |
GB1373414A (en) | Data processing apparatus | |
Eble et al. | Minimum repeater count, size, and energy dissipation for gigascale integration (GSI) interconnects | |
US20030126177A1 (en) | Arithmetic unit and method thereof | |
Supritha et al. | High speed and efficient ALU using modified booth multiplier | |
US4449197A (en) | One-bit full adder circuit | |
Rastogi et al. | Leakage power reduction in MTCMOS based high speed adders | |
US6637012B2 (en) | Method and system for identifying FETs implemented in a predefined logic equation | |
KR0157338B1 (en) | Digital signal processing element | |
Chauhan et al. | Performance Analysis of 4-Bit Multiplier using 90nm Technology |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PS | Patent sealed | ||
PCNP | Patent ceased through non-payment of renewal fee |