US20020184603A1 - Optimal simultaneous design and floorplanning of integrated circuit - Google Patents
Optimal simultaneous design and floorplanning of integrated circuit Download PDFInfo
- Publication number
- US20020184603A1 US20020184603A1 US09/843,486 US84348601A US2002184603A1 US 20020184603 A1 US20020184603 A1 US 20020184603A1 US 84348601 A US84348601 A US 84348601A US 2002184603 A1 US2002184603 A1 US 2002184603A1
- Authority
- US
- United States
- Prior art keywords
- circuit
- floorplan
- posynomial
- method defined
- constraints
- 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.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/30—Circuit design
- G06F30/36—Circuit design at the analogue level
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/30—Circuit design
- G06F30/39—Circuit design at the physical level
- G06F30/392—Floor-planning or layout, e.g. partitioning or placement
Definitions
- the invention relates to computer aided design of integrated circuits, particularly the simultaneous determination for circuit parameters which include boundaries for floorplan layout.
- CAD computer aided design
- he present invention is an extension of this technology which provides simultaneously with the above computation, specific boundaries in the floorplan of the circuit elements in the integrated circuit.
- the present invention is a method for designing an integrated circuit where design parameters for performance specifications are represented by posynomial expressions with constraints and then solved with geometric programming.
- the present invention provides an improvement where simultaneous determination of the boundaries for circuit elements in a floorplan result.
- the floorplan is represented as posynomial expressions with constraint on the size of each of the circuit elements. These posynomial expressions are solved using geometric programming thereby providing the boundaries within the floorplan simultaneously with determining the circuit parameters for the performance specifications.
- FIG. 1 is a flow diagram showing the steps of the present invention.
- FIG. 2 is a flow diagram showing the method for obtaining the posynomial expressions for each of the circuit element using a slicing technique.
- FIG. 3 is a circuit diagram of an integrated circuit.
- FIG. 4 is a floorplan layout for the circuit of FIG. 3.
- FIG. 5 is a slicing diagram for the floorplan of FIG. 4.
- FIG. 6 is a floorplan layout for another integrated circuit.
- FIG. 7 is a slicing diagram for the floorplan of FIG. 6.
- a method is described for providing the boundaries forming a floorplan for a circuit.
- numerous specific details are set forth, such as specific circuits to provide a thorough understanding of the present invention. It will be apparent to one skilled in the art that the present invention may be practiced without these specific details. In other instances, well known prior art technique such as solving posynomial expressions using geometric program is not set forth in detail in order not to unnecessarily obscure the present invention.
- One embodiment reformulates geometric programs as convex optimization problems, i.e. the problem of minimizing a convex function subject to convex inequalities constraints and linear equality constraints. This facilitates globally and efficiently solving geometric programs.
- the first step includes representing a circuit such as an op-amp as posynomial constraints as is described in the above referenced patent.
- Step 10 shows this in FIG. 1 under the step “represent circuit design parameters by posynomial constraints.”
- the present invention now represents the floorplan of the circuit such as an op-amp, as polynomial constraints of circuit element size.
- the boundaries of the circuit elements forming the circuit are represented as posynomial expressions with constraints, as will be described.
- step 12 the expressions both for the floorplan and the performance specifications of the circuit represented by design parameters are solved with a geometric program yielding both the circuit parameters and the boundaries of the circuit elements in the floorplan. This is shown in FIG. 1 as step 12. This can be done generally using a modern workstation in a matter of minutes. Such computation without a modern digital computer could take a lifetime to compete manually.
- step 12 The results of step 12 are represented in a format which preferably can be readily used by a designer in the layout of the circuit for fabrication as an integrated circuit as shown by step 13. For instance, a computer readable format is provided on a specified grid identifying the circuit elements and their parameters such as the length and width of channels of MOS transistors. In other instances, it may be more desirable to provide a hard copy with the fabrication information. In any event, the solution resulting from the geometric program enables the fabrication of an optimal circuit.
- the circuit fabrication data is sent over the Internet to a designer that incorporates the design into an overall chip design. Then the chip incorporating the circuit designed in accordance with the present invention can be fabricated using known processes.
- the op-amp of FIG. 3. It is fabricated with n-channel, MOS transistors and a passive capacitor 34 .
- the input devices M 1 and M 2 (transistors 30 and 31 ) are connected in series with their respective loads M 3 and M 4 (transistors 32 and 33 ).
- the two resultant legs are coupled to M 5 (transistor 37 ).
- a biasing potential is developed from the constant current source 35 which is coupled to the gate of M 5 through M 6 (transistor 36 ).
- the output capacitor C C is coupled to the common node between M 2 and M 4 .
- FIG. 4 A suggested floorplan for this op-amp is shown in FIG. 4.
- the active loads M 3 and M 4 of the op-amp are laid out in the upper left hand corner of the floorplan.
- the compensation capacitor C C is laid out on the right side of the floorplan.
- the input transistors M 1 and M 2 are shown laid out directly below M 3 and M 4 .
- M 5 and M 6 are laid out along side each other in the lower left hand corner of the floorplan.
- the relative location of the different cells e.g., M 3 , M 4
- the exact location of the boundary between the different cells is not fixed. That is, the location of lines 40 , 41 , 42 , and 43 is not fixed within the overall circuit layout.
- the goal is to design the circuit (e.g., size the transistors) so that all specifications are met.
- These objectives and specifications include electrical specification such as gain and bandwidth for op-amps, as well as specifications such as the aspect area of the layout. Minimizing the layout area results in a design with optimal cell packing.
- the floorplan is represented as posynomial constraints of circuit element size using a slicing tree.
- a vertical slice is taken along line 40.
- the cell on the right (sibling node) is the capacitor C C and the cell on the left (other sibling node) contains the cells M 3 , M 4 ; M 1 , M 2 ; M 5 ; and M 6 .
- this initial slice is shown beginning at node 0 by the lines 51 and 52.
- the “V” on these lines indicate a vertical slice.
- Line 51 is shown ending in the capacitor, whereas line 52 lead to the point for the next slice.
- Line 55 ends in the sibling node comprising the transistors M 1 , M 2 .
- Line 56 includes the two nodes, M 5 and M 6 . Now, an additional vertical slice is made along line 43 as shown by lines 57 and 58 resulting in the sibling nodes, cells M 5 and M 6 .
- (x i , y i ) are the horizontal dimension (width) and vertical dimension (height) respectively of the i th cell corresponding to the i th node of the slicing tree shown in FIG. 5.
- X cap (C C ) and y cap (C C ) are the width and the height of the capacitor C C respectively.
- circuit elements such as the MOS transistors and the capacitor for the op-amp, are represented as a function of boundaries and other element parameters as will be described.
- constraints such as shown by equations (1) and (2) are posynomial constraints in cell sizes of the variables (x i , y i ).
- circuit variables e.g., W, L of transistors, size of C C , etc. . . .
- X i +X cap (C C ), y cap (C C ), X mir (M 3 , M 4 ), and y mir (M 3 , M 4 ) are all posynomial in the circuit variables as will be discussed later.
- a constraint on the total area of the circuit to be less than A spec is simply given by:
- FIGS. 6 and 7 illustrate another example of a circuit floorplan and slicing tree.
- the circuit consists of transistors M 1 , M 2 , M 3 , M 4 , and M 5 with the illustrated topology.
- a horizontal slice along line 60 is made as shown by lines 71 and 72 of FIG. 7.
- Line 72 ends in the cell M 5 .
- Line 71 ends in the sibling nodes comprising M 1 , M 2 , M 3 , and M 4 .
- a horizontal slice along line 61 is made resulting in two sibling nodes: one at line 74 comprising transistors M 3 and M 4 , and the other at line 73 comprising transistors M 1 and M 2 .
- a vertical slice is made along line 62 from node 2 resulting in cells M 1 and M 2 shown at the ends of lines 75 and 76 in FIG. 7.
- a horizontal slice is made along line 63 from node 3 resulting in the cells M 3 and M 4 shown at the ends of lines 77 and 78 of FIG. 7.
- the algorithm of FIG. 2 is used. Specifically, for the vertical slices the sum of the widths of the sibling nodes is equal to or less than the parent node and the heights of the sibling nodes is equal to or less than the parent node. For the horizontal slices, the sum of the heights of the sibling nodes is equal to or less than the parent node and the widths of the sibling nodes are each equal to or less than the parent node. From this, the posynomial expressions for each of the cell sizes can be written.
- the constraints represented by equations (1) and (2) above are posynomial constraints in the cell sizes in variables x i , y i .
- posynomial expressions are used to represent the cell size in terms of the circuit element variables. For instance, in the case of a transistor, the width and length of the transistor.
- drainW is the width of the drain
- sourceW is the width of the source
- metalW is the width of the metal lines around the transistor
- subW is the width of the substrate contacts
- subSpX is the horizontal distance form the transistor to the substrate contacts
- subSpY is the vertical distance from the transistor to the substrate contacts
- displ 1 is the distance from a line of fingers to the next, when a source connection is in between
- displ 2 is the distance from a line of fingers to the next, when no source connection is in between
Landscapes
- Engineering & Computer Science (AREA)
- Computer Hardware Design (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Evolutionary Computation (AREA)
- Geometry (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Architecture (AREA)
- Design And Manufacture Of Integrated Circuits (AREA)
Abstract
Description
- The invention relates to computer aided design of integrated circuits, particularly the simultaneous determination for circuit parameters which include boundaries for floorplan layout.
- One computer aided design (CAD) technique for designing integrated circuits, particularly analog circuits, relies upon geometric programming. In general, posynomial expressions of circuit parameters for a plurality of performance specifications are first developed. These expressions are constrained, typically by optimization values for a selected one or more of the performance specifications. The expressions are then solved using geometric programming. This solution provides a globally optimal design. Among the specified performance criteria are layout area, gate overdrive, minimum power, unity gain bandwith, etc. . . . Dimensional constraints such as symmetry and matching, limits on device size and total area are used. For a discussion of this technology, see System And Method For Designing Circuits, Ser. No. 09/123,129, filed Jul. 27, 1998.
- he present invention is an extension of this technology which provides simultaneously with the above computation, specific boundaries in the floorplan of the circuit elements in the integrated circuit.
- The present invention is a method for designing an integrated circuit where design parameters for performance specifications are represented by posynomial expressions with constraints and then solved with geometric programming. The present invention provides an improvement where simultaneous determination of the boundaries for circuit elements in a floorplan result. The floorplan is represented as posynomial expressions with constraint on the size of each of the circuit elements. These posynomial expressions are solved using geometric programming thereby providing the boundaries within the floorplan simultaneously with determining the circuit parameters for the performance specifications.
- FIG. 1 is a flow diagram showing the steps of the present invention.
- FIG. 2 is a flow diagram showing the method for obtaining the posynomial expressions for each of the circuit element using a slicing technique.
- FIG. 3 is a circuit diagram of an integrated circuit.
- FIG. 4 is a floorplan layout for the circuit of FIG. 3.
- FIG. 5 is a slicing diagram for the floorplan of FIG. 4.
- FIG. 6 is a floorplan layout for another integrated circuit.
- FIG. 7 is a slicing diagram for the floorplan of FIG. 6.
- A method is described for providing the boundaries forming a floorplan for a circuit. In the following description, numerous specific details are set forth, such as specific circuits to provide a thorough understanding of the present invention. It will be apparent to one skilled in the art that the present invention may be practiced without these specific details. In other instances, well known prior art technique such as solving posynomial expressions using geometric program is not set forth in detail in order not to unnecessarily obscure the present invention.
- In the following description, the word “posynomial” expression or equation is used. This term is used to include a monomial expression or equation.
- In the prior art, it is known that the design of many different analog circuit cells such as operational amplifiers (op-amps), spiral inductors, and LC oscillators, as well as more complicated analog and mixed circuits, such as phase-lock loops, analog-to-digital and digital-to-analog converters and switched-capacitor filters can be cast as geometric programs. These designs presupposes the active devices are operating in their saturation regions. In this patent, this prior art technology is built upon in that the layout floorplanning constraints for a circuit are set forth in posynomial and hence, can be mixed with design constraints. This allows for the simultaneous design and floorplanning of analog circuits using geometric programming. Consequently, the design and floorplanning can be performed optimally in a single step.
- In co-pending application Ser. No. 09/123,129; filed Jul. 27, 1998; entitled System and Method for Designing Integrated Circuits, now U.S. Pat. No. ______ , the design techniques for designing for instance, an op-amp is described. In summary, this prior art computer aided design (CAD) system provides for the design and in optimizing of integrating circuits. It results in the automated synthesis of globally optimal circuit designs for a give circuit topology resulting directly from a user defined specification. Generally, the CAD system includes a library of integrated circuit topologies. The performance specifications for the integrated circuit topologies are described as posynomial functions of the design parameters. The performance specifications are combined with user defined design objectives and constraints to form a geometric program. One embodiment reformulates geometric programs as convex optimization problems, i.e. the problem of minimizing a convex function subject to convex inequalities constraints and linear equality constraints. This facilitates globally and efficiently solving geometric programs. New variables yi=log xi are defined, the logarithm of a polynomial f is taken to get
- where αk T=[αlk . . . αnk] and bk=log ck. It can be shown that h is a convex function of the new variable y: for all y,z ε Rn and 0≦λ≦1 which yields
- h(λ y+(1−λ)z)≦λh(y)+(1−λ)h(z).
-
- This is the so-called exponential form of the geometric program. The convexity of the exponential form geometric program has several important implications including that efficient interior-point methods can be used to solve such geometric programs, and there is a complete and useful duality, or sensitivity theory for them. The efficient procedures for solving geometric programs typically provide the globally optimal results in a matter of seconds in a digital computer. The present invention therefore yields automated synthesis of globally optimal circuit designs for a given circuit topology library, directly from specifications.
- With the present invention, the first step includes representing a circuit such as an op-amp as posynomial constraints as is described in the above referenced patent.
Step 10 shows this in FIG. 1 under the step “represent circuit design parameters by posynomial constraints.” - Unlike the prior art, however, the present invention now represents the floorplan of the circuit such as an op-amp, as polynomial constraints of circuit element size. In effect, the boundaries of the circuit elements forming the circuit such as the transistors in an op-amp, are represented as posynomial expressions with constraints, as will be described.
- Next, the expressions both for the floorplan and the performance specifications of the circuit represented by design parameters are solved with a geometric program yielding both the circuit parameters and the boundaries of the circuit elements in the floorplan. This is shown in FIG. 1 as
step 12. This can be done generally using a modern workstation in a matter of minutes. Such computation without a modern digital computer could take a lifetime to compete manually. - The results of
step 12 are represented in a format which preferably can be readily used by a designer in the layout of the circuit for fabrication as an integrated circuit as shown bystep 13. For instance, a computer readable format is provided on a specified grid identifying the circuit elements and their parameters such as the length and width of channels of MOS transistors. In other instances, it may be more desirable to provide a hard copy with the fabrication information. In any event, the solution resulting from the geometric program enables the fabrication of an optimal circuit. In one embodiment, the circuit fabrication data is sent over the Internet to a designer that incorporates the design into an overall chip design. Then the chip incorporating the circuit designed in accordance with the present invention can be fabricated using known processes. - Consider first the op-amp of FIG. 3. It is fabricated with n-channel, MOS transistors and a
passive capacitor 34. The input devices M1 and M2 (transistors 30 and 31) are connected in series with their respective loads M3 and M4 (transistors 32 and 33). The two resultant legs are coupled to M5 (transistor 37). A biasing potential is developed from the constantcurrent source 35 which is coupled to the gate of M5 through M6 (transistor 36). The output capacitor CC is coupled to the common node between M2 and M4. - A suggested floorplan for this op-amp is shown in FIG. 4. The active loads M3 and M4 of the op-amp are laid out in the upper left hand corner of the floorplan. The compensation capacitor CC is laid out on the right side of the floorplan. The input transistors M1 and M2 are shown laid out directly below M3 and M4. Finally, M5 and M6 are laid out along side each other in the lower left hand corner of the floorplan. Although the relative location of the different cells (e.g., M3, M4) are fixed in FIG. 4, the exact location of the boundary between the different cells is not fixed. That is, the location of
lines - Given the generic floorplan of the op-amp as shown in FIG. 4, the circuit topology, and required objective parameters and specifications, the goal is to design the circuit (e.g., size the transistors) so that all specifications are met. These objectives and specifications include electrical specification such as gain and bandwidth for op-amps, as well as specifications such as the aspect area of the layout. Minimizing the layout area results in a design with optimal cell packing.
- In one embodiment, the floorplan is represented as posynomial constraints of circuit element size using a slicing tree. Referring to FIG. 4, assume that for a first slice, a vertical slice is taken along
line 40. The cell on the right (sibling node) is the capacitor CC and the cell on the left (other sibling node) contains the cells M3, M4; M1, M2; M5; and M6. Referring to FIG. 5, this initial slice is shown beginning atnode 0 by thelines Line 51 is shown ending in the capacitor, whereasline 52 lead to the point for the next slice. - Now, a horizontal slice is made beginning at
node 1 alongline 41. As shown byline 53, this results in the sibling node, cell M3, M4. Line 54 leads tonode 2 where the next slice occurs. - From
node 2, an additional horizontal slice is made alongline 42 as shown bylines Line 55 ends in the sibling node comprising the transistors M1, M2. -
Line 56 includes the two nodes, M5 and M6. Now, an additional vertical slice is made alongline 43 as shown bylines -
-
- This is summarized in FIG. 2 beginning with
block 20. For vertical slices as shown byblock 22, the sum of the widths of the sibling nodes are equal to or less than the parent node, while the heights of the sibling nodes are each equal to or less than the parent node. In contrast, for the horizontal slice ofblock 21, the sum of the heights of the sibling nodes is equal to or less than the parent node, while the widths of the sibling nodes are each equal to or less than the parent node. - As indicated by the
lines block 25, the circuit elements such as the MOS transistors and the capacitor for the op-amp, are represented as a function of boundaries and other element parameters as will be described. - As can be seen, constraints such as shown by equations (1) and (2) are posynomial constraints in cell sizes of the variables (xi, yi). There are also posynomial expressions in circuit variables (e.g., W, L of transistors, size of CC, etc. . . . ) because the functions Xi+Xcap(CC), ycap(CC), Xmir(M3, M4), and ymir(M3, M4) are all posynomial in the circuit variables as will be discussed later.
- A constraint on the total area of the circuit to be less than Aspec, is simply given by:
- x0y0≦Aspec, (3)
- which is a monomial inequality in the variables (X0 y0). Optimal packing of the cells is achieved by minimizing X0 y0 which is a posynomial function of the variables.
- A constraint on the aspect ratio of the circuit to be less than κspec is given by:
- X 0 /y 0≦κ1spec , y 0 /x 0≦κ2spec (4)
- The smallest aspect ratio can be found by minimizing max (X0 y0, y0 X0), which can then be converted into a geometric program (by introducing a slack variable).
- Hence, by mixing the layout constraints which are posynomials, such as expressions (1), (2), (3), and (4) with the circuit constraints (as given in the above referenced patent), it is possible to optimally design the circuit and floorplan in one step.
- FIGS. 6 and 7 illustrate another example of a circuit floorplan and slicing tree. In FIG. 6, the circuit consists of transistors M1, M2, M3, M4, and M5 with the illustrated topology.
- Beginning with
node 0, a horizontal slice alongline 60 is made as shown bylines Line 72 ends in the cell M5. Line 71 ends in the sibling nodes comprising M1, M2, M3, and M4. Next, atnode 1, a horizontal slice alongline 61 is made resulting in two sibling nodes: one atline 74 comprising transistors M3 and M4, and the other atline 73 comprising transistors M1 and M2. Now, a vertical slice is made alongline 62 fromnode 2 resulting in cells M1 and M2 shown at the ends oflines node 3 resulting in the cells M3 and M4 shown at the ends oflines - Again, with each of the slices, the algorithm of FIG. 2 is used. Specifically, for the vertical slices the sum of the widths of the sibling nodes is equal to or less than the parent node and the heights of the sibling nodes is equal to or less than the parent node. For the horizontal slices, the sum of the heights of the sibling nodes is equal to or less than the parent node and the widths of the sibling nodes are each equal to or less than the parent node. From this, the posynomial expressions for each of the cell sizes can be written.
- As mentioned earlier, the constraints represented by equations (1) and (2) above are posynomial constraints in the cell sizes in variables xi, yi. For each of the cells, posynomial expressions are used to represent the cell size in terms of the circuit element variables. For instance, in the case of a transistor, the width and length of the transistor.
- Consider a MOS transistor M. A first approximation for the width and heights of the MOS is given by:
- Xnmos(M)=m X L, y mos(M)=m y W,
- which are monomial expressions in the circuit variables L, W, mx, and my. Here L and W typically are the critical dimension in a fabrication process and m the number of counts for this dimension. These expressions only consider the active part of the MOS, and, for example, neglect the area of the contacts.
-
- where
- drainW is the width of the drain
- sourceW is the width of the source
- metalW is the width of the metal lines around the transistor
- subW is the width of the substrate contacts
- subSpX is the horizontal distance form the transistor to the substrate contacts
- subSpY is the vertical distance from the transistor to the substrate contacts
- displ1 is the distance from a line of fingers to the next, when a source connection is in between
- displ2 is the distance from a line of fingers to the next, when no source connection is in between
- For other circuit elements such as differential pairs and current mirrors the equation are similar except that mx is multiplied by 2.
- For example, the expression for a spiral inductor is described in “Optimization of Inductor Circuits Via Geometric Programming”Design Automation Conference, 1999 proceedings, 36, pps. 994-998 by M. Del Mar Hershenson, et al.
- Thus, a method has been described for determining the boundaries in the floorplan of a circuit while simultaneously determining other design parameters using geometric programming.
Claims (12)
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/843,486 US7065727B2 (en) | 2001-04-25 | 2001-04-25 | Optimal simultaneous design and floorplanning of integrated circuit |
PCT/US2002/013184 WO2002086772A2 (en) | 2001-04-25 | 2002-04-25 | Optimal simultaneous design and floorplanning of integrated circuit |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/843,486 US7065727B2 (en) | 2001-04-25 | 2001-04-25 | Optimal simultaneous design and floorplanning of integrated circuit |
Publications (2)
Publication Number | Publication Date |
---|---|
US20020184603A1 true US20020184603A1 (en) | 2002-12-05 |
US7065727B2 US7065727B2 (en) | 2006-06-20 |
Family
ID=25290130
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/843,486 Expired - Lifetime US7065727B2 (en) | 2001-04-25 | 2001-04-25 | Optimal simultaneous design and floorplanning of integrated circuit |
Country Status (2)
Country | Link |
---|---|
US (1) | US7065727B2 (en) |
WO (1) | WO2002086772A2 (en) |
Cited By (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20030191611A1 (en) * | 2002-04-05 | 2003-10-09 | Hershenson Maria Del Mar | Behavioral circuit modeling for geometric programming |
US20050028122A1 (en) * | 2002-10-02 | 2005-02-03 | Neolinear, Inc. | Method for generating constrained component placement for integrated circuits and packages |
US20050229126A1 (en) * | 2004-04-07 | 2005-10-13 | Xiaojun Wang | IC layout physical verification method |
US20060075365A1 (en) * | 2004-09-30 | 2006-04-06 | Sabio Labs, Inc. | Novel optimization for circuit design |
US7356784B1 (en) | 2003-12-05 | 2008-04-08 | Cadence Design Systems, Inc. | Integrated synthesis placement and routing for integrated circuits |
US7665054B1 (en) * | 2005-09-19 | 2010-02-16 | Cadence Design Systems, Inc. | Optimizing circuit layouts by configuring rooms for placing devices |
US20200104459A1 (en) * | 2018-09-28 | 2020-04-02 | Taiwan Semiconductor Manufacturing Company, Ltd. | Integrated circuit design using fuzzy machine learning |
US11748552B2 (en) | 2018-09-28 | 2023-09-05 | Taiwan Semiconductor Manufacturing Company, Ltd. | Integrated circuit design using fuzzy machine learning |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB0126104D0 (en) * | 2001-10-31 | 2002-01-02 | Leuven K U Res & Dev | Electronic circuit modeling sizing and optimisation |
US7313456B2 (en) * | 2003-04-11 | 2007-12-25 | Applied Materials, Inc. | Method and apparatus for capturing and using design intent in an integrated circuit fabrication process |
US7448012B1 (en) | 2004-04-21 | 2008-11-04 | Qi-De Qian | Methods and system for improving integrated circuit layout |
US11790144B2 (en) | 2018-10-13 | 2023-10-17 | Elloveo, Inc. | Fast, efficient real-time electro-magnetic systems simulator that dynamically accepts user input |
Citations (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4827428A (en) * | 1985-11-15 | 1989-05-02 | American Telephone And Telegraph Company, At&T Bell Laboratories | Transistor sizing system for integrated circuits |
US5055716A (en) * | 1990-05-15 | 1991-10-08 | Siarc | Basic cell for bicmos gate array |
US5289021A (en) * | 1990-05-15 | 1994-02-22 | Siarc | Basic cell architecture for mask programmable gate array with 3 or more size transistors |
US5633807A (en) * | 1995-05-01 | 1997-05-27 | Lucent Technologies Inc. | System and method for generating mask layouts |
US5754826A (en) * | 1995-08-04 | 1998-05-19 | Synopsys, Inc. | CAD and simulation system for targeting IC designs to multiple fabrication processes |
US6002860A (en) * | 1996-09-27 | 1999-12-14 | Nortel Networks Corporation | High frequency noise and impedance matched integrated circuits |
US6311315B1 (en) * | 1996-09-12 | 2001-10-30 | Matsushita Electric Industrial Co., Ltd. | Semiconductor integrated circuit, design method and computer-readable recording medium |
US6539533B1 (en) * | 2000-06-20 | 2003-03-25 | Bae Systems Information And Electronic Systems Integration, Inc. | Tool suite for the rapid development of advanced standard cell libraries |
US6574786B1 (en) * | 2000-07-21 | 2003-06-03 | Aeroflex UTMC Microelectronics Systems, Inc. | Gate array cell generator using cadence relative object design |
US6578179B2 (en) * | 2000-09-29 | 2003-06-10 | Kabushiki Kaisha Toshiba | LSI layout design apparatus, layout design method, recording medium recording layout design program, and semiconductor integrated circuit |
US6581188B1 (en) * | 1999-07-29 | 2003-06-17 | Mitsubishi Denki Kabushiki Kaisha | Semiconductor device and method of designing the same |
Family Cites Families (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4918614A (en) * | 1987-06-02 | 1990-04-17 | Lsi Logic Corporation | Hierarchical floorplanner |
US6272668B1 (en) * | 1994-12-14 | 2001-08-07 | Hyundai Electronics America, Inc. | Method for cell swapping to improve pre-layout to post-layout timing |
US6209119B1 (en) * | 1997-04-10 | 2001-03-27 | Matsushita Electric Industrial Co., Ltd. | Apparatus and method for synthesizing module |
JPH11306208A (en) * | 1998-04-16 | 1999-11-05 | Fujitsu Ltd | Floor plan method and device and computer readable recording medium recording floor plan program |
US6182272B1 (en) * | 1998-07-16 | 2001-01-30 | Lsi Logic Corporation | Metal layer assignment |
US6269277B1 (en) * | 1998-07-27 | 2001-07-31 | The Leland Stanford Junior University Board Of Trustees | System and method for designing integrated circuits |
US6223334B1 (en) * | 1998-10-01 | 2001-04-24 | Mentor Graphics Corporation | Automatic topology synthesis and optimization |
US6321186B1 (en) * | 1999-05-03 | 2001-11-20 | Motorola, Inc. | Method and apparatus for integrated circuit design verification |
US6311145B1 (en) * | 1999-06-17 | 2001-10-30 | The Board Of Trustees Of The Leland Stanford Junior University | Optimal design of an inductor and inductor circuit |
US6282694B1 (en) * | 1999-06-18 | 2001-08-28 | Chung-Kuan Cheng | IC design floorplan generation using ceiling and floor contours on an O-tree structure |
US6704908B1 (en) | 1999-11-17 | 2004-03-09 | Amadala Limited | Method and apparatus for automatically generating a phase lock loop (PLL) |
-
2001
- 2001-04-25 US US09/843,486 patent/US7065727B2/en not_active Expired - Lifetime
-
2002
- 2002-04-25 WO PCT/US2002/013184 patent/WO2002086772A2/en not_active Application Discontinuation
Patent Citations (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4827428A (en) * | 1985-11-15 | 1989-05-02 | American Telephone And Telegraph Company, At&T Bell Laboratories | Transistor sizing system for integrated circuits |
US5055716A (en) * | 1990-05-15 | 1991-10-08 | Siarc | Basic cell for bicmos gate array |
US5055716B1 (en) * | 1990-05-15 | 1992-12-15 | El Gamal Abbas | |
US5289021A (en) * | 1990-05-15 | 1994-02-22 | Siarc | Basic cell architecture for mask programmable gate array with 3 or more size transistors |
US5633807A (en) * | 1995-05-01 | 1997-05-27 | Lucent Technologies Inc. | System and method for generating mask layouts |
US5754826A (en) * | 1995-08-04 | 1998-05-19 | Synopsys, Inc. | CAD and simulation system for targeting IC designs to multiple fabrication processes |
US6311315B1 (en) * | 1996-09-12 | 2001-10-30 | Matsushita Electric Industrial Co., Ltd. | Semiconductor integrated circuit, design method and computer-readable recording medium |
US6002860A (en) * | 1996-09-27 | 1999-12-14 | Nortel Networks Corporation | High frequency noise and impedance matched integrated circuits |
US6581188B1 (en) * | 1999-07-29 | 2003-06-17 | Mitsubishi Denki Kabushiki Kaisha | Semiconductor device and method of designing the same |
US6539533B1 (en) * | 2000-06-20 | 2003-03-25 | Bae Systems Information And Electronic Systems Integration, Inc. | Tool suite for the rapid development of advanced standard cell libraries |
US6574786B1 (en) * | 2000-07-21 | 2003-06-03 | Aeroflex UTMC Microelectronics Systems, Inc. | Gate array cell generator using cadence relative object design |
US6578179B2 (en) * | 2000-09-29 | 2003-06-10 | Kabushiki Kaisha Toshiba | LSI layout design apparatus, layout design method, recording medium recording layout design program, and semiconductor integrated circuit |
Cited By (21)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20030191611A1 (en) * | 2002-04-05 | 2003-10-09 | Hershenson Maria Del Mar | Behavioral circuit modeling for geometric programming |
US20050028122A1 (en) * | 2002-10-02 | 2005-02-03 | Neolinear, Inc. | Method for generating constrained component placement for integrated circuits and packages |
US7093220B2 (en) * | 2002-10-02 | 2006-08-15 | Cadence Design Systems, Inc. | Method for generating constrained component placement for integrated circuits and packages |
US7356784B1 (en) | 2003-12-05 | 2008-04-08 | Cadence Design Systems, Inc. | Integrated synthesis placement and routing for integrated circuits |
US20050229126A1 (en) * | 2004-04-07 | 2005-10-13 | Xiaojun Wang | IC layout physical verification method |
US7243321B2 (en) * | 2004-04-07 | 2007-07-10 | Cadence Design Systems, Inc. | IC layout physical verification method |
US20080072183A1 (en) * | 2004-09-30 | 2008-03-20 | Mar Hershenson | Novel optimization for circuit design |
US20080077890A1 (en) * | 2004-09-30 | 2008-03-27 | Mar Hershenson | Novel optimization for circuit design |
US8635564B2 (en) | 2004-09-30 | 2014-01-21 | Synopsys, Inc. | Parameter optimization for circuit design |
US7458041B2 (en) * | 2004-09-30 | 2008-11-25 | Magma Design Automation, Inc. | Circuit optimization with posynomial function F having an exponent of a first design parameter |
US20060075365A1 (en) * | 2004-09-30 | 2006-04-06 | Sabio Labs, Inc. | Novel optimization for circuit design |
US7703050B2 (en) * | 2004-09-30 | 2010-04-20 | Magma Design Automation, Inc. | Optimization for circuit design |
US7783996B2 (en) * | 2004-09-30 | 2010-08-24 | Magma Design Automation, Inc. | Optimization for circuit design |
US20100299649A1 (en) * | 2004-09-30 | 2010-11-25 | Mar Hershenson | Novel optimization for circuit design |
US8407651B2 (en) | 2004-09-30 | 2013-03-26 | Synopsys, Inc. | Optimization for circuit design |
US7665054B1 (en) * | 2005-09-19 | 2010-02-16 | Cadence Design Systems, Inc. | Optimizing circuit layouts by configuring rooms for placing devices |
US8527928B1 (en) * | 2005-09-19 | 2013-09-03 | Cadence Design Systems, Inc. | Optimizing circuit layouts by configuring rooms for placing devices |
US20200104459A1 (en) * | 2018-09-28 | 2020-04-02 | Taiwan Semiconductor Manufacturing Company, Ltd. | Integrated circuit design using fuzzy machine learning |
US11392748B2 (en) * | 2018-09-28 | 2022-07-19 | Taiwan Semiconductor Manufacturing Company, Ltd. | Integrated circuit design using fuzzy machine learning |
US11748552B2 (en) | 2018-09-28 | 2023-09-05 | Taiwan Semiconductor Manufacturing Company, Ltd. | Integrated circuit design using fuzzy machine learning |
US20230359806A1 (en) * | 2018-09-28 | 2023-11-09 | Taiwan Semiconductor Manufacturing Company, Ltd. | Integrated circuit design using fuzzy machine learning |
Also Published As
Publication number | Publication date |
---|---|
US7065727B2 (en) | 2006-06-20 |
WO2002086772A3 (en) | 2003-11-06 |
WO2002086772A2 (en) | 2002-10-31 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US5402358A (en) | Method and structure for the automated design of analog integrated circuits | |
Director et al. | Statistical integrated circuit design | |
US7065727B2 (en) | Optimal simultaneous design and floorplanning of integrated circuit | |
JP3670553B2 (en) | Semiconductor integrated circuit analyzing apparatus, semiconductor integrated circuit analyzing method, and recording medium recording program for executing semiconductor integrated circuit analyzing method | |
US20200380192A1 (en) | Automated circuit generation | |
US6611951B1 (en) | Method for estimating cell porosity of hardmacs | |
Toumazou et al. | Analog IC design automation. I. Automated circuit generation: new concepts and methods | |
US6532572B1 (en) | Method for estimating porosity of hardmacs | |
US6385761B1 (en) | Flexible width cell layout architecture | |
JPH07501906A (en) | Computer-aided design method and apparatus for multilevel interconnect technology | |
US6560753B2 (en) | Integrated circuit having tap cells and a method for positioning tap cells in an integrated circuit | |
CN112908989B (en) | Semiconductor layout structure and design method thereof | |
US6550046B1 (en) | Method for automated placement of cells in an integrated circuit layout | |
US6209119B1 (en) | Apparatus and method for synthesizing module | |
US20040010764A1 (en) | Analog integrated circuit layout design | |
US20060286691A1 (en) | Capacitance modeling | |
DE112010006043T5 (en) | Apparatus and method for optimized power cell synthesizers | |
US20030131318A1 (en) | Reducing cell library development cycle time | |
US7735048B1 (en) | Achieving fast parasitic closure in a radio frequency integrated circuit synthesis flow | |
US6968524B2 (en) | Method and apparatus to optimize an integrated circuit design using transistor folding | |
Zhang et al. | A genetic approach to analog module placement with simulated annealing | |
JP2872990B2 (en) | Integrated circuit layout design apparatus, transistor size determination apparatus, circuit characteristic evaluation method, and transistor size determination method | |
Cong et al. | Exploiting signal flow and logic dependency in standard cell placement | |
Mathias et al. | FLAG: A flexible layout generator for analog MOS transistors | |
Guardiani et al. | Yield optimization of analog ics using two-step analytic modeling methods |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: BARCELONA DESIGN, INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:HASSIBI, ARASH;HENTZ, ANDRE;HERSHENSON MAR;REEL/FRAME:011754/0942;SIGNING DATES FROM 20010414 TO 20010423 |
|
AS | Assignment |
Owner name: BARCELONA DESIGN, INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:BOYD, STEPHEN;REEL/FRAME:016693/0881 Effective date: 20040926 |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
AS | Assignment |
Owner name: SABIO LABS, INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:BARCELONA DESIGN, INC.;REEL/FRAME:019062/0574 Effective date: 20070309 |
|
AS | Assignment |
Owner name: MAGMA DESIGN AUTOMATION, INC., CALIFORNIA Free format text: MERGER;ASSIGNOR:SABIO LABS, INC.;REEL/FRAME:021658/0535 Effective date: 20071220 |
|
FPAY | Fee payment |
Year of fee payment: 4 |
|
AS | Assignment |
Owner name: WELLS FARGO CAPITAL FINANCE, LLC,CALIFORNIA Free format text: SECURITY AGREEMENT;ASSIGNOR:MAGMA DESIGN AUTOMATION, INC.;REEL/FRAME:024120/0809 Effective date: 20100319 Owner name: WELLS FARGO CAPITAL FINANCE, LLC, CALIFORNIA Free format text: SECURITY AGREEMENT;ASSIGNOR:MAGMA DESIGN AUTOMATION, INC.;REEL/FRAME:024120/0809 Effective date: 20100319 |
|
AS | Assignment |
Owner name: SYNOPSYS, INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MAGMA DESIGN AUTOMATION LLC;REEL/FRAME:028323/0064 Effective date: 20120518 Owner name: MAGMA DESIGN AUTOMATION LLC, DELAWARE Free format text: CHANGE OF NAME;ASSIGNOR:MAGMA DESIGN AUTOMATION, INC.;REEL/FRAME:028323/0056 Effective date: 20120222 |
|
FPAY | Fee payment |
Year of fee payment: 8 |
|
AS | Assignment |
Owner name: SYNOPSYS, INC., CALIFORNIA Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:WELLS FARGO CAPITAL FINANCE, LLC;REEL/FRAME:040607/0632 Effective date: 20161031 |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1553) Year of fee payment: 12 |