Methods for cell phasing and placement in dynamic array architecture and implementation of the same

Information

  • Patent Grant
  • 8966424
  • Patent Number
    8,966,424
  • Date Filed
    Friday, September 27, 2013
    11 years ago
  • Date Issued
    Tuesday, February 24, 2015
    9 years ago
Abstract
A semiconductor chip is defined to include a logic block area having a first chip level in which layout features are placed according to a first virtual grate, and a second chip level in which layout features are placed according to a second virtual grate. A rational spatial relationship exists between the first and second virtual grates. A number of cells are placed within the logic block area. Each of the number of cells is defined according to an appropriate one of a number of cell phases. The appropriate one of the number of cell phases causes layout features in the first and second chip levels of a given placed cell to be aligned with the first and second virtual grates as positioned within the given placed cell.
Description
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is also related to U.S. patent application Ser. No. 11/683,402, filed on Mar. 7, 2007, and entitled “Dynamic Array Architecture.” This application is also related to U.S. patent application Ser. No. 12/013,356, filed on Jan. 11, 2008, and entitled “Methods for Designing Semiconductor Device with Dynamic Array Section.” This application is also related to U.S. patent application Ser. No. 12/013,366, filed on Jan. 11, 2008, and entitled “Methods for Defining Dynamic Array Section with Manufacturing Assurance Halo and Apparatus Implementing the Same.” The disclosures of the above-identified patent applications are incorporated herein by reference.


BACKGROUND

In modern semiconductor chip (“chip”) design, standard cells are placed on the chip to define a particular logic function. To ensure that each standard cell will be manufacturable when arbitrarily placed on the chip, each standard cell is defined to have an edge exclusion zone sized equal to one-half of a design rule (DR) spacing requirement between adjacent conductive features. In this manner, when any two standard cells are placed next to each other, their combined exclusion zone sizes at their interfacing boundaries will equal at least the DR spacing requirement between adjacent conductive features. Thus, the exclusion zone enables features to be placed arbitrarily within a standard cell without concern for cell-to-cell interface problems. However, when many standard cells are placed together on the chip, the edge exclusion zones associated with the standard cells can combine to occupy an expensive amount of chip area.


In view of the foregoing, it is of interest to optimize cell layout and placement such that chip area and routing resources can be most efficiently utilized, particularly when cells are defined according to a constrained layout architecture.


SUMMARY

In one embodiment, a semiconductor chip is disclosed. The semiconductor chip includes a logic block area. The logic block area includes a first chip level in which layout features are placed according to a first virtual grate. The logic block area also includes a second chip level in which layout features are placed according to a second virtual grate. A rational spatial relationship exists between the first and second virtual grates. A number of cells are placed within the logic block area. Each of the number of cells is defined according to an appropriate one of a number of cell phases. The appropriate cell phase causes layout features in the first and second chip levels of a given placed cell to be aligned with the first and second virtual grates as positioned within the given placed cell.


In another embodiment, a method is disclosed for defining cell variants of different cell phase to enable placement of cells within a designated area of a semiconductor chip. The method includes an operation for identifying a phase space for the designated area of the semiconductor chip. The phase space is defined as a distance extending perpendicularly between successive occurrences of a same relationship between the two virtual grates that have a rational spatial relationship within the designated area of the semiconductor chip. The method also includes an operation for aligning a left boundary of a subject cell with a left edge of the phase space. With the left boundary of the subject cell aligned with the left edge of the phase space, an operation is performed to define a first phase of the subject cell based on locations of the two virtual grates relative to the left boundary of the subject cell. The first phase of the subject cell is stored in a cell library. The method further includes an operation for moving the left boundary of the subject cell from its current position across the phase space to a next possible location of the left boundary of the subject cell within the phase space. With the left boundary of the subject cell aligned with the next possible location, an operation is performed to define a next phase of the subject cell based on locations of the two virtual grates relative to the left boundary of the subject cell. The next phase of the subject cell is stored in the cell library. The method continues by moving the left boundary of the subject cell to each of its possible locations within the phase space, and by defining and storing a different phase of the subject cell at each possible location of the left boundary of the subject cell within the phase space.


In another embodiment, a method is disclosed for placing cells within a designated area of a semiconductor chip. The method includes an operation for defining respective virtual grates for each of two phased chip levels within the designated area of the semiconductor chip. The virtual grates of the two phased chip levels are defined to have a rational spatial relationship. The method also includes an operation for placing cells within the designated area of the semiconductor chip. The method further includes an operation for determining a required cell phase for each placed cell within the designated area of the semiconductor chip. For each placed cell within the designated area of the semiconductor chip, an operation is performed to substitute a variant of the placed cell having the required cell phase, such that layout features in each of the two phased chip levels within the substituted variant of the placed cell align with the virtual grates of the two phased chip levels.


In one embodiment, a computer readable storage medium is disclosed to include a semiconductor chip layout recorded in a digital format. The semiconductor chip layout includes a logic block area including a first chip level in which layout features are placed according to a first virtual grate. The semiconductor chip layout also includes a second chip level in which layout features are placed according to a second virtual grate. A rational spatial relationship exists between the first and second virtual grates. The semiconductor chip layout further includes a number of cells placed within the logic block area. Each of the number of cells is defined according to an appropriate one of a number of cell phases. The appropriate one of the number of cell phases causes layout features in the first and second chip levels of a given placed cell to be aligned with the first and second virtual grates as positioned within the given placed cell.


In one embodiment, a cell library stored in a digital format on a computer readable storage medium is disclosed. The cell library includes a plurality of cell layouts corresponding to different phases of a given cell. The given cell includes at least one chip level in which layout features are placed in accordance with a virtual grate. The virtual grate is defined by a set of parallel equally spaced virtual lines extending across the cell layout. Each different phase of the given cell is defined by a different spacing between a reference cell boundary and a nearest virtual line of the virtual grate.


Other aspects and advantages of the invention will become more apparent from the following detailed description, taken in conjunction with the accompanying drawings, illustrating by way of example the present invention.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1A is an illustration showing a semiconductor chip defined to include a logic block, in accordance with one embodiment of the present invention;



FIG. 1B is an illustration showing placement of cells in the logic block, in accordance with one embodiment of the present invention;



FIG. 2A is an illustration showing the logic block area of the chip having two separate virtual grates defined thereover, in accordance with one embodiment of the present invention;



FIG. 2B is an illustration showing the exemplary logic block in conjunction with the gate level and M2 level virtual grates, which are indexed to the origin at the lower-left corner of the logic block, in accordance with one embodiment of the present invention;



FIG. 2C is an illustration showing the cell placement of FIG. 2B, with an appropriate cell variant substituted for each cell based on the required cell phasing for the various cell placements within the logic block, in accordance with one embodiment of the present invention;



FIGS. 3A-3H are illustrations showing different cell phases that may exist for a cell placed in the logic block of FIG. 2A, in accordance with one embodiment of the present invention;



FIGS. 3I-3P are illustrations showing different cell phases in which virtual grates are phased with each other without actually aligning with each other, in accordance with one embodiment of the present invention;



FIG. 4 is an illustration showing Row 1 of the logic block of FIG. 2C, with exemplary gate level and M2 level layout shapes depicted for each cell therein, in accordance with one embodiment of the present invention;



FIG. 5 is an illustration showing a flowchart of a method for defining cell variants of differing cell phase to enable placement of cells within an area on a semiconductor chip defined according to a dynamic array architecture, in accordance with one embodiment of the present invention;



FIG. 6 is an illustration showing a flowchart of a method for placing cells within a portion of a semiconductor chip defined according to a dynamic array architecture, in accordance with one embodiment of the present invention;



FIG. 7 is an illustration showing an example of different phasings in a second interconnect level of adjacently disposed logic cells defined within a DAS, in accordance with one embodiment of the present invention;



FIG. 8 shows an example of virtual lines defined within the dynamic array architecture, in accordance with one embodiment of the present invention; and



FIG. 9 shows a computer readable medium, in accordance with one embodiment of the present invention.





DETAILED DESCRIPTION

In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be apparent, however, to one skilled in the art that the present invention may be practiced without some or all of these specific details. In other instances, well known process operations have not been described in detail in order not to unnecessarily obscure the present invention.



FIG. 1A is an illustration showing a semiconductor chip (“chip”) 101 defined to include a logic block 103, in accordance with one embodiment of the present invention. The logic block 103 includes integrated circuit devices in the form of multi-level structures defined on a silicon substrate of the chip 101. At a substrate level, transistor devices with diffusion regions are formed. In subsequent levels, interconnect metallization lines are patterned and electrically connected to the transistor devices to define a desired integrated circuit device. Also, patterned conductive layers are insulated from other conductive layers by dielectric materials. The structural features used to define the diffusion regions, transistor devices, metallization lines, interconnects, etc. within each level of the chip 101 are defined according to a specified layout. Additionally, the global layout for a given level of the chip 101 may be segmented into many small layout areas, where each layout area is associated with a given logic construct. Moreover, layout areas within multiple levels of the chip 101 within a given vertical column of the chip 101 can be integrated together to form a logic unit referred to as a cell.


A cell, as referenced herein, represents an abstraction of a logic function, and encapsulates lower-level integrated circuit layouts for implementing the logic function. It should be understood that a given logic function can be represented by multiple cell variations, wherein the cell variations may be differentiated by feature size, performance, and process compensation technique (PCT) processing. For example, multiple cell variations for a given logic function may be differentiated by power consumption, signal timing, current leakage, chip area, OPC (optical proximity correction), RET (reticle enhancement technology), etc. It should also be understood that each cell description includes the layouts for the cell in each level of a chip within the associated vertical column of the chip, as required to implement the logic function of the cell. More specifically, a cell description includes layouts for the cell in each level of the chip extending from the substrate level up through a particular interconnect level.


In one embodiment, the logic block 103 is defined by placing a number of cells of various logic function in rows within the logic block 103. For example, consider that a number of cells A-Z are available for use within the logic block 103, where each of cells A-Z is defined to perform a different logic function. In this exemplary embodiment, the logic block 103 may be defined by placement of cells A-Z within rows 1-10 of the logic block 103, as shown in FIG. 1B. In this exemplary embodiment, the width of the cells as measured from left-to-right across a given row can vary from cell-to-cell. However, the height of the cells as measured vertically within a given row is essentially the same from cell-to-cell, thereby allowing the logic block 103 to be populated by adjacently defined rows of cells of consistent height. Also, in some embodiments, the height of cells may vary from row-to-row and/or within a row.


A dynamic array architecture represents a semiconductor device design paradigm in which layout features are defined along a regular-spaced virtual grate (or regular-spaced virtual grid) in a number of levels of a cell, i.e., in a number of levels of a semiconductor chip, such as chip 101. The virtual grate is defined by a set of equally spaced, parallel virtual lines extending across a given level in a given chip area. The equal spacing, as measured perpendicularly between adjacent virtual lines of the virtual grate, is defined as the virtual grate pitch. For example, FIG. 2A shows the logic block 103 area of the chip 101 having two separate virtual grates defined thereover, in accordance with one embodiment of the present invention. More specifically, one virtual grate is defined over the logic block 103 for the gate level of the chip 101, and another virtual grate is defined over the logic block 103 for the second interconnect level (M2 level) of the chip 101.


In one embodiment, the virtual grate of a given level is oriented to be substantially perpendicular to the virtual grate of an adjacent level. For example, in this embodiment, a virtual grate for the first interconnect level (M1 level) (not shown) extends in a direction perpendicular to both the gate level and M2 level virtual grates. However, it should be appreciated, that in some embodiments, the virtual grate of a given level may be oriented either perpendicular or parallel to the virtual grate of an adjacent level.


In one embodiment, each virtual grate within various levels of the chip is indexed to an origin of a single coordinate system. Therefore, the coordinate system enables control of a spatial relationship between the virtual grates within the various levels of the chip. For example, in the exemplary embodiment of FIG. 2A, each of the gate level and M2 level virtual grates is indexed to an origin (0,0) of a coordinate system, where the origin (0,0) is located at a lower-left corner of the logic block 103 area on the chip 101. It should be understood that the origin (0,0) of the coordinate system can be located at any location on the chip 101, and is not required to be located at a particular position of a logic block in which cells are to be placed (e.g., at the lower-left corner of the logic block 103). Also, it should be understood that indexing of a virtual grate to a given spatial location means that the virtual grate is defined such that one of its virtual lines passes through the given spatial location.


The spatial relationship between virtual grates in various levels of the chip can be defined in essentially any number of ways. However, the spatial relationship between commonly oriented (i.e., parallel in direction of extent across the chip) virtual grates can be defined by a rational number, such that the virtual grates align with each other at a particular spatial frequency. Specifically, for any two virtual grates that are indexed to the origin of the same coordinate system, a ratio of their virtual grate pitches can be defined by a rational number, such that the two virtual grates align at a particular spatial frequency. For example, FIG. 2A shows that the spatial relationship between the M2 level and gate level virtual grates is defined by a M2 level-to-gate level virtual grate pitch ratio of 4/3. Thus, the M2 level and gate level virtual grates align with each other at every fourth gate level virtual grate line relative to the origin (0,0). Two virtual grates that are commonly oriented, indexed to a common spatial location, and have the ratio of their virtual grate pitches defined by a rational number are considered to have a rational spatial relationship.



FIG. 8 shows an example of virtual lines 801A-801E defined within the dynamic array architecture, in accordance with one embodiment of the present invention. Virtual lines 801A-801E extend across the layout in a parallel manner, with a perpendicular spacing therebetween equal to a specified pitch 807. For illustrative purposes, complementary diffusion regions 803 and 805 are shown in FIG. 8. It should be understood that the diffusion regions 803 and 805 are defined in a diffusion level below a gate level. Also, it should be understood that the diffusion regions 803 and 805 are provided by way of example and in no way represent any limitation on diffusion region size, shape, and/or placement within the diffusion level relative to the dynamic array architecture.


Within the dynamic array architecture, a feature layout channel is defined about a given virtual line so as to extend between virtual lines adjacent to the given virtual line. For example, feature layout channels 801A-1 through 801E-1 are defined about virtual lines 801A through 801E, respectively. It should be understood that each virtual line has a corresponding feature layout channel. Also, for virtual lines positioned adjacent to an edge of a prescribed layout space, e.g., adjacent to a cell boundary, the corresponding feature layout channel extends as if there were a virtual line outside the prescribed layout space, as illustrated by feature layout channels 801A-1 and 801E-1. It should be further understood that each feature layout channel is defined to extend along an entire length of its corresponding virtual line.



FIG. 8 further shows a number of exemplary layout features 809-823 defined in accordance with the feature layout channels 801A-1 through 801E-1 corresponding to virtual lines 801A through 801E, respectively. Within the dynamic array architecture, layout features associated with a given virtual line are defined within the feature layout channel associated with the virtual line. Also, physical contact is prohibited between layout features defined in feature layout channels that are associated with adjacent virtual lines.


A contiguous layout feature can include both a portion which defines an active part of a circuit, and a portion that does not define a part of the circuit. For example, in the gate level, a contiguous layout feature can extend over both a diffusion region and a dielectric region of an underlying chip level. In one embodiment, each portion of a gate level layout feature that forms a gate electrode of a transistor is positioned to be substantially centered upon a given virtual line. Furthermore, in this embodiment, portions of the gate level layout feature that do not form a gate electrode of a transistor can be positioned within the feature layout channel associated with the given virtual line. Therefore, a given gate level layout feature can be defined essentially anywhere within a feature layout channel, so long as gate electrode portions of the given gate level layout feature are centered upon the virtual line corresponding to the given feature layout channel, and so long as the given gate level layout feature complies with design rule spacing requirements relative to other gate level layout features in adjacent feature layout channels.


As shown in FIG. 8, the layout feature 809 is defined within the feature layout channel 801A-1 associated with virtual line 801A. Some portions of layout feature 809 are substantially centered upon the virtual line 801A. Also, other portions of layout feature 809 maintain design rule spacing requirements with layout features 811 and 813 defined within adjacent feature layout channel 801B-1. Similarly, layout features 811-823 are defined within their respective feature layout channel, and include portions substantially centered upon the virtual line corresponding to their respective feature layout channel. Also, it should be appreciated that each of layout features 811-823 maintains design rule spacing requirements with layout features defined within adjacent feature layout channels, and avoids physical contact with any other layout feature defined within adjacent feature layout channels.


As illustrated by the example feature layout channels 801A-1 through 801E-1 of FIG. 8, each feature layout channel is associated with a given virtual line and corresponds to a layout region that extends along the given virtual line and perpendicularly outward in each opposing direction from the given virtual line to a closest of either an adjacent virtual line or a virtual line outside a layout boundary. Also, it should be understood that each layout feature is defined within its feature layout channel without physically contacting another layout feature defined within an adjoining feature layout channel.


Some layout features may have one or more contact head portions defined at any number of locations along their length. A contact head portion of a given layout feature is defined as a segment of the layout feature having a height and a width of sufficient size to receive a contact structure, wherein “width” is defined across the substrate in a direction perpendicular to the virtual line of the given layout feature, and wherein “height” is defined across the substrate in a direction parallel to the virtual line of the given layout feature. It should be appreciated that a contact head of a layout feature, when viewed from above, can be defined by essentially any layout shape, including a square or a rectangle. Also, depending on layout requirements and circuit design, a given contact head portion of a layout feature may or may not have a contact defined thereabove.


In one embodiment, the layout features are defined to provide a finite number of controlled layout shape-to-shape lithographic interactions which can be accurately predicted and optimized for in manufacturing and design processes. In this embodiment, the layout features are defined to avoid layout shape-to-shape spatial relationships which would introduce adverse lithographic interaction within the layout that cannot be accurately predicted and mitigated with high probability. However, it should be understood that changes in direction of layout features within their feature layout channels are acceptable when corresponding lithographic interactions are predictable and manageable.


In one embodiment, each layout feature of a given level is substantially centered upon one of the virtual lines of the virtual grate associated with the given level. A layout feature is considered to be substantially centered upon a particular line of a virtual grate when a deviation in alignment between of the centerline of the layout feature and the particular line of the virtual grate is sufficiently small so as to not reduce a manufacturing process window from what would be achievable with a true alignment between of the centerline of the layout feature and the line of the virtual grate. Therefore, in this embodiment, layout features placed in different chip levels according to virtual grates of rational spatial relationship will be aligned at a spatial frequency defined by the rational spatial relationship. In one embodiment, the above-mentioned manufacturing process window is defined by a lithographic domain of focus and exposure that yields an acceptable fidelity of the layout feature. In one embodiment, the fidelity of a layout feature is defined by a characteristic dimension of the layout feature.


In the dynamic array architecture, variations in a vertical cross-section shape of an as-fabricated layout feature can be tolerated to an extent, so long as the variation in the vertical cross-section shape is predictable from a manufacturing perspective and does not adversely impact the manufacture of the given layout feature or its neighboring layout features. In this regard, the vertical cross-section shape corresponds to a cut of the as-fabricated layout feature in a plane perpendicular to both the centerline of the layout feature and the substrate of the chip. It should be appreciated that variation in the vertical cross-section of an as-fabricated layout feature along its length can correspond to a variation in width of the layout feature along its length. Therefore, the dynamic array architecture also accommodates variation in the width of an as-fabricated layout feature along its length, so long as the width variation is predictable from a manufacturing perspective and does not adversely impact the manufacture of the layout feature or its neighboring layout features.


Additionally, different layout features within a given level can be designed to have the same width or different widths. Also, the widths of a number of layout features defined along adjacent lines of a given virtual grate can be designed such that the number of layout features contact each other so as to form a single layout feature having a width equal to the sum of the widths of the number of layout features.


Within a given level defined according to the dynamic array architecture, proximate ends of adjacent, co-aligned linear-shaped layout features may be separated from each other by a substantially uniform gap. More specifically, adjacent ends of linear-shaped layout features defined along a common line of a virtual grate are separated by an end gap, and such end gaps within the level associated with the virtual grate may be defined to span a substantially uniform distance. Additionally, in one embodiment, a size of the end gaps is minimized within a manufacturing process capability so as to optimize filling of a given level with linear-shaped layout features.


Also, in the dynamic array architecture, a level can be defined to have any number of virtual grate lines occupied by any number of layout features. In one example, a given level can be defined such that all lines of its virtual grate are occupied by at least one layout feature. In another example, a given level can be defined such that some lines of its virtual grate are occupied by at least one layout feature, and other lines of its virtual grate are vacant, i.e., not occupied by any layout features. Furthermore, in a given level, any number of successively adjacent virtual grate lines can be left vacant. Also, the occupancy versus vacancy of virtual grate lines by layout features in a given level may be defined according to a pattern or repeating pattern across the given level.


Additionally, within the dynamic array architecture, vias and contacts are defined to interconnect a number of the layout features in various levels so as to form a number of functional electronic devices, e.g., transistors, and electronic circuits. Layout features for the vias and contacts can be aligned to a virtual grid, wherein a specification of this virtual grid is a function of the specifications of the virtual grates associated with the various levels to which the vias and contacts will connect. Thus, a number of the layout features in various levels form functional components of an electronic circuit. Additionally, some of the layout features within various levels may be non-functional with respect to an electronic circuit, but are manufactured nonetheless so as to reinforce manufacturing of neighboring layout features.


It should be understood that the dynamic array architecture is defined to enable accurate prediction of semiconductor device manufacturability with a high probability, even when layout features of the semiconductor device are sized smaller than a wavelength of light used to render the layout features in a lithographic manufacturing process. Additionally, it should be understood that the dynamic array architecture is defined by placement of layout features on a regular-spaced grate (or regular-spaced grid) in a number of levels of a cell, such that layout features in a given level of the cell are confined within their feature layout channel, and such that layout features in adjacent feature layout channels do not physically contact each other. Furthermore, it should be understood that the dynamic array architecture can be applied to one or more chip levels. For example, in one embodiment, only the gate level of the chip is defined according to the dynamic array architectures. In another embodiment, the gate level and one or more interconnect levels are defined according to the dynamic array architecture.


With reference back to FIG. 1B, the exemplary logic block 103 is defined by placement of cells A-Z within rows 1-10. FIG. 2B is an illustration showing the exemplary logic block 103 in conjunction with the gate level and M2 level virtual grates, which are indexed to the origin (0,0) at the lower-left corner of the logic block 103. In one embodiment of the dynamic array architecture, in order for each of cells A-Z to be placeable within the logic block 103, each of cells A-Z should be defined based on use of the gate level and M2 level virtual grates of the logic block 103. However, depending on where a cell is placed in the logic block 103, a position of the gate level and M2 level virtual grates may vary within the boundaries of the cell, and relative to the boundaries of the cell. For example, a distance between the left boundary of the cell and the nearest gate level virtual grate line within the cell can vary between different positions of the cell in the logic block 103. Similarly, a distance between the left boundary of the cell and the nearest M2 level virtual grate line within the cell can vary between different positions of the given cell in the logic block 103.


Each cell placed within the logic block 103 should have its cell-based gate level and M2 level virtual grates aligned with the gate level and M2 level virtual grates of the logic block 103. Because the position of the gate level and M2 level virtual grates of the logic block 103 can vary within a given cell depending on where the given cell is placed in the logic block 103, it is necessary to have different versions of the given cell available for placement in the logic block 103, such that at least one version of the given cell is defined to have its gate level and M2 level virtual grates respectively align with the gate level and M2 level virtual grates of the logic block 103.


Generally speaking, each cell is defined to have a width that is an integer multiple of either a virtual grate pitch, or one-half of a virtual grate pitch, to enable alignment of the cell boundaries to either a virtual grate line or a midpoint between adjacent virtual grate lines. In one embodiment, each cell is defined to have a width that is an integer multiple of one-half of the gate level virtual grate pitch. In another embodiment, each cell is defined to have a width that is an integer multiple of the gate level virtual grate pitch. Additionally, each cell can be placed in the logic block 103 such that its left cell boundary is aligned with either a gate level virtual grate line or a midpoint between adjacent gate level virtual grate lines. Therefore, when the cell width is an integer multiple of one-half of the gate level virtual grate pitch, the right cell boundary will also be aligned with either a gate level virtual grate line or a midpoint between adjacent gate level virtual grate lines. For ease of discussion, placement of a cell such that its left cell boundary is aligned with either a gate level virtual grate line or a midpoint between adjacent gate level virtual grate lines is referred to as placement of the cell on the gate level virtual grate half-pitch.


Placement of cells on the gate level virtual grate half-pitch in combination with the rational spatial relationship between the gate level and M2 level virtual grates enables creation of a finite number of layout variations for a given cell, such that a suitable layout variation for the given cell is available for each possible combination of gate level and M2 level virtual grate placements that may occur within the given cell, depending upon where the given cell is placed in the logic block 103. In this regard, each layout variation for a given cell defines a cell phase, wherein each cell phase is defined by a different combination of gate level and M2 level virtual grate placements within the given cell relative to a reference boundary of the given cell, e.g., relative to the left boundary of the given cell.


It should be understood that in the above-described embodiment, the width of each cell is an integer multiple of the gate level virtual grate half-pitch, but not necessarily an integer multiple of the M2 level virtual grate pitch. Therefore, although the left and right cell boundaries will align with the gate level virtual grate, the left and right cell boundaries may not always align with the M2 level virtual grate. However, the cell phasing methods described herein allow for placement of active M2 level layout shapes on the M2 level virtual grate. Therefore, the cell phasing and cell placement methods described herein, in conjunction with the dynamic array architecture, serve to optimize routing resources by not having an M2 level layout shape placed between adjacent M2 level virtual grate lines so as to consume the two adjacent M2 level virtual grate lines with one M2 level layout shape.



FIGS. 3A-3H illustrate different cell phases that may exist for a cell placed under the following conditions:

    • 1. The cell is placed in a logic block defined according to the dynamic array architecture where the rational spatial relationship between the M2 level and gate level virtual grates is defined by a M2 level-to-gate level virtual grate pitch ratio of 4/3;
    • 2. The cell is placed on the gate level virtual grate half-pitch; and
    • 3. The cell width is an integer multiple of one-half of the gate level virtual grate pitch.


It should be understood that the cell phasing principles illustrated in FIGS. 3A-3H can be applied to any combination of commonly oriented chip levels (i.e., beyond the illustrated gate and M2 levels) having any rational spatial relationship (i.e., beyond the 4/3 M2-to-gate pitch ratio), so long as the virtual grates of the logic block that are associated with the cell phasing are indexed to a common spatial location.



FIG. 3A shows a first phase (ph1) of a cell 300. The cell 300 includes a left cell boundary 301. The cell 300 is defined by a gate level virtual grate represented by commonly oriented solid lines, and by a M2 level virtual grate represented by commonly oriented dashed lines. The pitch ratio between the M2 level and gate level virtual grates is 4/3. Therefore, the M2 level and gate level virtual grate will align with each other at every fourth gate level virtual grate line. The number of gate level virtual grate lines between alignment of the gate level and M2 level virtual grates defines a phase space 303. Generally speaking, a phase space is defined as a distance extending perpendicularly between successive occurrences of a same relationship between the two virtual grates that have a rational spatial relationship. In the exemplary embodiment of FIGS. 3A-3H the successive occurrences of a same relationship between the two virtual grates that have a rational spatial relationship correspond to successive alignments of the two virtual grates that have the rational spatial relationship.


Each cell phase is associated with a different allowed position of the left cell boundary 301 (e.g., reference cell boundary) within the phase space 303. In the example of FIGS. 3A-3H, the left cell boundary 301 can be placed on the gate level virtual grate half-pitch. Therefore, the left cell boundary 301 can be placed on each gate level virtual grate line within the phase space 303, and at the midpoint between adjacent gate level virtual grate lines within the phase space 303. Therefore, because the phase space 303 covers four gate level virtual grate pitches and because the cell can be placed on the gate level virtual grate half-pitch, the number of possible cell phases is eight. In FIGS. 3A-3H, the position of the left cell boundary 301 for each of the eight possible cell phases is identified by a respective arrow labeled ph1-ph8. Because the gate level and M2 level virtual grates are associated with the logic block 103, their respective positions remain unchanged in each of FIGS. 3A-3H as the left cell boundary 301 is shifted through the eight possible phases (ph1-ph8).


It should be understood that the eight possible cell phases of FIGS. 3A-3H are a result of the particular specifications of the exemplary embodiment. For example, in another embodiment, if the phase space 303 covered four gate level virtual grate pitches, but the cell could only be placed on the gate level virtual grate (whole) pitch, the number of possible cell phases would be four instead of eight, and would correspond to cell phases (ph1, ph3, ph5, ph7) as shown in FIGS. 3A-3H.


Generally speaking, a cell phase is defined by a combination of index values for each of the chip levels associated with the phasing. The index value for a given chip level as used in defining a cell phase represents a distance measured perpendicularly between the left boundary of the cell and the nearest virtual line of the given chip level's virtual grate. It should be understood that each phased chip level of a given cell has a corresponding index value. Also, it should be understood that a phased chip level of a cell is any chip level of the cell defined by a virtual grate that has a rational spatial relationship with a virtual grate of at least one other chip level of the cell. Also, as previously discussed, a rational spatial relationship exists between two chip levels when each of the two chip levels is defined by commonly oriented virtual grates that are indexed to a common spatial location, and have the ratio of their virtual grate pitches defined by a rational number. In the exemplary embodiment of FIGS. 3A-3H, each cell phase (ph1-ph8) is defined by two index values: 1) Gindex, and 2) M2index, where Gindex is the index value for the gate level and M2index is the index value for the M2 level. As shown in FIGS. 3A-3H, each phase is defined by a unique combination of Gindex and M2index values.


The cell phasing example illustrated by FIGS. 3A-3H is based on a virtual grate phasing relationship in which the two virtual grates are indexed to periodically align with each other according to their rational spatial relationship. It should be understood, however, that in some embodiments, virtual grates can be phased with each other without actually aligning with each other. For example, FIGS. 3I-3P illustrate another embodiment in which the pitch ratio between the M2 level and gate level virtual grates is 4/3, and in which the M2 level virtual grate is indexed in an offset relationship with the gate level virtual grate, such that the M2 level and gate level virtual grates do not align with each other at any phase. The same concepts described with regard to FIGS. 3A-3H also apply to FIGS. 3I-3P. Generally speaking, it should be understood that the phase space 303′ in FIGS. 3I-3P is defined over an area between extending successive occurrences of a same relationship between the phased virtual grates. Specifically, at phase (ph1′) the index value for the gate level is given by Gindex=0, and the index value for the M2 level is given by M2index=(⅙)*Gpitch. Therefore, the phase space 303′ extends to a location where the phase (ph1′) reoccurs, i.e., where Gindex=0 and M2index=(⅙)*Gpitch. For ease of discussion, the remainder of the description herein is provided with reference to the phasing as illustrated in FIGS. 3A-3H.


In one embodiment, a cell library is compiled to include a number of different cells defined in accordance with the dynamic array architecture, and further defined based on a particular rational spatial relationship between particular chip levels. For example, with respect to the logic block 103 embodiment of FIGS. 2A-2B, a cell library can be compiled to include cells A-Z, where each of cells A-Z is defined in accordance with the dynamic array architecture, and is further defined based on a rational spatial relationship of 4/3 between the virtual grate pitches of the M2 level and the gate level. To ensure that gate level and M2 level layouts of each cell in the library can be aligned with the gate level and M2 level virtual grates of the logic block 103, regardless of cell placement within the logic block, the cell library should include variants of each cell that respectively correspond to each possible cell phase. Therefore, with regard to the embodiment of FIGS. 2A-2B, the cell library should include eight different cell variants (one for each cell phase) for each of cells A-Z. Variants of cells A-Z for cell phases 1 through 8 may be identified as A-ph1, A-ph 2, . . . Z-ph7, Z-ph8.


In one embodiment, cells may be first placed in the logic block 103 without regard to cell phasing, as shown in FIG. 2B. Then, each placed cell can be replaced by an appropriate variant corresponding to the required cell phase based on its exact position in the logic block 103, relative to the gate level and M2 level virtual grates of the logic block 103. In another embodiment, appropriate cell variants corresponding to the required cell phasing can be determined when the cells are initially placed in the logic block 103. FIG. 2C shows the cell placement of FIG. 2B, with an appropriate cell variant substituted for each cell based on the required cell phasing for the various cell placements within the logic block 103.


As previously discussed, each cell phase is defined by the combination of index values for the phased chip levels. Therefore, in order to determine the appropriate cell phase to be used for a given cell placement, the index values for the phased chip levels of the placed cell are calculated. Then, the calculated index values for the phased chip levels of the placed cell are compared to the index values of the various cell phases to identify the matching cell phase. The matching cell phase of the placed cell is then substituted for the placed cell.


For example, in the embodiment of FIG. 2B, each cell phase is defined by the combination of the gate level index value (Gindex) and the M2 level index value (M2index). Therefore, in order to determine the appropriate cell phase to be used for a given cell placement, the Gindex and the M2index values for the placed cell are calculated. Then, the calculated Gindex and M2index values for the placed cell are compared to the Gindex and M2index values of the various cell phases to identify the matching cell phase. Then, the matching cell phase of the placed cell is substituted for the originally placed cell.


To illustrate further, consider the leftmost placed cell A of Row 1 in the logic block 103 of FIG. 2B as the subject cell. The Gindex value of the subject cell is calculated to be zero, i.e., the left cell boundary 301 is aligned with the gate level virtual grate. The M2index value of the subject cell is calculated to be zero, i.e., the left cell boundary 301 is aligned with the M2 level virtual grate. The calculated index values of the subject cell (Gpitch=0, and M2index=0) match the index values of cell phase 1, as shown in FIG. 3A. Therefore, cell phase 1 should be used for the subject cell, as indicated by corresponding cell A-ph1 in Row 1 of FIG. 2C.


To illustrate further, consider the rightmost placed cell U of Row 4 in the logic block 103 of FIG. 2B as the subject cell. The Gindex value of the subject cell is calculated to be ((½)*Gpitch), wherein Gpitch is the gate level virtual grate pitch. The M2index value of the subject cell is calculated to be ((⅙)*Gpitch). The calculated index values of the subject cell (Gpitch=((½)*Gpitch), and M2index=((⅙)*Gpitch)) match the index values of cell phase 6, as shown in FIG. 3F. Therefore, cell phase 6 should be used for the subject cell, as indicated by corresponding cell U-ph6 in Row 4 of FIG. 2C.



FIG. 4 shows Row 1 of the logic block 103 of FIG. 2C, with exemplary gate level and M2 level layout shapes depicted for each cell therein. Due to specification of the appropriate cell phase for each cell in Row 1, it can be seen that the gate level layout shapes of each cell align with the gate level virtual grate of the logic block 103, and the M2 level layout shapes of each cell align with the M2 level virtual grate of the logic block 103.


The cell phasing methods described herein with regard to the M2 level-to-gate level rational spatial relationship can be equally applied to any plurality of chip levels. Additionally, the rational spatial relationship between any two chip levels can be based on essentially any virtual grate pitch ratio between the two chip levels. For example, while the exemplary embodiments of FIGS. 2A-4 are based on a M2 level-to-gate level pitch ratio of 4/3, the M2 level-to-gate level pitch ratio in other embodiments may be 3/2, 5/3, 5/4, 2/3, 3/5, 4/5, etc.


It should be appreciated that the cell phasing methods described herein provide for maximum packing of cells within a given chip area, e.g., logic block 103, without comprising adherence to the dynamic array architecture. In other words, the cell phasing methods described herein allow cells to be placed cell boundary-to-cell boundary within the given chip area, while ensuring that the layout shapes within the phased chip levels of the cells align with virtual grates of the phased chip levels. Therefore, the cell phasing methods described herein alleviate the need to expand a width of a cell to accommodate alignment of layout features within the cell to multiple virtual grates, thereby providing for optimized chip area utilization in conjunction with use of the dynamic array architecture. Additionally, the cell phasing methods described herein alleviate the need to leave unoccupied chip area between adjacently placed cells to accommodate alignment of layout features within the cell to multiple virtual grates, thereby providing for optimized chip area utilization in conjunction with use of the dynamic array architecture.



FIG. 5 is an illustration showing a flowchart of a method for defining cell variants of differing cell phase to enable placement of cells within an area of a semiconductor chip defined according to a dynamic array architecture, in accordance with one embodiment of the present invention. It should be understood that the area on the semiconductor chip may correspond to an area that is substantially smaller than the total area of the semiconductor chip. The method includes an operation 501 for identifying a phase space based on a rational spatial relationship between virtual grates of phased chip levels. The virtual grates of the phased chip levels represent part of the dynamic array architecture used to define the area of the semiconductor chip. As previously discussed, the phase space is defined as a distance extending perpendicularly between successive alignment positions of two virtual grates that have a rational spatial relationship. For example, if first and second virtual grates have a rational spatial relationship such that the first and second virtual grates align at every fourth virtual line of the first virtual grate, then the phase space spans a distance of four times the pitch of the first virtual grate extending between successive alignments of the first and second virtual grates.


The method continues with an operation 503 in which a left boundary of a subject cell is aligned with a left edge of the phase space. Therefore, following operation 503, the left boundary of the subject cell is simultaneously aligned with a virtual line of each virtual grate of the phased chip levels. FIG. 3A shows an example of alignment between the left boundary 301 of the cell 300 and the left edge of the phase space 303. Thus, in the example of FIG. 3A, the left boundary 301 of the cell 300 is simultaneously aligned with a virtual line of each virtual grate of the phased chip levels (i.e., the gate level and the M2 level).


With the left boundary of the subject cell aligned with the left edge of the phase space, the method continues with an operation 505 for defining a first phase of the subject cell based on locations of the virtual grates of the phased chip levels relative to the left cell boundary. The first phase of the subject cell represents a first variant of the subject cell that is suitable for placement on the semiconductor chip at a location where the first phase of a given cell is required. The first phase of the subject cell can be characterized by index values for each phased chip level, where the index value for a given phased chip level is defined as the distance measured perpendicularly between the left boundary of the cell and the nearest virtual line of the given chip level's virtual grate within the phase space. FIGS. 3A-3H show corresponding index values Gindex and M2index for the gate and M2 phased chip levels. Operation 505 includes storage of the first phase of the subject cell in a cell library for future recall and use. In one embodiment, the cell library is stored in a digital format on a computer readable medium.


Following the operation 505, the method proceeds with an operation 507 in which the left boundary of the cell is moved from its current position across the phase space to a next possible location of the left boundary of the cell within the phase space. It should be understood that the left boundary of the cell is moved across the phase space in operation 507 without moving the virtual grates of the phased chip levels within the phase space. FIG. 3B shows an example of moving the left boundary 301 of the cell 300 from its current position (i.e., from its position in FIG. 3A) to the next possible location (ph2) of the left boundary of the cell within the phase space 303.


If the particular dynamic array architecture embodiment for the area of the semiconductor chip allows for cell widths that are an integer multiple of the gate level virtual grate half-pitch, then the possible locations of the left cell boundary within the phase space correspond to each gate level virtual grate line within the phase space and to each midpoint between each adjacent pair of gate level virtual grate lines within the phase space. This situation is exemplified in FIGS. 3A-3H. If the particular dynamic array architecture embodiment for the area of the semiconductor chip only allows cell widths that are an integer multiple of the gate level virtual grate (whole) pitch, then the possible locations of the left cell boundary within the phase space correspond to either a gate level virtual grate line or a midpoint between an adjacent pair of gate level virtual grate lines within the phase space.


With the left boundary of the subject cell aligned with the next possible location of the left boundary of the cell within the phase space, the method continues with an operation 509 for defining a next phase of the subject cell based on locations of the virtual grates of the phased chip levels relative to the left cell boundary. This next phase of the subject cell represents another variant of the subject cell that is suitable for placement on the semiconductor chip at a location where this next phase of a given cell is required. This next phase of the subject cell can also be characterized by index values for each phased chip level. Operation 509 includes storage of this next phase of the subject cell in the cell library for future recall and use.


The method then proceeds with a decision operation 511 for determining whether another possible location of the left boundary of the cell exists within the phase space. If another possible location of the left boundary of the cell does exist within the phase space, the method reverts back to operation 507. However, if another possible location of the left boundary of the cell does not exist within the phase space, the method concludes. Following completion of the method of FIG. 5, the cell library will include a variant of the subject cell for each possible cell phase that may occur within the area on the semiconductor chip defined according to the phased chip levels of the dynamic array architecture.



FIG. 6 is an illustration showing a flowchart of a method for placing cells within a portion of a semiconductor chip defined according to a dynamic array architecture, in accordance with one embodiment of the present invention. The method includes an operation 601 for defining respective virtual grates for each of two phased chip levels within the portion of the semiconductor chip. The two phased chip levels are defined to have a rational spatial relationship. As previously discussed, two virtual grates that are commonly oriented, indexed to a common spatial location, and have the ratio of their virtual grate pitches defined by a rational number are considered to have a rational spatial relationship. In one embodiment, the two phased chip levels correspond to a gate level and a second interconnect level. However, it should be understood that in other embodiments, the two phased chip levels can correspond to any two chip levels.


The method then proceeds with an operation 603 for placing cells within the portion of the chip. In one embodiment, the two phased chip levels are indexed to a lower-left corner of the portion of the chip, and the cells are placed in rows extending from left to right across the portion of the chip. Also, in one embodiment, the cells can be placed such that their boundaries, which are commonly oriented with the virtual grates of the two phased chip levels, align with the half-pitch of the virtual grate of the phased chip level having the smaller virtual grate pitch.


The method then proceeds with an operation 605 for determining the cell phase required for each cell placed in operation 603. In one embodiment, the required cell phase for a given cell is identified by index values for the phased chip levels within the placed cell. Again, the index value for a given phased chip level within the placed cell is defined as the distance measured perpendicularly between the left boundary of the placed cell and the nearest virtual line of the given phased chip level's virtual grate within the placed cell, i.e., the nearest virtual line of the given phased chip level virtual grate that is to the right of the left boundary of the cell. Calculated index values for the phased chip levels of each placed cell can be compared to corresponding index values of variants of the same placed cell within a cell library to identify a particular variant of the same placed cell having the required cell phase. An operation 607 is then performed to substitute for each placed cell the particular variant of the placed cell that has the required cell phase, thereby causing the layout features in the phased chip levels of each placed cell to align with the virtual grates of the phased chip levels defined across the portion of the semiconductor chip.


Based on the foregoing, in one embodiment, a semiconductor chip is defined to include a logic block area. The logic block area includes a first chip level in which layout features are placed according to a first virtual grate. The logic block area also includes a second chip level in which layout features are placed according to a second virtual grate. A rational spatial relationship exists between the first and second virtual grates. A number of cells are placed within the logic block area. Each of the number of cells is defined according to an appropriate one of a number of cell phases. The appropriate cell phase causes layout features in the first and second chip levels of a given placed cell to be aligned with the first and second virtual grates as positioned within the given placed cell. It should be understood that a given cell defined in accordance with either of the number of cell phases is defined to perform a same logic function associated with the given cell. Moreover, in one embodiment, it is of interest to define each variant of a given cell, corresponding to the various cell phases, to have similar electrical characteristics. Also, in one embodiment, some of the number of cells include at least one layout feature placed in either the first chip level or the second chip level in a substantially centered manner along a cell boundary that is parallel to virtual lines of the first and second virtual grates.


In one embodiment, the number of cells are placed in rows within the logic block area, such that interfacing cell boundaries are co-aligned. Also, in one embodiment, a height of each of the number of cells is uniform. The height of each of the number of cells is measured in a direction parallel to virtual lines of the first and second virtual grates. Additionally, in one embodiment, a width of each of the number of cells is an integer multiple of a pitch of the first virtual grate, and each boundary of each placed cell (that is parallel to virtual lines of the first virtual grate) is aligned with a virtual line of the first virtual grate. In another embodiment, a width of each of the number of cells is an integer multiple of a pitch of the first virtual grate, and each boundary of each placed cell (that is parallel to virtual lines of the first virtual grate) is aligned with a midpoint between adjacent virtual lines of the first virtual grate. In yet another embodiment, a width of each of the number of cells is an integer multiple of one-half of a pitch of the first virtual grate, and each boundary of each placed cell (that is parallel to virtual lines of the first virtual grate) is aligned with either a virtual line of the first virtual grate or a midpoint between adjacent virtual lines of the first virtual grate.


Additionally, while the above-described embodiments are discussed within the context of phasing each cell placed within a given logic block, it should be understood that in an alternative embodiment, the cell phasing methods described herein may be applied to a portion of the cells placed within a given logic block, with a remainder of the cells in the logic block left unphased. For instance, if a first group of cells in a given logic block are defined according to the dynamic array architecture and utilize appropriate phasing when placed, and a second group of cells in the given logic block are defined by another architecture (i.e., non-dynamic array architecture) that does not utilize phasing, the first group of cells can be placed and phased in accordance with the methods disclosed herein, and the second group of cells can be left unphased.


As discussed in co-pending U.S. patent application Ser. No. 12/013,342, which is incorporated in its entirety herein by reference, a dynamic array section (DAS) is defined as a subdivision of dynamic array architecture in which the features present in each vertically delineated level of the subdivision are defined with consideration of other features in the subdivision according to a set of rules, wherein the rules are established to govern relationships between features in a given level of the subdivision and between features in separate levels of the subdivision. A DAS can be defined to occupy a substrate area of arbitrary shape and size. A DAS can also be defined to occupy an area of arbitrary shape and size above the substrate.


Also, as discussed in co-pending U.S. patent application Ser. No. 12/013,342, conductive features in a given level of a logic cell, i.e., in a given level of a DAS containing the logic cell, can be indexed relative to an origin of the logic cell. For example, the origin of the logic cell in a given level is considered to be located at a lower left corner of the logic cell when viewed in a direction perpendicular to the plane of the substrate. Because logic cell widths are variable, a logic cell boundary in the width direction may not always fall on a conductive feature pitch or half-pitch within a given DAS level. Therefore, depending on the origin of the logic cell relative to the virtual grate of the given DAS level, the conductive features in the given DAS level of the logic cell may need to be shifted relative to the logic cell origin in order to align with the virtual grate of the given DAS level when the logic cell is placed on the chip. As discussed above, the shifting of conductive features in a given level of a logic cell relative of the origin of the logic cell is called phasing. Therefore, phasing provides for alignment of conductive features in a given level of a logic cell to the virtual grate of the DAS for the given chip level, depending on the location of the origin of the logic cell. For example, in the case where the gate electrode virtual grate extends across logic cell boundaries, phasing may be required to maintain alignment of second interconnect level conductive features in a given logic cell to the second interconnect level virtual grate.



FIG. 7 is an illustration showing an example of different phasings in a second interconnect level of adjacently disposed logic cells defined within a DAS, in accordance with one embodiment of the present invention. FIG. 7 corresponds to FIG. 33 of co-pending U.S. patent application Ser. No. 12/013,342. FIG. 7 shows three exemplary cells (Cell 1, Phase A; Cell 1, Phase B; and Cell 1, Phase C) disposed adjacent to each other in a DAS. Therefore, each of the three cells share a virtual grate in each level of the DAS. To facilitate description of the phasing concept, the second interconnect level conductive features 3303 of each cell are shown superimposed over the gate electrode level conductive features 3301 of each cell. The cell boundaries in the width direction fall on the gate electrode half-pitch.


It should be understood that the M2 level-to-gate level virtual grate pitch ratio of 4/3 as used in the examples of FIGS. 2A-4 to illustrate the cell phasing principles is one example of many possible virtual grate pitch ratios that can be applied between different chip levels. For instance, in the exemplary embodiment of FIG. 7, an M2 level-to-gate level virtual grate pitch ratio of 3/4 is used, such that four second interconnect level conductive feature pitches are provided for every three gate electrode level conductive feature pitches.


The origin of each cell is shown to reside at the cell's lower left corner. Each phasing of Cell 1 for the second interconnect level is defined by an indexing of the second interconnect level conductive features to the origin of the cell. As shown in the example of FIG. 7, the index, i.e., spacing, of the second interconnect level conductive features relative to the origin is consecutively reduced for each of Phases A, B, and C. By defining each level of each logic cell to have an appropriate phase, it is possible to place logic cells next to one another in a common DAS such that conductive features defined within the various logic cells within a given DAS level can be aligned to a common virtual grate associated with the given DAS level. Additionally, it should be appreciated that in one embodiment adjacent cells within a DAS can be defined and placed so as to share conductive features in one or more levels of the DAS. For example, the Phase B and C instances of Cell 1 in FIG. 7 are depicted as sharing a second interconnect level conductive feature.


It should be understood that in some embodiments the dynamic array architecture may only be applied to a portion of one chip level, with overlying portions of other chip levels unconstrained with respect to dynamic array architecture restrictions. For example, in one embodiment, the gate electrode level is defined to comply with the dynamic array architecture, and the higher interconnect levels are defined in an unconstrained manner, i.e., in a non-dynamic array manner. In this embodiment, the gate electrode level is defined by a virtual grate and its corresponding feature layout channels within which gate electrode level conductive features are defined, as discussed above. Also, in this embodiment, the layout features of the non-dynamic array higher interconnect levels can be unconstrained with regard to a virtual grate and associated feature layout channels. For instance, in this particular embodiment, layout features in any interconnect level above the gate electrode level can include bends so as to form arbitrary two-dimensionally shaped layout features.


As an alternative to the above-mentioned embodiment, other embodiments can exist in which multiple chip levels are defined according to the dynamic array architecture. It should be understood that the phasing techniques disclosed herein are equally applicable to any embodiment that uses the dynamic array architecture, regardless of the number of chip levels that are defined according to the dynamic array architecture.


It should be understood that the cell phasing techniques as disclosed herein can be defined in a layout that is stored in a tangible form, such as in a digital format on a computer readable medium. For example, the cell phasing layouts as disclosed herein can be stored in a layout data file of one or more cells, selectable from one or more libraries of cells. The layout data file can be formatted as a GDS II (Graphic Data System) database file, an OASIS (Open Artwork System Interchange Standard) database file, or any other type of data file format suitable for storing and communicating semiconductor device layouts. Also, multi-level layouts utilizing the cell phasing techniques can be included within a multi-level layout of a larger semiconductor device. The multi-level layout of the larger semiconductor device can also be stored in the form of a layout data file, such as those identified above.


Also, the invention described herein can be embodied as computer readable code 903 on a computer readable medium 901, as shown in FIG. 9. For example, the computer readable code 903 can include the layout data file 905 within which one or more layouts including the cell phasing techniques are stored. The computer readable code 903 can also include program instructions 907 for selecting one or more layout libraries 909 and/or cells 911 that include a layout utilizing the cell phasing techniques as defined therein. The layout libraries 909 and/or cells 911 can also be stored in a digital format on a computer readable medium 901.


The computer readable medium mentioned herein is any data storage device that can store data which can thereafter be read by a computer system. Examples of the computer readable medium include hard drives, network attached storage (NAS), read-only memory, random-access memory, CD-ROMs, CD-Rs, CD-RWs, magnetic tapes, and other optical and non-optical data storage devices. The computer readable medium can also be distributed over a network of coupled computer systems so that the computer readable code is stored and executed in a distributed fashion.


Any of the operations described herein that form part of the invention are useful machine operations. The invention also relates to a device or an apparatus for performing these operations. The apparatus may be specially constructed for the required purpose, such as a special purpose computer. When defined as a special purpose computer, the computer can also perform other processing, program execution or routines that are not part of the special purpose, while still being capable of operating for the special purpose. Alternatively, the operations may be processed by a general purpose computer selectively activated or configured by one or more computer programs stored in the computer memory, cache, or obtained over a network. When data is obtained over a network the data maybe processed by other computers on the network, e.g., a cloud of computing resources.


The embodiments of the present invention can also be defined as a machine that transforms data from one state to another state. The data may represent an article, that can be represented as an electronic signal and electronically manipulate data. The transformed data can, in some cases, be visually depicted on a display, representing the physical object that results from the transformation of data. The transformed data can be saved to storage generally, or in particular formats that enable the construction or depiction of a physical and tangible object. In some embodiments, the manipulation can be performed by a processor. In such an example, the processor thus transforms the data from one thing to another. Still further, the methods can be processed by one or more machines or processors that can be connected over a network. Each machine can transform data from one state or thing to another, and can also process data, save data to storage, transmit data over a network, display the result, or communicate the result to another machine.


It should be further understood that the cell phasing embodiments as disclosed herein can be manufactured as part of a semiconductor device or chip. In the fabrication of semiconductor devices such as integrated circuits, memory cells, and the like, a series of manufacturing operations are performed to define features on a semiconductor wafer. The wafer includes integrated circuit devices in the form of multi-level structures defined on a silicon substrate. At a substrate level, transistor devices with diffusion regions are formed. In subsequent levels, interconnect metallization lines are patterned and electrically connected to the transistor devices to define a desired integrated circuit device. Also, patterned conductive layers are insulated from other conductive layers by dielectric materials.


While this invention has been described in terms of several embodiments, it will be appreciated that those skilled in the art upon reading the preceding specifications and studying the drawings will realize various alterations, additions, permutations and equivalents thereof. Therefore, it is intended that the present invention includes all such alterations, additions, permutations, and equivalents as fall within the true spirit and scope of the invention.

Claims
  • 1. An integrated circuit, comprising: a first cell; anda second cell positioned next to the first cell such that a leftmost boundary of the second cell is coincident with a rightmost boundary of the first cell,the first cell including a first number of linear shaped conductive structures formed to extend in a parallel manner in a first direction in a first chip level,the second cell including a second number of linear shaped conductive structures formed to extend in the parallel manner in the first direction in the first chip level,a leftmost one of the first number of linear shaped conductive structures in the first cell positioned a first distance from a leftmost boundary of the first cell,a leftmost one of the second number of linear shaped conductive structures in the second cell positioned a second distance from a leftmost boundary of the second cell,the second distance different than the first distance, andthe first and second numbers of linear shaped conductive structures having an uninterrupted uniformity in centerline-to-centerline spacing as measured in a second direction perpendicular to the first direction between lengthwise centerlines of adjacent ones of the first and second numbers of linear shaped conductive structures, from left to right across an entirety of both the first and second cells.
  • 2. An integrated circuit as recited in claim 1, wherein the first chip level is a gate electrode level.
  • 3. An integrated circuit as recited in claim 1, wherein some of the first and second numbers of linear shaped conductive structures respectively form one or more transistor gate electrodes.
  • 4. An integrated circuit as recited in claim 1, wherein some of the first and second numbers of linear shaped conductive structures do not form any transistor gate electrode.
  • 5. An integrated circuit as recited in claim 1, wherein some of the first and second numbers of linear shaped conductive structures are electrically separated from any other conductive structure within the circuit.
  • 6. An integrated circuit as recited in claim 1, wherein a width of the first cell as measured in the second direction is an integer multiple a centerline-to-centerline spacing as measured in the second direction between lengthwise centerlines of any two adjacent ones of the first and second numbers of linear shaped conductive structures, and wherein a width of the second cell as measured in the second direction is an integer multiple the centerline-to-centerline spacing as measured in the second direction between lengthwise centerlines of any two adjacent ones of the first and second numbers of linear shaped conductive structures.
  • 7. An integrated circuit as recited in claim 1, wherein at least one of the first number of linear shaped conductive structures has its lengthwise centerline substantially centered on a boundary of the first cell.
  • 8. An integrated circuit as recited in claim 7, wherein at least one of the second number of linear shaped conductive structures has its lengthwise centerline substantially centered on a boundary of the second cell.
  • 9. An integrated circuit as recited in claim 1, wherein the first cell includes a third number of linear shaped conductive structures formed to extend in the parallel manner in the first direction in a second chip level different from the first chip level, the second cell including a fourth number of linear shaped conductive structures formed to extend in the parallel manner in the first direction in the second chip level,a leftmost one of the third number of linear shaped conductive structures in the first cell positioned a third distance from the leftmost boundary of the first cell,a leftmost one of the fourth number of linear shaped conductive structures in the second cell positioned a fourth distance from the leftmost boundary of the second cell,the fourth distance different than the third distance, andthe third and fourth numbers of linear shaped conductive structures having an uninterrupted uniformity in centerline-to-centerline spacing as measured in the second direction perpendicular to the first direction between lengthwise centerlines of adjacent ones of the third and fourth numbers of linear shaped conductive structures, from left to right across an entirety of both the first and second cells.
  • 10. An integrated circuit as recited in claim 9, wherein the centerline-to-centerline spacing as measured in the second direction perpendicular to the first direction between lengthwise centerlines of adjacent ones of the first and second numbers of linear shaped conductive structures is a first pitch, and wherein the centerline-to-centerline spacing as measured in the second direction perpendicular to the first direction between lengthwise centerlines of adjacent ones of the third and fourth numbers of linear shaped conductive structures is a second pitch, andwherein the first and second pitches vertically align with each other in a periodic manner.
  • 11. An integrated circuit as recited in claim 10, wherein a ratio of the second pitch to the first pitch is 4 to 3.
  • 12. An integrated circuit as recited in claim 11, wherein the first chip level is a gate level of the chip and the second chip level is a second interconnect level of the chip.
  • 13. An integrated circuit as recited in claim 10, wherein a ratio of the second pitch to the first pitch is 3 to 2.
  • 14. An integrated circuit as recited in claim 13, wherein the first chip level is a gate level of the chip and the second chip level is a second interconnect level of the chip.
  • 15. An integrated circuit as recited in claim 10, wherein a ratio of the second pitch to the first pitch is 1 to 1.
  • 16. An integrated circuit as recited in claim 15, wherein the first chip level is a gate level of the chip and the second chip level is a second interconnect level of the chip.
  • 17. A method for defining a layout of an integrated circuit, comprising: defining, using a computer, a layout of a first cell;defining, using the computer, a layout of a second cell; andpositioning, using the computer, the layout of the second cell next to the layout of the first cell such that a leftmost boundary of the second cell is coincident with a rightmost boundary of the first cell,the layout of the first cell defined to include a first number of linear shaped conductive structure layout shapes formed to extend in a parallel manner in a first direction in a first chip level,the layout of the second cell defined to include a second number of linear shaped conductive structure layout shapes formed to extend in the parallel manner in the first direction in the first chip level,a leftmost one of the first number of linear shaped conductive structure layout shapes in the first cell positioned a first distance from a leftmost boundary of the first cell,a leftmost one of the second number of linear shaped conductive structure layout shapes in the second cell positioned a second distance from a leftmost boundary of the second cell,the second distance different than the first distance, andthe first and second numbers of linear shaped conductive structure layout shapes having an uninterrupted uniformity in centerline-to-centerline spacing as measured in a second direction perpendicular to the first direction between lengthwise centerlines of adjacent ones of the first and second numbers of linear shaped conductive structure layout shapes, from left to right across an entirety of both the first and second cells.
CLAIM OF PRIORITY

This application is a continuation application under 35 U.S.C. 120 of prior U.S. application Ser. No. 13/540,529, filed Jul. 2, 2012, and entitled “Methods for Cell Phasing and Placement in Dynamic Array Architecture and Implementation of the Same,” which claims priority as a continuation application under 35 U.S.C. 120 to prior U.S. application Ser. No. 12/497,052, filed Jul. 2, 2009, and entitled “Methods for Cell Phasing and Placement in Dynamic Array Architecture and Implementation of the Same,” which claims priority: 1) under 35 U.S.C. 119(e) to U.S. Provisional Patent Application No. 61/081,370, filed Jul. 16, 2008, entitled “Methods for Cell Phasing and Placement in Dynamic Array Architecture and Implementation of the Same,” and 2) as a continuation-in-part application under 35 U.S.C. 120 to U.S. application Ser. No. 12/013,342, filed on Jan. 11, 2008, which claims the benefit of both U.S. Provisional Patent Application No. 60/963,364, filed on Aug. 2, 2007, and U.S. Provisional Patent Application No. 60/972,394, filed on Sep. 14, 2007. The disclosure of each above-identified patent application is incorporated herein by reference.

US Referenced Citations (762)
Number Name Date Kind
4197555 Uehara et al. Apr 1980 A
4417161 Uya Nov 1983 A
4424460 Best Jan 1984 A
4613940 Shenton et al. Sep 1986 A
4657628 Holloway et al. Apr 1987 A
4682202 Tanizawa Jul 1987 A
4745084 Rowson et al. May 1988 A
4780753 Miyashima et al. Oct 1988 A
4801986 Chang et al. Jan 1989 A
4804636 Groover, III Feb 1989 A
4812688 Chu et al. Mar 1989 A
4884115 Michel et al. Nov 1989 A
4928160 Crafts May 1990 A
4975756 Haken et al. Dec 1990 A
5068603 Mahoney Nov 1991 A
5079614 Khatakhotan Jan 1992 A
5097422 Corbin et al. Mar 1992 A
5117277 Yuyama et al. May 1992 A
5121186 Wong et al. Jun 1992 A
5208765 Turnbull May 1993 A
5224057 Igarashi Jun 1993 A
5242770 Chen et al. Sep 1993 A
5268319 Harari Dec 1993 A
5298774 Ueda et al. Mar 1994 A
5313426 Sakuma et al. May 1994 A
5351197 Upton et al. Sep 1994 A
5359226 DeJong Oct 1994 A
5365454 Nakagawa et al. Nov 1994 A
5367187 Yuen Nov 1994 A
5378649 Huang Jan 1995 A
5396128 Dunning et al. Mar 1995 A
5420447 Waggoner May 1995 A
5461577 Shaw et al. Oct 1995 A
5471403 Fujimaga Nov 1995 A
5497334 Russell et al. Mar 1996 A
5497337 Ponnapalli et al. Mar 1996 A
5526307 Lin et al. Jun 1996 A
5536955 Ali Jul 1996 A
5545904 Orbach Aug 1996 A
5581098 Chang Dec 1996 A
5581202 Yano et al. Dec 1996 A
5612893 Hao et al. Mar 1997 A
5636002 Garofalo Jun 1997 A
5656861 Godinho et al. Aug 1997 A
5682323 Pasch et al. Oct 1997 A
5684311 Shaw Nov 1997 A
5684733 Wu et al. Nov 1997 A
5698873 Colwell et al. Dec 1997 A
5705301 Garza et al. Jan 1998 A
5723883 Gheewalla Mar 1998 A
5723908 Fuchida et al. Mar 1998 A
5740068 Liebmann et al. Apr 1998 A
5745374 Matsumoto Apr 1998 A
5764533 deDood Jun 1998 A
5774367 Reyes et al. Jun 1998 A
5780909 Hayashi Jul 1998 A
5789776 Lancaster et al. Aug 1998 A
5790417 Chao et al. Aug 1998 A
5796128 Tran et al. Aug 1998 A
5796624 Sridhar et al. Aug 1998 A
5814844 Nagata et al. Sep 1998 A
5825203 Kusunoki et al. Oct 1998 A
5834851 Ikeda et al. Nov 1998 A
5838594 Kojima Nov 1998 A
5841663 Sharma et al. Nov 1998 A
5847421 Yamaguchi Dec 1998 A
5850362 Sakuma et al. Dec 1998 A
5852562 Shinomiya et al. Dec 1998 A
5858580 Wang et al. Jan 1999 A
5898194 Gheewala Apr 1999 A
5900340 Reich et al. May 1999 A
5908827 Sirna Jun 1999 A
5915199 Hsu Jun 1999 A
5917207 Colwell et al. Jun 1999 A
5920486 Beahm et al. Jul 1999 A
5923059 Gheewala Jul 1999 A
5923060 Gheewala Jul 1999 A
5929469 Mimoto et al. Jul 1999 A
5930163 Hara et al. Jul 1999 A
5935763 Caterer et al. Aug 1999 A
5949101 Aritome Sep 1999 A
5973507 Yamazaki Oct 1999 A
5977305 Wigler et al. Nov 1999 A
5977574 Schmitt et al. Nov 1999 A
5998879 Iwaki et al. Dec 1999 A
6009251 Ho et al. Dec 1999 A
6026223 Scepanovic et al. Feb 2000 A
6037613 Mariyama Mar 2000 A
6037617 Kumagai Mar 2000 A
6044007 Capodieci Mar 2000 A
6054872 Fudanuki et al. Apr 2000 A
6063132 DeCamp et al. May 2000 A
6077310 Yamamoto et al. Jun 2000 A
6080206 Tadokoro et al. Jun 2000 A
6084437 Sako Jul 2000 A
6091845 Pierrat et al. Jul 2000 A
6099584 Arnold et al. Aug 2000 A
6100025 Wigler et al. Aug 2000 A
6114071 Chen et al. Sep 2000 A
6144227 Sato Nov 2000 A
6159839 Jeng et al. Dec 2000 A
6166415 Sakemi et al. Dec 2000 A
6166560 Ogura et al. Dec 2000 A
6174742 Sudhindranath et al. Jan 2001 B1
6182272 Andreev et al. Jan 2001 B1
6194104 Hsu Feb 2001 B1
6194252 Yamaguchi Feb 2001 B1
6194912 Or-Bach Feb 2001 B1
6209123 Maziasz et al. Mar 2001 B1
6230299 McSherry et al. May 2001 B1
6232173 Hsu et al. May 2001 B1
6240542 Kapur May 2001 B1
6249902 Igusa et al. Jun 2001 B1
6255600 Schaper Jul 2001 B1
6255845 Wong et al. Jul 2001 B1
6262487 Igarashi et al. Jul 2001 B1
6269472 Garza et al. Jul 2001 B1
6275973 Wein Aug 2001 B1
6282696 Garza et al. Aug 2001 B1
6291276 Gonzalez Sep 2001 B1
6297668 Schober Oct 2001 B1
6297674 Kono et al. Oct 2001 B1
6303252 Lin Oct 2001 B1
6331733 Or-Bach et al. Dec 2001 B1
6331791 Huang Dec 2001 B1
6335250 Egi Jan 2002 B1
6338972 Sudhindranath et al. Jan 2002 B1
6347062 Nii et al. Feb 2002 B2
6356112 Tran et al. Mar 2002 B1
6359804 Kuriyama et al. Mar 2002 B2
6370679 Chang et al. Apr 2002 B1
6378110 Ho Apr 2002 B1
6380592 Tooher et al. Apr 2002 B2
6388296 Hsu May 2002 B1
6393601 Tanaka et al. May 2002 B1
6399972 Masuda et al. Jun 2002 B1
6400183 Yamashita et al. Jun 2002 B2
6415421 Anderson et al. Jul 2002 B2
6416907 Winder et al. Jul 2002 B1
6417549 Oh Jul 2002 B1
6421820 Mansfield et al. Jul 2002 B1
6425112 Bula et al. Jul 2002 B1
6425117 Pasch et al. Jul 2002 B1
6426269 Haffner et al. Jul 2002 B1
6436805 Trivedi Aug 2002 B1
6445049 Iranmanesh Sep 2002 B1
6445065 Gheewala et al. Sep 2002 B1
6467072 Yang et al. Oct 2002 B1
6469328 Yanai et al. Oct 2002 B2
6470489 Chang et al. Oct 2002 B1
6476493 Or-Bach et al. Nov 2002 B2
6477695 Gandhi Nov 2002 B1
6480032 Aksamit Nov 2002 B1
6480989 Chan et al. Nov 2002 B2
6492066 Capodieci et al. Dec 2002 B1
6496965 van Ginneken et al. Dec 2002 B1
6504186 Kanamoto et al. Jan 2003 B2
6505327 Lin Jan 2003 B2
6505328 van Ginneken et al. Jan 2003 B1
6507941 Leung et al. Jan 2003 B1
6509952 Govil et al. Jan 2003 B1
6514849 Hui et al. Feb 2003 B1
6516459 Sahouria Feb 2003 B1
6523156 Cirit Feb 2003 B2
6525350 Kinoshita et al. Feb 2003 B1
6536028 Katsioulas et al. Mar 2003 B1
6543039 Watanabe Apr 2003 B1
6553544 Tanaka et al. Apr 2003 B2
6553559 Liebmann et al. Apr 2003 B2
6553562 Capodieci et al. Apr 2003 B2
6566720 Aldrich May 2003 B2
6570234 Gardner May 2003 B1
6571140 Wewalaarachchi et al. May 2003 B1
6571379 Takayama May 2003 B2
6578190 Ferguson et al. Jun 2003 B2
6583041 Capodieci Jun 2003 B1
6588005 Kobayashi et al. Jul 2003 B1
6590289 Shively Jul 2003 B2
6591207 Naya et al. Jul 2003 B2
6609235 Ramaswamy et al. Aug 2003 B2
6610607 Armbrust et al. Aug 2003 B1
6617621 Gheewala et al. Sep 2003 B1
6620561 Winder et al. Sep 2003 B2
6632741 Clevenger et al. Oct 2003 B1
6633182 Pileggi et al. Oct 2003 B2
6635935 Makino Oct 2003 B2
6642744 Or-Bach et al. Nov 2003 B2
6643831 Chang et al. Nov 2003 B2
6650014 Kariyazaki Nov 2003 B2
6661041 Keeth Dec 2003 B2
6662350 Fried et al. Dec 2003 B2
6664587 Guterman et al. Dec 2003 B2
6673638 Bendik et al. Jan 2004 B1
6677649 Minami et al. Jan 2004 B2
6687895 Zhang Feb 2004 B2
6690206 Rikino et al. Feb 2004 B2
6691297 Misaka et al. Feb 2004 B1
6700405 Hirairi Mar 2004 B1
6703170 Pindo Mar 2004 B1
6709880 Yamamoto et al. Mar 2004 B2
6714903 Chu et al. Mar 2004 B1
6732338 Crouse et al. May 2004 B2
6732344 Sakamoto et al. May 2004 B2
6737199 Hsieh May 2004 B1
6737318 Murata et al. May 2004 B2
6737347 Houston et al. May 2004 B1
6745372 Cote et al. Jun 2004 B2
6745380 Bodendorf et al. Jun 2004 B2
6749972 Yu Jun 2004 B2
6750555 Satomi et al. Jun 2004 B2
6760269 Nakase et al. Jul 2004 B2
6765245 Bansal Jul 2004 B2
6777138 Pierrat et al. Aug 2004 B2
6777146 Samuels Aug 2004 B1
6787823 Shibutani Sep 2004 B2
6789244 Dasasathyan et al. Sep 2004 B1
6789246 Mohan et al. Sep 2004 B1
6792591 Shi et al. Sep 2004 B2
6792593 Takashima et al. Sep 2004 B2
6794677 Tamaki et al. Sep 2004 B2
6794914 Sani et al. Sep 2004 B2
6795332 Yamaoka et al. Sep 2004 B2
6795358 Tanaka et al. Sep 2004 B2
6795952 Stine et al. Sep 2004 B1
6795953 Bakarian et al. Sep 2004 B2
6800883 Furuya et al. Oct 2004 B2
6807663 Cote et al. Oct 2004 B2
6809399 Ikeda et al. Oct 2004 B2
6812574 Tomita et al. Nov 2004 B2
6818389 Fritze et al. Nov 2004 B2
6818929 Tsutsumi et al. Nov 2004 B2
6819136 Or-Bach Nov 2004 B2
6826738 Cadouri Nov 2004 B2
6834375 Stine et al. Dec 2004 B1
6841880 Matsumoto et al. Jan 2005 B2
6850854 Naya et al. Feb 2005 B2
6854096 Eaton et al. Feb 2005 B2
6854100 Chuang et al. Feb 2005 B1
6867073 Enquist Mar 2005 B1
6871338 Yamauchi Mar 2005 B2
6872990 Kang Mar 2005 B1
6877144 Rittman et al. Apr 2005 B1
6881523 Smith Apr 2005 B2
6884712 Yelehanka et al. Apr 2005 B2
6885045 Hidaka Apr 2005 B2
6889370 Kerzman et al. May 2005 B1
6897517 Van Houdt et al. May 2005 B2
6897536 Nomura et al. May 2005 B2
6898770 Boluki et al. May 2005 B2
6904582 Rittman et al. Jun 2005 B1
6918104 Pierrat et al. Jul 2005 B2
6920079 Shibayama Jul 2005 B2
6921982 Joshi et al. Jul 2005 B2
6922354 Ishikura et al. Jul 2005 B2
6924560 Wang et al. Aug 2005 B2
6928635 Pramanik et al. Aug 2005 B2
6931617 Sanie et al. Aug 2005 B2
6953956 Or-Bach et al. Oct 2005 B2
6954918 Houston Oct 2005 B2
6957402 Templeton et al. Oct 2005 B2
6968527 Pierrat Nov 2005 B2
6974978 Possley Dec 2005 B1
6977856 Tanaka et al. Dec 2005 B2
6978436 Cote et al. Dec 2005 B2
6978437 Rittman et al. Dec 2005 B1
6980211 Lin et al. Dec 2005 B2
6992394 Park Jan 2006 B2
6992925 Peng Jan 2006 B2
6993741 Liebmann et al. Jan 2006 B2
6994939 Ghandehari et al. Feb 2006 B1
7003068 Kushner et al. Feb 2006 B2
7009862 Higeta et al. Mar 2006 B2
7016214 Kawamata Mar 2006 B2
7022559 Barnak et al. Apr 2006 B2
7028285 Cote et al. Apr 2006 B2
7041568 Goldbach et al. May 2006 B2
7052972 Sandhu et al. May 2006 B2
7053424 Ono May 2006 B2
7063920 Baba-Ali Jun 2006 B2
7064068 Chou et al. Jun 2006 B2
7065731 Jacques et al. Jun 2006 B2
7079413 Tsukamoto et al. Jul 2006 B2
7079989 Wimer Jul 2006 B2
7093208 Williams et al. Aug 2006 B2
7093228 Andreev et al. Aug 2006 B2
7103870 Misaka et al. Sep 2006 B2
7105871 Or-Bach et al. Sep 2006 B2
7107551 de Dood et al. Sep 2006 B1
7115343 Gordon et al. Oct 2006 B2
7115920 Bernstein et al. Oct 2006 B2
7120882 Kotani et al. Oct 2006 B2
7124386 Smith et al. Oct 2006 B2
7126837 Banachowicz et al. Oct 2006 B1
7132203 Pierrat Nov 2006 B2
7137092 Maeda Nov 2006 B2
7141853 Campbell et al. Nov 2006 B2
7143380 Anderson et al. Nov 2006 B1
7149999 Kahng et al. Dec 2006 B2
7152215 Smith et al. Dec 2006 B2
7155685 Mori et al. Dec 2006 B2
7155689 Pierrat et al. Dec 2006 B2
7159197 Falbo et al. Jan 2007 B2
7174520 White et al. Feb 2007 B2
7175940 Laidig et al. Feb 2007 B2
7176508 Joshi et al. Feb 2007 B2
7177215 Tanaka et al. Feb 2007 B2
7185294 Zhang Feb 2007 B2
7188322 Cohn et al. Mar 2007 B2
7194712 Wu Mar 2007 B2
7200835 Zhang et al. Apr 2007 B2
7202517 Dixit et al. Apr 2007 B2
7205191 Kobayashi Apr 2007 B2
7208794 Hofmann et al. Apr 2007 B2
7214579 Widdershoven et al. May 2007 B2
7219326 Reed et al. May 2007 B2
7221031 Ryoo et al. May 2007 B2
7225423 Bhattacharya et al. May 2007 B2
7227183 Donze et al. Jun 2007 B2
7228510 Ono Jun 2007 B2
7231628 Pack et al. Jun 2007 B2
7235424 Chen et al. Jun 2007 B2
7243316 White et al. Jul 2007 B2
7252909 Shin et al. Aug 2007 B2
7264990 Rueckes et al. Sep 2007 B2
7269803 Khakzadi et al. Sep 2007 B2
7278118 Pileggi et al. Oct 2007 B2
7279727 Ikoma et al. Oct 2007 B2
7287320 Wang et al. Oct 2007 B2
7294534 Iwaki Nov 2007 B2
7302651 Allen et al. Nov 2007 B2
7308669 Buehler et al. Dec 2007 B2
7312003 Cote et al. Dec 2007 B2
7315994 Aller et al. Jan 2008 B2
7327591 Sadra et al. Feb 2008 B2
7329938 Kinoshita Feb 2008 B2
7335966 Ihme et al. Feb 2008 B2
7337421 Kamat Feb 2008 B2
7338896 Vanhaelemeersch et al. Mar 2008 B2
7345909 Chang et al. Mar 2008 B2
7346885 Semmler Mar 2008 B2
7350183 Cui et al. Mar 2008 B2
7353492 Gupta et al. Apr 2008 B2
7360179 Smith et al. Apr 2008 B2
7360198 Rana et al. Apr 2008 B2
7366997 Rahmat et al. Apr 2008 B1
7367008 White et al. Apr 2008 B2
7376931 Kokubun May 2008 B2
7383521 Smith et al. Jun 2008 B2
7397260 Chanda et al. Jul 2008 B2
7400627 Wu et al. Jul 2008 B2
7402848 Chang et al. Jul 2008 B2
7404154 Venkatraman et al. Jul 2008 B1
7404173 Wu et al. Jul 2008 B2
7411252 Anderson et al. Aug 2008 B2
7421678 Barnes et al. Sep 2008 B2
7423298 Mariyama et al. Sep 2008 B2
7424694 Ikeda Sep 2008 B2
7424695 Tamura et al. Sep 2008 B2
7426710 Zhang et al. Sep 2008 B2
7432562 Bhattacharyya Oct 2008 B2
7434185 Dooling et al. Oct 2008 B2
7441211 Gupta et al. Oct 2008 B1
7442630 Kelberlau et al. Oct 2008 B2
7444609 Charlebois et al. Oct 2008 B2
7446352 Becker et al. Nov 2008 B2
7449371 Kemerling et al. Nov 2008 B2
7458045 Cote et al. Nov 2008 B2
7459792 Chen Dec 2008 B2
7465973 Chang et al. Dec 2008 B2
7466607 Hollis et al. Dec 2008 B2
7469396 Hayashi et al. Dec 2008 B2
7480880 Visweswariah et al. Jan 2009 B2
7480891 Sezginer Jan 2009 B2
7484197 Allen et al. Jan 2009 B2
7485934 Liaw Feb 2009 B2
7487475 Kriplani et al. Feb 2009 B1
7500211 Komaki Mar 2009 B2
7502275 Nii et al. Mar 2009 B2
7503026 Ichiryu et al. Mar 2009 B2
7504184 Hung et al. Mar 2009 B2
7506300 Sezginer et al. Mar 2009 B2
7508238 Yamagami Mar 2009 B2
7509621 Melvin, III Mar 2009 B2
7509622 Sinha et al. Mar 2009 B2
7512017 Chang Mar 2009 B2
7512921 Shibuya Mar 2009 B2
7514959 Or-Bach et al. Apr 2009 B2
7523429 Kroyan et al. Apr 2009 B2
7527900 Zhou et al. May 2009 B2
7538368 Yano May 2009 B2
7543262 Wang et al. Jun 2009 B2
7563701 Chang et al. Jul 2009 B2
7564134 Lee et al. Jul 2009 B2
7568174 Sezginer et al. Jul 2009 B2
7569309 Blatchford et al. Aug 2009 B2
7569310 Wallace et al. Aug 2009 B2
7569894 Suzuki Aug 2009 B2
7575973 Mokhlesi et al. Aug 2009 B2
7598541 Okamoto et al. Oct 2009 B2
7598558 Hashimoto et al. Oct 2009 B2
7614030 Hsu Nov 2009 B2
7625790 Yang Dec 2009 B2
7632610 Wallace et al. Dec 2009 B2
7640522 Gupta et al. Dec 2009 B2
7646651 Lee et al. Jan 2010 B2
7653884 Furnish et al. Jan 2010 B2
7665051 Ludwig et al. Feb 2010 B2
7700466 Booth et al. Apr 2010 B2
7712056 White et al. May 2010 B2
7739627 Chew et al. Jun 2010 B2
7749662 Matthew et al. Jul 2010 B2
7755110 Gliese et al. Jul 2010 B2
7770144 Dellinger Aug 2010 B2
7791109 Wann et al. Sep 2010 B2
7802219 Tomar et al. Sep 2010 B2
7825437 Pillarisetty et al. Nov 2010 B2
7842975 Becker et al. Nov 2010 B2
7873929 Kahng et al. Jan 2011 B2
7882456 Zach Feb 2011 B2
7888705 Becker et al. Feb 2011 B2
7898040 Nawaz Mar 2011 B2
7906801 Becker et al. Mar 2011 B2
7908578 Becker et al. Mar 2011 B2
7910958 Becker et al. Mar 2011 B2
7910959 Becker et al. Mar 2011 B2
7917877 Singh et al. Mar 2011 B2
7917879 Becker et al. Mar 2011 B2
7923266 Thijs et al. Apr 2011 B2
7923337 Chang et al. Apr 2011 B2
7923757 Becker et al. Apr 2011 B2
7932544 Becker et al. Apr 2011 B2
7932545 Becker et al. Apr 2011 B2
7934184 Zhang Apr 2011 B2
7943966 Becker et al. May 2011 B2
7943967 Becker et al. May 2011 B2
7948012 Becker et al. May 2011 B2
7948013 Becker et al. May 2011 B2
7952119 Becker et al. May 2011 B2
7956421 Becker Jun 2011 B2
7958465 Lu et al. Jun 2011 B2
7962867 White et al. Jun 2011 B2
7962879 Tang et al. Jun 2011 B2
7964267 Lyons et al. Jun 2011 B1
7971160 Osawa et al. Jun 2011 B2
7989847 Becker et al. Aug 2011 B2
7989848 Becker et al. Aug 2011 B2
7992122 Burstein et al. Aug 2011 B1
7994583 Inaba Aug 2011 B2
8004042 Yang et al. Aug 2011 B2
8022441 Becker et al. Sep 2011 B2
8030689 Becker et al. Oct 2011 B2
8035133 Becker et al. Oct 2011 B2
8044437 Venkatraman et al. Oct 2011 B1
8058671 Becker et al. Nov 2011 B2
8058690 Chang Nov 2011 B2
8072003 Becker et al. Dec 2011 B2
8072053 Li Dec 2011 B2
8088679 Becker et al. Jan 2012 B2
8088680 Becker et al. Jan 2012 B2
8088681 Becker et al. Jan 2012 B2
8088682 Becker et al. Jan 2012 B2
8089098 Becker et al. Jan 2012 B2
8089099 Becker et al. Jan 2012 B2
8089100 Becker et al. Jan 2012 B2
8089101 Becker et al. Jan 2012 B2
8089102 Becker et al. Jan 2012 B2
8089103 Becker et al. Jan 2012 B2
8089104 Becker et al. Jan 2012 B2
8101975 Becker et al. Jan 2012 B2
8110854 Becker et al. Feb 2012 B2
8129750 Becker et al. Mar 2012 B2
8129751 Becker et al. Mar 2012 B2
8129752 Becker et al. Mar 2012 B2
8129754 Becker et al. Mar 2012 B2
8129755 Becker et al. Mar 2012 B2
8129756 Becker et al. Mar 2012 B2
8129757 Becker et al. Mar 2012 B2
8129819 Becker et al. Mar 2012 B2
8130529 Tanaka Mar 2012 B2
8134183 Becker et al. Mar 2012 B2
8134184 Becker et al. Mar 2012 B2
8134185 Becker et al. Mar 2012 B2
8134186 Becker et al. Mar 2012 B2
8138525 Becker et al. Mar 2012 B2
8161427 Morgenshtein et al. Apr 2012 B2
8178905 Toubou May 2012 B2
8178909 Venkatraman et al. May 2012 B2
8198656 Becker et al. Jun 2012 B2
8207053 Becker et al. Jun 2012 B2
8214778 Quandt et al. Jul 2012 B2
8217428 Becker et al. Jul 2012 B2
8225239 Reed et al. Jul 2012 B2
8225261 Hong et al. Jul 2012 B2
8245180 Smayling et al. Aug 2012 B2
8247846 Becker Aug 2012 B2
8253172 Becker et al. Aug 2012 B2
8253173 Becker et al. Aug 2012 B2
8258547 Becker et al. Sep 2012 B2
8258548 Becker et al. Sep 2012 B2
8258549 Becker et al. Sep 2012 B2
8258550 Becker et al. Sep 2012 B2
8258551 Becker et al. Sep 2012 B2
8258552 Becker et al. Sep 2012 B2
8264007 Becker et al. Sep 2012 B2
8264008 Becker et al. Sep 2012 B2
8264009 Becker et al. Sep 2012 B2
8283701 Becker et al. Oct 2012 B2
8316327 Herold Nov 2012 B2
8356268 Becker et al. Jan 2013 B2
8378407 Audzeyeu et al. Feb 2013 B2
8395224 Becker et al. Mar 2013 B2
8402397 Robles et al. Mar 2013 B2
8405163 Becker et al. Mar 2013 B2
8422274 Tomita et al. Apr 2013 B2
8436400 Becker et al. May 2013 B2
8453094 Kornachuk et al. May 2013 B2
8575706 Becker et al. Nov 2013 B2
20020003270 Makino Jan 2002 A1
20020015899 Chen et al. Feb 2002 A1
20020030510 Kono et al. Mar 2002 A1
20020068423 Park et al. Jun 2002 A1
20020079927 Katoh et al. Jun 2002 A1
20020149392 Cho Oct 2002 A1
20020166107 Capodieci et al. Nov 2002 A1
20020194575 Allen et al. Dec 2002 A1
20030042930 Pileggi et al. Mar 2003 A1
20030046653 Liu Mar 2003 A1
20030061592 Agrawal et al. Mar 2003 A1
20030088839 Watanabe May 2003 A1
20030088842 Cirit May 2003 A1
20030106037 Moniwa et al. Jun 2003 A1
20030117168 Uneme et al. Jun 2003 A1
20030124847 Houston et al. Jul 2003 A1
20030125917 Rich et al. Jul 2003 A1
20030126569 Rich et al. Jul 2003 A1
20030145288 Wang et al. Jul 2003 A1
20030145299 Fried et al. Jul 2003 A1
20030177465 MacLean et al. Sep 2003 A1
20030185076 Worley Oct 2003 A1
20030229868 White et al. Dec 2003 A1
20030229875 Smith et al. Dec 2003 A1
20040029372 Jang et al. Feb 2004 A1
20040049754 Liao et al. Mar 2004 A1
20040063038 Shin et al. Apr 2004 A1
20040115539 Broeke et al. Jun 2004 A1
20040139412 Ito et al. Jul 2004 A1
20040145028 Matsumoto et al. Jul 2004 A1
20040153979 Chang Aug 2004 A1
20040161878 Or-Bach et al. Aug 2004 A1
20040169201 Hidaka Sep 2004 A1
20040194050 Hwang et al. Sep 2004 A1
20040196705 Ishikura et al. Oct 2004 A1
20040229135 Wang et al. Nov 2004 A1
20040232444 Shimizu Nov 2004 A1
20040243966 Dellinger Dec 2004 A1
20040262640 Suga Dec 2004 A1
20050009312 Butt et al. Jan 2005 A1
20050009344 Hwang et al. Jan 2005 A1
20050012157 Cho et al. Jan 2005 A1
20050055828 Wang et al. Mar 2005 A1
20050076320 Maeda Apr 2005 A1
20050087806 Hokazono Apr 2005 A1
20050093147 Tu May 2005 A1
20050101112 Rueckes et al. May 2005 A1
20050110130 Kitabayashi et al. May 2005 A1
20050135134 Yen Jun 2005 A1
20050136340 Baselmans et al. Jun 2005 A1
20050138598 Kokubun Jun 2005 A1
20050156200 Kinoshita Jul 2005 A1
20050185325 Hur Aug 2005 A1
20050189604 Gupta et al. Sep 2005 A1
20050189614 Ihme et al. Sep 2005 A1
20050196685 Wang et al. Sep 2005 A1
20050205894 Sumikawa et al. Sep 2005 A1
20050212018 Schoellkopf et al. Sep 2005 A1
20050224982 Kemerling et al. Oct 2005 A1
20050229130 Wu et al. Oct 2005 A1
20050251771 Robles Nov 2005 A1
20050264320 Chan et al. Dec 2005 A1
20050264324 Nakazato Dec 2005 A1
20050266621 Kim Dec 2005 A1
20050268256 Tsai et al. Dec 2005 A1
20050280031 Yano Dec 2005 A1
20060038234 Liaw Feb 2006 A1
20060063334 Donze et al. Mar 2006 A1
20060070018 Semmler Mar 2006 A1
20060084261 Iwaki Apr 2006 A1
20060091550 Shimazaki et al. May 2006 A1
20060095872 McElvain May 2006 A1
20060101370 Cui et al. May 2006 A1
20060112355 Pileggi et al. May 2006 A1
20060113567 Ohmori et al. Jun 2006 A1
20060120143 Liaw Jun 2006 A1
20060121715 Chang et al. Jun 2006 A1
20060123376 Vogel et al. Jun 2006 A1
20060125024 Ishigaki Jun 2006 A1
20060131609 Kinoshita et al. Jun 2006 A1
20060136848 Ichiryu et al. Jun 2006 A1
20060146638 Chang et al. Jul 2006 A1
20060151810 Ohshige Jul 2006 A1
20060158270 Gibet et al. Jul 2006 A1
20060177744 Bodendorf et al. Aug 2006 A1
20060181310 Rhee Aug 2006 A1
20060195809 Cohn et al. Aug 2006 A1
20060197557 Chung Sep 2006 A1
20060206854 Barnes et al. Sep 2006 A1
20060223302 Chang et al. Oct 2006 A1
20060248495 Sezginer Nov 2006 A1
20070001304 Liaw Jan 2007 A1
20070002617 Houston Jan 2007 A1
20070007574 Ohsawa Jan 2007 A1
20070038973 Li et al. Feb 2007 A1
20070074145 Tanaka Mar 2007 A1
20070094634 Seizginer et al. Apr 2007 A1
20070101305 Smith et al. May 2007 A1
20070105023 Zhou et al. May 2007 A1
20070106971 Lien et al. May 2007 A1
20070113216 Zhang May 2007 A1
20070172770 Witters et al. Jul 2007 A1
20070196958 Bhattacharya et al. Aug 2007 A1
20070209029 Ivonin et al. Sep 2007 A1
20070210391 Becker et al. Sep 2007 A1
20070234252 Visweswariah et al. Oct 2007 A1
20070256039 White Nov 2007 A1
20070257277 Takeda et al. Nov 2007 A1
20070274140 Joshi et al. Nov 2007 A1
20070277129 Allen et al. Nov 2007 A1
20070288882 Kniffin et al. Dec 2007 A1
20070290361 Chen Dec 2007 A1
20070294652 Bowen Dec 2007 A1
20070297249 Chang et al. Dec 2007 A1
20080005712 Charlebois et al. Jan 2008 A1
20080046846 Chew et al. Feb 2008 A1
20080081472 Tanaka Apr 2008 A1
20080082952 O'Brien Apr 2008 A1
20080086712 Fujimoto Apr 2008 A1
20080097641 Miyashita et al. Apr 2008 A1
20080098334 Pileggi et al. Apr 2008 A1
20080099795 Bernstein et al. May 2008 A1
20080127000 Majumder et al. May 2008 A1
20080127029 Graur et al. May 2008 A1
20080134128 Blatchford et al. Jun 2008 A1
20080144361 Wong Jun 2008 A1
20080148216 Chan et al. Jun 2008 A1
20080163141 Scheffer et al. Jul 2008 A1
20080168406 Rahmat et al. Jul 2008 A1
20080211028 Suzuki Sep 2008 A1
20080216207 Tsai Sep 2008 A1
20080244494 McCullen Oct 2008 A1
20080251779 Kakoschke et al. Oct 2008 A1
20080265290 Nielsen et al. Oct 2008 A1
20080276105 Hoberman et al. Nov 2008 A1
20080283910 Dreeskornfeld et al. Nov 2008 A1
20080285331 Torok et al. Nov 2008 A1
20080308848 Inaba Dec 2008 A1
20080315258 Masuda et al. Dec 2008 A1
20090014811 Becker et al. Jan 2009 A1
20090024974 Yamada Jan 2009 A1
20090031261 Smith et al. Jan 2009 A1
20090032898 Becker et al. Feb 2009 A1
20090032967 Becker et al. Feb 2009 A1
20090037864 Becker et al. Feb 2009 A1
20090057780 Wong et al. Mar 2009 A1
20090075485 Ban et al. Mar 2009 A1
20090077524 Nagamura Mar 2009 A1
20090085067 Hayashi et al. Apr 2009 A1
20090087991 Yatsuda et al. Apr 2009 A1
20090101940 Barrows et al. Apr 2009 A1
20090106714 Culp et al. Apr 2009 A1
20090155990 Yanagidaira et al. Jun 2009 A1
20090181314 Shyu et al. Jul 2009 A1
20090187871 Cork Jul 2009 A1
20090206443 Juengling Aug 2009 A1
20090224408 Fox Sep 2009 A1
20090228853 Hong et al. Sep 2009 A1
20090228857 Kornachuk et al. Sep 2009 A1
20090273100 Aton et al. Nov 2009 A1
20090280582 Thijs et al. Nov 2009 A1
20090302372 Chang et al. Dec 2009 A1
20090319977 Saxena et al. Dec 2009 A1
20100001321 Becker et al. Jan 2010 A1
20100006897 Becker et al. Jan 2010 A1
20100006898 Becker et al. Jan 2010 A1
20100006899 Becker et al. Jan 2010 A1
20100006900 Becker et al. Jan 2010 A1
20100006901 Becker et al. Jan 2010 A1
20100006902 Becker et al. Jan 2010 A1
20100006903 Becker et al. Jan 2010 A1
20100006947 Becker et al. Jan 2010 A1
20100006948 Becker et al. Jan 2010 A1
20100006950 Becker et al. Jan 2010 A1
20100006951 Becker et al. Jan 2010 A1
20100006986 Becker et al. Jan 2010 A1
20100011327 Becker et al. Jan 2010 A1
20100011328 Becker et al. Jan 2010 A1
20100011329 Becker et al. Jan 2010 A1
20100011330 Becker et al. Jan 2010 A1
20100011331 Becker et al. Jan 2010 A1
20100011332 Becker et al. Jan 2010 A1
20100011333 Becker et al. Jan 2010 A1
20100012981 Becker et al. Jan 2010 A1
20100012982 Becker et al. Jan 2010 A1
20100012983 Becker et al. Jan 2010 A1
20100012984 Becker et al. Jan 2010 A1
20100012985 Becker et al. Jan 2010 A1
20100012986 Becker et al. Jan 2010 A1
20100017766 Becker et al. Jan 2010 A1
20100017767 Becker et al. Jan 2010 A1
20100017768 Becker et al. Jan 2010 A1
20100017769 Becker et al. Jan 2010 A1
20100017770 Becker et al. Jan 2010 A1
20100017771 Becker et al. Jan 2010 A1
20100017772 Becker et al. Jan 2010 A1
20100019280 Becker et al. Jan 2010 A1
20100019281 Becker et al. Jan 2010 A1
20100019282 Becker et al. Jan 2010 A1
20100019283 Becker et al. Jan 2010 A1
20100019284 Becker et al. Jan 2010 A1
20100019285 Becker et al. Jan 2010 A1
20100019286 Becker et al. Jan 2010 A1
20100019287 Becker et al. Jan 2010 A1
20100019288 Becker et al. Jan 2010 A1
20100019308 Chan et al. Jan 2010 A1
20100023906 Becker et al. Jan 2010 A1
20100023907 Becker et al. Jan 2010 A1
20100023908 Becker et al. Jan 2010 A1
20100023911 Becker et al. Jan 2010 A1
20100025731 Becker et al. Feb 2010 A1
20100025732 Becker et al. Feb 2010 A1
20100025733 Becker et al. Feb 2010 A1
20100025734 Becker et al. Feb 2010 A1
20100025735 Becker et al. Feb 2010 A1
20100025736 Becker et al. Feb 2010 A1
20100032722 Becker et al. Feb 2010 A1
20100032723 Becker et al. Feb 2010 A1
20100032724 Becker et al. Feb 2010 A1
20100032726 Becker et al. Feb 2010 A1
20100037194 Becker et al. Feb 2010 A1
20100037195 Becker et al. Feb 2010 A1
20100096671 Becker et al. Apr 2010 A1
20100203689 Bernstein et al. Aug 2010 A1
20100224943 Kawasaki Sep 2010 A1
20100229140 Strolenberg et al. Sep 2010 A1
20100232212 Anderson et al. Sep 2010 A1
20100264468 Xu Oct 2010 A1
20100270681 Bird et al. Oct 2010 A1
20100287518 Becker Nov 2010 A1
20110016909 Mirza et al. Jan 2011 A1
20110108890 Becker et al. May 2011 A1
20110108891 Becker et al. May 2011 A1
20110154281 Zach Jun 2011 A1
20110207298 Anderson et al. Aug 2011 A1
20110260253 Inaba Oct 2011 A1
20110298025 Haensch et al. Dec 2011 A1
20120012932 Perng et al. Jan 2012 A1
20120273841 Quandt et al. Nov 2012 A1
20130097574 Balabanov et al. Apr 2013 A1
20130200465 Becker et al. Aug 2013 A1
20130200469 Becker et al. Aug 2013 A1
20130207198 Becker et al. Aug 2013 A1
20130207199 Becker et al. Aug 2013 A1
20130254732 Kornachuk et al. Sep 2013 A1
Foreign Referenced Citations (63)
Number Date Country
0102644 Jul 1989 EP
0788166 Aug 1997 EP
1394858 Mar 2004 EP
1670062 Jun 2006 EP
1833091 Aug 2007 EP
1730777 Sep 2007 EP
2251901 Nov 2010 EP
2860920 Apr 2005 FR
58-182242 Oct 1983 JP
61-182244 Aug 1986 JP
S63-310136 Dec 1988 JP
H01284115 Nov 1989 JP
03-165061 Jul 1991 JP
H05211437 Aug 1993 JP
H05218362 Aug 1993 JP
H07-153927 Jun 1995 JP
2684980 Jul 1995 JP
1995-302706 Nov 1995 JP
1997-09289251 Nov 1997 JP
10-116911 May 1998 JP
1999-045948 Feb 1999 JP
2001-068558 Mar 2001 JP
2001-168707 Jun 2001 JP
2002-026125 Jan 2002 JP
2002-026296 Jan 2002 JP
2002-184870 Jun 2002 JP
2001-056463 Sep 2002 JP
2002-258463 Sep 2002 JP
2002-289703 Oct 2002 JP
2001-272228 Mar 2003 JP
2003-264231 Sep 2003 JP
2004-013920 Jan 2004 JP
2004-200300 Jul 2004 JP
2004-241529 Aug 2004 JP
2004-342757 Dec 2004 JP
2005-020008 Jan 2005 JP
2003-359375 May 2005 JP
2005-135971 May 2005 JP
2005-149265 Jun 2005 JP
2005-183793 Jul 2005 JP
2005-203447 Jul 2005 JP
2005-268610 Sep 2005 JP
2005-114752 Oct 2006 JP
2006-303022 Nov 2006 JP
2007-013060 Jan 2007 JP
2007-043049 Feb 2007 JP
10-0417093 Jun 1997 KR
10-1998-087485 Dec 1998 KR
1998-0084215 Dec 1998 KR
10-1999-0057943 Jul 1999 KR
10-2000-0028830 May 2000 KR
10-2002-0034313 May 2002 KR
10-2002-0070777 Sep 2002 KR
2003-0022006 Mar 2003 KR
10-2005-0030347 Mar 2005 KR
2005-0037965 Apr 2005 KR
2006-0108233 Oct 2006 KR
386288 Apr 2000 TW
WO 2005104356 Nov 2005 WO
WO 2006014849 Feb 2006 WO
WO 2006052738 May 2006 WO
WO 2007014053 Feb 2007 WO
WO 2007103587 Sep 2007 WO
Non-Patent Literature Citations (203)
Entry
U.S. Appl. No. 60/625,342, filed May 25, 2006, Pileggi et al.
Acar, et al., “A Linear-Centric Simulation Framework for Parametric Fluctuations”, 2002, IEEE, Carnegie Mellon University USA, pp. 1-8, Jan. 28, 2002.
Amazawa, et al., “Fully Planarized Four-Level Interconnection with Stacked VLAS Using CMP of Selective CVD-A1 and Insulator and its Application to Quarter Micron Gate Array LSIs”, 1995, IEEE, Japan, pp. 473-476, Dec. 10, 1995.
Axelrad et al. “Efficient Full-Chip Yield Analysis Methodology for OPC-Corrected VLSI Design”, 2000, International Symposium on Quality Electronic Design (ISQED), Mar. 20, 2000.
Balasinski et al. “Impact of Subwavelength CD Tolerance on Device Performance”, 2002, SPIE vol. 4692, Jul. 11, 2002.
Burkhardt, et al., “Dark Field Double Dipole Lithography (DDL) for Back-End-Of-Line Processes”, 2007, SPIE Proceeding Series, vol. 6520; Mar. 26, 2007.
Capetti, et al., “Sub k1=0.25 Lithography with Double Patterning Technique for 45nm Technology Node Flash Memory Devices at λ=193nm”, 2007, SPIE Proceeding Series, vol. 6520; Mar. 27, 2007.
Capodieci, L., et al., “Toward a Methodology for Manufacturability-Driven Design Rule Exploration,” DAC 2004, Jun. 7, 2004, San Diego, CA.
Chandra, et al., “An Interconnect Channel Design Methodology for High Performance Integrated Circuits”, 2004, IEEE, Carnegie Mellon University, pp. 1-6, Feb. 16, 2004.
Cheng, et al., “Feasibility Study of Splitting Pitch Technology on 45nm Contact Patterning with 0.93 NA”, 2007, SPIE Proceeding Series, vol. 6520; Feb. 25, 2007.
Chow, et al., “The Design of a SRAM-Based Field-Programmable Gate Array—Part II: Circuit Design and Layout”, 1999, IEEE, vol. 7 # 3 pp. 321-330, Sep. 1, 1999.
Clark et al. “Managing Standby and Active Mode Leakage Power in Deep Sub-Micron Design”, Aug. 9, 2004, ACM.
Cobb et al. “Using OPC to Optimize for Image Slope and Improve Process Window”, 2003, SPIE vol. 5130, Apr. 16, 2003.
Devgan “Leakage Issues in IC Design: Part 3”, 2003, ICCAD, Nov. 9, 2003.
DeVor, et al., “Statistical Quality Design and Control”, 1992, Macmillan Publishing Company, pp. 264-267, Jan. 3, 1992.
Dictionary.com, “channel,” in Collins English Dictionary—Complete & Unabridged 10th Edition. Source location: HarperCollins Publishers. Sep. 3, 2009.
Dusa, et al. “Pitch Doubling Through Dual Patterning Lithography Challenges in Integration and Litho Budgets”, 2007, SPIE Proceeding Series, vol. 6520; Feb. 25, 2007.
El-Gamal, “Fast, Cheap and Under Control: The Next Implementation Fabric”, Jun. 2, 2003, ACM Press, pp. 354-355.
Firedberg, et al., “Modeling Within-Field Gate Length Spatial Variation for Process-Design Co-Optimization,” 2005 Proc. of SPIE vol. 5756, pp. 178-188, Feb. 27, 2005.
Frankel, “Quantum State Control Interference Lithography and Trim Double Patterning for 32-16nm Lithography”, 2007, SPIE Proceeding Series, vol. 6520; Feb. 27, 2007.
Garg, et al. “Lithography Driven Layout Design”, 2005, IEEE VLSI Design 2005, Jan. 3, 2005.
Grobman et al. “Reticle Enhancement Technology Trends: Resource and Manufacturability Implications for the Implementation of Physical Designs” Apr. 1, 2001, ACM.
Grobman et al. “Reticle Enhancement Technology: Implications and Challenges for Physical Design” Jun. 18, 2001, ACM.
Gupta et al. “Enhanced Resist and Etch CD Control by Design Perturbation”, Oct. 4, 2006, Society of Photo-Optical Instrumentation Engineers.
Gupta et al. “A Practical Transistor-Level Dual Threshold Voltage Assignment Methodology”, 2005, Sixth International Symposium on Quality Electronic Design (ISQED), Mar. 21, 2005.
Gupta et al. “Detailed Placement for Improved Depth of Focus and CD Control”, 2005, ACM, Jan. 18, 2005.
Gupta et al. “Joining the Design and Mask Flows for Better and Cheaper Masks”, Oct. 14, 2004, Society of Photo-Optical Instrumentation Engineers.
Gupta et al. “Manufacturing-Aware Physical Design”, ICCAD 2003, Nov. 9, 2003.
Gupta et al. “Selective Gate-Length Biasing for Cost-Effective Runtime Leakage Control”, Jun. 7, 2004, ACM.
Gupta et al. “Wafer Topography-Aware Optical Proximity Correction for Better DOF Margin and CD Control”, Apr. 13, 2005, SPIE.
Gupta, Puneet, et al., “Manufacturing-aware Design Methodology for Assist Feature Correctness,” SPIE vol. 5756, May 13, 2005.
Ha et al., “Reduction in the Mask Error Factor by Optimizing the Diffraction Order of a Scattering Bar in Lithography,” Journal of the Korean Physical Society, vol. 46, No. 5, May 5, 2005, pp. 1213-1217.
Hakko, et al., “Extension of the 2D-TCC Technique to Optimize Mask Pattern Layouts,” 2008 Proc. of SPIE vol. 7028, 11 pages, Apr. 16, 2008.
Halpin et al., “Detailed Placement with Net Length Constraints,” Publication Year 2003, Proceedings of the 3rd IEEE International Workshop on System-on-Chip for Real-Time Applications, pp. 22-27, Jun. 30, 2003.
Hayashida, et al., “Manufacturable Local Interconnect technology Fully Compatible with Titanium Salicide Process”, Jun. 11, 1991, VMIC Conference.
Heng, et al., “A VLSI Artwork Legalization Technique Base on a New Criterion of Minimum Layout Perturbation”, Proceedings of 1997 International Symposium on Physical Design, pp. 116-121, Apr. 14, 1997.
Heng, et al., “Toward Through-Process Layout Quality Metrics”, Mar. 3, 2005, Society of Photo-Optical Instrumentation Engineers.
Hu, et al., “Synthesis and Placement Flow for Gain-Based Programmable Regular Fabrics”, Apr. 6, 2003, ACM Press, pp. 197-203.
Hur et al., “Mongrel: Hybrid Techniques for Standard Cell Placement,” Publication Year 2000, IEEE/ACM International Conference on Computer Aided Design, ICCAD—2000, pp. 165-170, Nov. 5, 2000.
Hutton, et al., “A Methodology for FPGA to Structured-ASIC Synthesis and Verification”, 2006, EDAA, pp. 64-69, Mar. 6, 2006.
Intel Core Microarchitecture White Paper “Introducing the 45 nm Next-Generation Intel Core Microarchitecture,” Intel Corporation, 2007 (best available publication date).
Jayakumar, et al., “A Metal and Via Maskset Programmable VLSI Design Methodology using PLAs”, 2004, IEEE, pp. 590-594, Nov. 7, 2004.
Jhaveri, T. et al., Maximization of Layout Printability/Manufacturability by Extreme Layout Regularity, Proc. of the SPIE vol. 6156, Feb. 19, 2006.
Kang, S.M., Metal-Metal Matrix (M3) for High-Speed MOS VLSI Layout, IEEE Trans. on CAD, vol. CAD-6, No. 5, Sep. 1, 1987.
Kawashima, et al., “Mask Optimization for Arbitrary Patterns with 2D-TCC Resolution Enhancement Technique,” 2008 Proc. of SPIE vol. 6924, 12 pages, Feb. 24, 2008.
Kheterpal, et al., “Design Methodology for IC Manufacturability Based on Regular Logic-Bricks”, DAC, Jun. 13, 2005, IEEE/AMC, vol. 6520.
Kheterpal, et al., “Routing Architecture Exploration for Regular Fabrics”, DAC, Jun. 7, 2004, ACM Press, pp. 204-207.
Kim, et al., “Double Exposure Using 193nm Negative Tone Photoresist”, 2007, SPIE Proceeding Series, vol. 6520; Feb. 25, 2007.
Kim, et al., “Issues and Challenges of Double Patterning Lithography in DRAM”, 2007, SPIE Proceeding Series, vol. 6520; Feb. 25, 2007.
Koorapaty, et al., “Exploring Logic Block Granularity for Regular Fabrics”, 2004, IEEE, pp. 1-6, Feb. 16, 2004.
Koorapaty, et al., “Heterogeneous Logic Block Architectures for Via-Patterned Programmable Fabric”, 13th International Conference on Field Programmable Logic and Applications (FPL) 2003, Lecture Notes in Computer Science (LNCS), Sep. 1, 2003, Springer-Verlag, vol. 2778, pp. 426-436.
Koorapaty, et al., “Modular, Fabric-Specific Synthesis for Programmable Architectures”, 12th International Conference on Field Programmable Logic and Applications (FPL—2002, Lecture Notes in Computer Science (LNCS)), Sep. 2, 2002, Springer-Verlag, vol. 2438 pp. 132-141.
Kuh et al., “Recent Advances in VLSI Layout,” Proceedings of the IEEE, vol. 78, Issue 2, pp. 237-263, Feb. 1, 1990.
Lavin et al. “Backend DAC Flows for “Restrictive Design Rules””, 2004, IEEE, Nov. 7, 2004.
Li, et al., “A Linear-Centric Modeling Approach to Harmonic Balance Analysis”, 2002, IEEE, pp. 1-6, Mar. 4, 2002.
Li, et al., “Nonlinear Distortion Analysis via Linear-Centric Models”, 2003, IEEE, pp. 897-903, Jan. 21, 2003.
Liebmann et al., “Integrating DfM Components into a Cohesive Design-to-Silicon Solution,” Proc. SPIE 5756, Design and Process Integration for Microelectronic Manufacturing III, Feb. 27, 2005.
Liebmann et al., “Optimizing Style Options for Sub-Resolution Assist Features,” Proc. of SPIE vol. 4346, Feb. 25, 2001, pp. 141-152.
Liebmann, et al., “High-Performance Circuit Design for the RET-Enabled 65nm Technology Node”, Feb. 26, 2004, SPIE Proceeding Series, vol. 5379 pp. 20-29.
Liebmann, L. W., Layout Impact of Resolution Enhancement Techniques: Impediment or Opportunity?, International Symposium on Physical Design, Apr. 6, 2003.
Liu et al., “Double Patterning with Multilayer Hard Mask Shrinkage for Sub 0.25 k1 Lithography,” Proc. SPIE 6520, Optical Microlithography XX, Feb. 25, 2007.
Mansfield et al., “Lithographic Comparison of Assist Feature Design Strategies,” Proc. of SPIE, vol. 4000, Feb. 27, 2000, pp. 63-76.
Miller, “Manufacturing-Aware Design Helps Boost IC Yield”, Sep. 9, 2004, http://www.eetimes.com/showArticle.jhtml?articleID=47102054.
Mishra, P., et al., “FinFET Circuit Design,” Nanoelectronic Circuit Design, pp. 23-54, Dec. 21, 2010.
Mo, et al., “Checkerboard: A Regular Structure and its Synthesis, International Workshop on Logic and Synthesis”, Department of Electrical Engineering and Computer Sciences, UC Berkeley, California, pp. 1-7, Jun. 1, 2003.
Mo, et al., “PLA-Based Regular Structures and Their Synthesis”, Department of Electrical Engineering and Computer Sciences, IEEE, pp. 723-729, Jun. 1, 2003.
Mo, et al., “Regular Fabrics in Deep Sub-Micron Integrated-Circuit Design”, Kluwer Academic Publishers, Entire Book, Jun. 1, 2002.
Moore, Samuel K., “Intel 45-nanometer Penryn Processors Arrive,” Nov. 13, 2007, IEEE Spectrum, http://spectrum.ieee.org/semiconductors/design/intel-45nanom eter-penryn-processors-arrive.
Mutoh et al. “1-V Power Supply High-Speed Digital Circuit Technology with Multithreshold-Voltage CMOS”, 1995, IEEE, Aug. 1, 1995.
Op de Beek, et al., “Manufacturability issues with Double Patterning for 50nm half pitch damascene applications, using RELACS® shrink and corresponding OPC”, 2007, SPIE Proceeding Series, vol. 6520; Feb. 25, 2007.
Or-Bach, “Programmable Circuit Fabrics”, Sep. 18, 2001, e-ASIC, pp. 1-36.
Otten, et al., “Planning for Performance”, DAC 1998, ACM Inc., pp. 122-127, Jun. 15, 1998.
Pack et al. “Physical & Timing Verification of Subwavelength-Scale Designs—Part I: Lithography Impact on MOSFETs”, 2003, SPIE vol. 5042, Feb. 23, 2003.
Pandini, et al., “Congestion-Aware Logic Synthesis”, 2002, IEEE, pp. 1-8, Mar. 4, 2002.
Pandini, et al., “Understanding and Addressing the Impact of Wiring Congestion During Technology Mapping”, ISPD Apr. 7, 2002, ACM Press, pp. 131-136.
Patel, et al., “An Architectural Exploration of Via Patterned Gate Arrays, ISPD 2003”, Apr. 6, 2003, pp. 184-189.
Pham, D., et al., “FINFET Device Junction Formation Challenges,” 2006 International Workshop on Junction Technology, pp. 73-77, Aug. 1, 2006.
Pileggi, et al., “Exploring Regular Fabrics to Optimize the Performance-Cost Trade-Offs, Proceedings of the 40th ACM/IEEE Design Automation Conference (DAC) 2003”, Jun. 2, 2003, ACM Press, pp. 782-787.
Poonawala, et al., “ILT for Double Exposure Lithography with Conventional and Novel Materials”, 2007, SPIE Proceeding Series, vol. 6520; Feb. 25, 2007.
Qian et al. “Advanced Physical Models for Mask Data Verification and Impacts on Physical Layout Synthesis” 2003 IEEE, Mar. 24, 2003.
Ran, et al., “An Integrated Design Flow for a Via-Configurable Gate Array”, 2004, IEEE, pp. 582-589, Nov. 7, 2004.
Ran, et al., “Designing a Via-Configurable Regular Fabric”, Custom Integrated Circuits Conference (CICC). Proceedings of the IEEE, Oct. 1, 2004, pp. 423-426.
Ran, et al., “On Designing Via-Configurable Cell Blocks for Regular Fabrics” Proceedings of the Design Automation Conference (DAC) 2004, Jun. 7, 2004, ACM Press, s 198-203.
Ran, et al., “The Magic of a Via-Configurable Regular Fabric”, Proceedings of the IEEE International Conference on Computer Design (ICCD) Oct. 11, 2004.
Ran, et al., “Via-Configurable Routing Architectures and Fast Design Mappability Estimation for Regular Fabrics”, 2005, IEEE, pp. 25-32, Sep. 1, 2006.
Reis, et al., “Physical Design Methodologies for Performance Predictability and Manufacturability”, Apr. 14, 2004, ACM Press, pp. 390-397.
Robertson, et al., “The Modeling of Double Patterning Lithographic Processes”, 2007, SPIE Proceeding Series, vol. 6520; Feb. 25, 2007.
Rosenbluth, et al., “Optimum Mask and Source Patterns to Print a Given Shape,” 2001 Proc. of SPIE vol. 4346, pp. 486-502, Feb. 25, 2001.
Rovner, “Design for Manufacturability in Via Programmable Gate Arrays”, May 1, 2003, Graduate School of Carnegie Mellon University.
Sengupta, “An Integrated CAD Framework Linking VLSI Layout Editors and Process Simulators”, 1998, Thesis for Rice University, pp. 1-101, Nov. 1, 1998.
Sengupta, et al., “An Integrated CAD Framework Linking VLSI Layout Editors and Process Simulators”, 1996, SPIE Proceeding Series, vol. 2726; pp. 244-252, Mar. 10, 1996.
Sherlekar, “Design Considerations for Regular Fabrics”, Apr. 18, 2004, ACM Press, pp. 97-102.
Shi et al., “Understanding the Forbidden Pitch and Assist Feature Placement,” Proc. of SPIE vol. 4562, pp. 968-979, Mar. 11, 2002.
Smayling et al., “APF Pitch Halving for 22 nm Logic Cells Using Gridded Design Rules,” Proceedings of SPIE, USA, vol. 6925, Jan. 1, 2008, pp. 69251E-1-69251E-7.
Socha, et al., “Simultaneous Source Mask Optimization (SMO),” 2005 Proc. of SPIE vol. 5853, pp. 180-193, Apr. 13, 2005.
Sreedhar et al. “Statistical Yield Modeling for Sub-Wavelength Lithography”, 2008 IEEE, Oct. 28, 2008.
Stapper, “Modeling of Defects in Integrated Circuit Photolithographic Patterns”, Jul. 1, 1984, IBM, vol. 28 # 4, pp. 461-475.
Taylor, et al., “Enabling Energy Efficiency in Via-Patterned Gate Array Devices”, Jun. 7, 2004, ACM Press, pp. 874-877.
Tian et al. “Model-Based Dummy Feature Placement for Oxide Chemical—Mechanical Polishing Manufacturability” IEEE, vol. 20, Issue 7, Jul. 1, 2001.
Tong, et al., “Regular Logic Fabrics for a Via Patterned Gate Array (VPGA), Custom Integrated Circuits Conference”, Sep. 21, 2003, Proceedings of the IEEE, pp. 53-56.
Vanleenhove, et al., “A Litho-Only Approach to Double Patterning”, 2007, SPIE Proceeding Series, vol. 6520; Feb. 25, 2007.
Wang, et al., “Performance Optimization for Gridded-Layout Standard Cells”, vol. 5567 SPIE, Sep. 13, 2004.
Wang, J. et al., Standard Cell Layout with Regular Contact Placement, IEEE Trans. on Semicon. Mfg., vol. 17, No. 3, Aug. 9, 2004.
Webb, Clair, “45nm Design for Manufacturing,” Intel Technology Journal, vol. 12, Issue 02, Jun. 17, 2008, ISSN 1535-864X, pp. 121-130.
Webb, Clair, “Layout Rule Trends and Affect upon CPU Design”, vol. 6156 SPIE, Feb. 19, 2006.
Wenren, et al., “The Improvement of Photolithographic Fidelity of Two-dimensional Structures Though Double Exposure Method”, 2007, SPIE Proceeding Series, vol. 6520; Feb. 25, 2007.
Wilcox, et al., “Design for Manufacturability: A Key to Semiconductor Manufacturing Excellence”, 1998 IEEE, pp. 308-313, Sep. 23, 1998.
Wong, et al., “Resolution Enhancement Techniques and Design for Manufacturability: Containing and Accounting for Variabilities in Integrated Circuit Creation,” J. Micro/Nanolith. MEMS MOEMS, Sep. 27, 2007, vol. 6(3), 2 pages.
Wu, et al., “A Study of Process Window Capabilities for Two-dimensional Structures under Double Exposure Condition”, 2007, SPIE Proceeding Series, vol. 6520; Feb. 25, 2007.
Xiong, et al., “The Constrained Via Minimization Problem for PCB and VLSI Design”, 1988 ACM Press/IEEE, pp. 573-578, Jun. 12, 1998.
Yamamaoto, et al., “New Double Exposure Technique without Alternating Phase Shift Mask”, SPIE Proceeding Series, vol. 6520; Feb. 25, 2007.
Yamazoe, et al., “Resolution Enhancement by Aerial Image Approximation with 2D-TCC,” 2007 Proc. of SPIE vol. 6730, 12 pages, Sep. 17, 2007.
Yang, et al., “Interconnection Driven VLSI Module Placement Based on Quadratic Programming and Considering Congestion Using LFF Principles”, 2004 IEEE, pp. 1243-1247, Jun. 27, 2004.
Yao, et al., “Multilevel Routing With Redundant Via Insertion”, Oct. 23, 2006, IEEE, pp. 1148-1152.
Yu, et al., “True Process Variation Aware Optical Proximity Correction with Variational Lithography Modeling and Model Calibration,” J. Micro/Nanolith. MEMS MOEMS, Sep. 11, 2007, vol. 6(3), 16 pages.
Zheng, et al.“Modeling and Analysis of Regular Symmetrically Structured Power/Ground Distribution Networks”, DAC, Jun. 10, 2002, ACM Press, pp. 395-398.
Zhu, et al., “A Stochastic Integral Equation Method for Modeling the Rough Surface Effect on Interconnect Capacitance”, 2004 IEEE, Nov. 7, 2004.
Zhu, et al., “A Study of Double Exposure Process Design with Balanced Performance Parameters for Line/Space Applications”, 2007, SPIE Proceeding Series, vol. 6520; Feb. 25, 2007.
Zuchowski, et al., “A Hybrid Asic and FPGA Architecture”, 2003 IEEE, pp. 187-194, Nov. 10, 2002.
Alam, Syed M. et al., “A Comprehensive Layout Methodology and Layout-Specific Circuit Analyses for Three-Dimensional Integrated Circuits,” Mar. 21, 2002.
Alam, Syed M. et al., “Layout-Specific Circuit Evaluation in 3-D Integrated Circuits,” May 1, 2003.
Aubusson, Russel, “Wafer-Scale Integration of Semiconductor Memory,” Apr. 1, 1979.
Bachtold, “Logic Circuits with Carbon,” Nov. 9, 2001.
Baker, R. Jacob, “CMOS: Circuit Design, Layout, and Simulation (2nd Edition),” Nov. 1, 2004.
Baldi et al., “A Scalable Single Poly EEPROM Cell for Embedded Memory Applications,” pp. 1-4, Fig. 1, Sep. 1, 1997.
Cao, Ke, “Design for Manufacturing (DFM) in Submicron VLSI Design,” Aug. 1, 2007.
Capodieci, Luigi, “From Optical Proximity Correction to Lithography-Driven Physical Design (1996-2006): 10 years of Resolution Enhancement Technology and the roadmap enablers for the next decade,” Proc. SPIE 6154, Optical Microlithography XIX, 615401, Mar. 20, 2006.
Chang, Leland et al., “Stable SRAM Cell Design for the 32 nm Node and Beyond,” Jun. 16, 2005.
Cheung, Peter, “Layout Design,” Apr. 4, 2004.
Chinnery, David, “Closing the Gap Between ASIC & Custom: Tools and Techniques for High-Performance ASIC Design,” Jun. 30, 2002.
Chou, Dyiann et al., “Line End Optimization through Optical Proximity Correction (OPC): A Case Study,” Feb. 19, 2006.
Clein, Dan, “CMOS IC Layout: Concepts, Methodologies, and Tools,” Dec. 22, 1999.
Cowell, “Exploiting Non-Uniform Access Time,” Jul. 1, 2003.
Das, Shamik, “Design Automation and Analysis of Three-Dimensional Integrated Circuits,” May 1, 2004.
Dehaene, W. et al., “Technology-Aware Design of SRAM Memory Circuits,” Mar. 1, 2007.
Deng, Liang et al., “Coupling-aware Dummy Metal Insertion for Lithography,” p. 1, col. 2, Jan. 23, 2007.
Devoivre et al., “Validated 90nm CMOS Technology Platform with Low-k Copper Interconnects for Advanced System-on-Chip (SoC),” Jul. 12, 2002.
Enbody, R. J., “Near-Optimal n-Layer Channel Routing,” Jun. 29, 1986.
Ferretti, Marcos et al., “High Performance Asynchronous ASIC Back-End Design Flow Using Single-Track Full-Buffer Standard Cells,” Apr. 23, 2004.
Garg, Manish et al., “Litho-driven Layouts for Reducing Performance Variability,” p. 2, Figs. 2b-2c, May 23, 2005.
Greenway, Robert et al., “32nm 1-D Regular Pitch SRAM Bitcell Design for Interference-Assisted Lithography,” Oct. 6, 2008.
Gupta et al., “Modeling Edge Placement Error Distribution in Standard Cell Library,” Feb. 23, 2006.
Grad, Johannes ct al., “A standard cell library for student projects,” Proceedings of the 2003 IEEE International Conference on Microelectronic Systems Education, Jun. 2, 2003.
Hartono, Roy et al., “Active Device Generation for Automatic Analog Layout Retargeting Tool,” May 13, 2004.
Hartono, Roy et al., “IPRAIL—Intellectual Property Reuse-based Analog IC Layout Automation,” Mar. 17, 2003.
Hastings, Alan, “The Art of Analog Layout (2nd Edition),” Jul. 4, 2005.
Hurat et al., “A Genuine Design Manufacturability Check for Designers,” Feb. 19, 2006.
Institute of Microelectronic Systems, “Digital Subsystem Design,” Oct. 13, 2006.
Ishida, M. et al., “A Novel 6T-SRAM Cell Technology Designed with Rectangular Patterns Scalable beyond 0.18 pm Generation and Desirable for Ultra High Speed Operation,” IEDM 1998, Dec. 6, 1998.
Jakusovszky, “Linear IC Parasitic Element Simulation Methodology,” Oct. 1, 1993.
Jangkrajarng, Nuttorn et al., “Template-Based Parasitic-Aware Optimization and Retargeting of Analog and RF Integrated Circuit Layouts,” Nov. 5, 2006.
Kahng, Andrew B., “Design Optimizations DAC-2006 DFM Tutorial, part V),” Jul. 24, 2006.
Kang, Sung-Mo et al., “CMOS Digital Integrated Circuits Analysis & Design,” Oct. 29, 2002.
Kottoor, Mathew Francis, “Development of a Standard Cell Library based on Deep Sub-Micron SCMOS Design Rules using Open Source Software (MS Thesis),” Aug. 1, 2005.
Kubicki, “Intel 65nm and Beyond (or Below): IDF Day 2 Coverage (available at http://www.anandtech.com/show/1468/4),” Sep. 9, 2004.
Kuhn, Kelin J., “Reducing Variation in Advanced Logic Technologies: Approaches to Process and Design for Manufacturability of Nanoscale CMOS,” p. 27, Dec. 12, 2007.
Kurokawa, Atsushi et al., “Dummy Filling Methods for Reducing Interconnect Capacitance and Number of Fills, Proc. of ISQED,” pp. 586-591, Mar. 21, 2005.
Lavin, Mark, “Open Access Requirements from RDR Design Flows,” Nov. 11, 2004.
Liebmann, Lars et al., “Layout Methodology Impact of Resolution Enhancement Techniques,” pp. 5-6, Apr. 6, 2003.
Liebmann, Lars et al., “TCAD development for lithography resolution enhancement,” Sep. 1, 2001.
Lin, Chung-Wei et al., “Recent Research and Emerging Challenges in Physical Design for Manufacturability/Reliability,” Jan. 26, 2007.
McCullen, Kevin W., “Layout Techniques for Phase Correct and Gridded Wiring,” pp. 13, 17, Fig. 5, Dec. 1, 2006.
MOSIS, “Design Rules MOSIS Scalable CMOS (SCMOS) (Revision 8.00),” Oct. 4, 2004.
MOSIS, “MOSIS Scalable CMOS (SCMOS) Design Rules (Revision 7.2),” Jan. 1, 1995.
Muta et al., “Manufacturability-Aware Design of Standard Cells,” pp. 2686-2690, Figs. 3, 12, Dec. 1, 2007.
Na, Kee-Yeol et al., “A Novel Single Polysilicon EEPROM Cell With a Polyfinger Capacitor,” Nov. 30, 2007.
Pan et al., “Redundant Via Enhanced Maze Routing for Yield Improvement,” DAC 2005, Jan. 18, 2005.
Park, Tae Hong, “Characterization and Modeling of Pattern Dependencies in Copper Interconnects for Integrated Circuits,” Ph.D. Thesis, MIT, May 24, 2002.
Patel, Chetan, “An Architectural Exploration of Via Patterned Gate Arrays (CMU Master's Project),” May 1, 2003.
Pease, R. Fabian et al., “Lithography and Other Patterning Techniques for Future Electronics,” IEEE 2008, vol. 96, Issue 2, Jan. 16, 2008.
Serrano, Diego Emilio, Pontificia Universidad Javeriana Facultad De Ingenieria, Departamento De Electronica, “Diseño De Multiplicador 4×8 en VLSI, Introduccion al VLSI,” 2006 (best available publication date).
Pramanik, “Impact of layout on variability of devices for sub 90nm technologies,” 2004 (best available publication date).
Pramanik, Dipankar et al., “Lithography-driven layout of logic cells for 65-nm node (SPIE Proceedings vol. 5042),” Jul. 10, 2003.
Roy et al., “Extending Aggressive Low-K1 Design Rule Requirements for 90 and 65 Nm Nodes via Simultaneous Optimization of Numerical Aperture, Illumination and Optical Proximity Correction,” J.Micro/Nanolith, MEMS MOEMS, 4(2), 023003, Apr. 26, 2005.
Saint, Christopher et al., “IC Layout Basics: A Practical Guide,” Chapter 3, Nov. 5, 2001.
Saint, Christopher et al., “IC Mask Design: Essential Layout Techniques,” May 24, 2002.
Scheffer, “Physical CAD Changes to Incorporate Design for Lithography and Manufacturability,” Feb. 4, 2004.
Smayling, Michael C., “Part 3: Test Structures, Test Chips, In-Line Metrology & Inspection,” Jul. 24, 2006.
Spence, Chris, “Full-Chip Lithography Simulation and Design Analysis: How OPC is changing IC Design, Emerging Lithographic Technologies IX,” May 6, 2005.
Subramaniam, Anupama R., “Design Rule Optimization of Regular layout for Leakage Reduction in Nanoscale Design,” pp. 474-478, Mar. 24, 2008.
Tang, C. W. et al., “A compact large signal model of LDMOS,” Solid-State Electronics 46(2002) 2111-2115, May 17, 2002.
Taylor, Brian et al., “Exact Combinatorial Optimization Methods for Physical Design of Regular Logic Bricks,” Jun. 8, 2007.
Tian, Ruiqi et al., “Dummy Feature Placement for Chemical-Mechanical Uniformity in a Shallow Trench Isolation Process,” IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, vol. 21, No. 1, pp. 63-71, Jan. 1, 2002.
Tian, Ruiqi et al., “Proximity Dummy Feature Placement and Selective Via Sizing for Process Uniformity in a Trench-First-Via-Last Dual-Inlaid Metal Process,” Proc. of IITC, pp. 48-50, Jun. 6, 2001.
Torres, J. A. et al., “RET Compliant Cell Generation for sub-130nm Processes,” SPIE vol. 4692, Mar. 6, 2002.
Uyemura, John P., “Introduction to VLSI Circuits and Systems,” Chapters 2, 3, 5, and Part 3, Jul. 30, 2001.
Uyemura, John, “Chip Design for Submicron VLSI: CMOS Layout and Simulation,” Chapters 2-5, 7-9, Feb. 8, 2005.
Verhaegen et al., “Litho Enhancements for 45nm-nod MuGFETs,” Aug. 1, 2005.
Wong, Ban P., “Bridging the Gap between Dreams and Nano-Scale Reality (DAC-2006 DFM Tutorial),” Jul. 28, 2006.
Wang, Dunwei et al., “Complementary Symmetry Silicon Nanowire Logic: Power-Efficient Inverters with Gain,” Aug. 17, 2006.
Wang, Jun et al., “Effects of grid-placed contacts on circuit performance,” pp. 135-139, Figs. 2, 4-8, Feb. 28, 2003.
Wang, Jun et al., “Standard cell design with regularly placed contacts and gates (SPIE vol. 5379),” Feb. 22, 2004.
Wang, Jun et al., “Standard cell design with resolution-enhancement-technique-driven regularly placed contacts and gates,” J. Micro/Nanolith, MEMS MOEMS, 4(1), 013001, Mar. 16, 2005.
Watson, Bruce, “Challenges and Automata Applications in Chip-Design Software,” pp. 38-40, Jul. 16, 2007.
Weste, Neil et al., “CMOS VLSI Design: A Circuits and Systems Perspective, 3rd Edition,” May 21, 2004.
Wingerden, Johannes van, “Experimental verification of improved printability for litho-driven designs,” Mar. 14, 2005.
Wong, Alfred K., “Microlithography: Trends, Challenges, Solutions,, and Their Impact on Design,” Micro IEEE vol. 23, Issue 2, Apr. 29, 2003.
Xu, Gang, “Redundant-Via Enhanced Maze Routing for Yield Improvement,” Proceedings of ASP-DAC 2005, Jan. 18, 2005.
Yang, Jie, “Manufacturability Aware Design,” pp. 93, 102, Fig. 5.2, Jan. 16, 2008.
Yongshun, Wang et al., “Static Induction Devices with Planar Type Buried Gate,” Chinese Journal of Semiconductors, vol. 25, No. 2, Feb. 1, 2004.
Zobrist, George (editor), “Progress in Computer Aided VLSI Design: Implementations (Ch. 5),” Ablex Publishing Corporation, Feb. 1, 1990.
Petley, Graham, “VLSI and ASIC Technology Standard Cell Library Design,” from website www.vlsitechnology.org, Jan. 11, 2005.
Liebmann, Lars, et al., “Layout Optimization at the Pinnacle of Optical Lithography,” Design and Process Integration for Microelectronic Manufacturing II, Proceedings of SPIE vol. 5042, Jul. 8, 2003.
Related Publications (1)
Number Date Country
20140035152 A1 Feb 2014 US
Provisional Applications (3)
Number Date Country
61081370 Jul 2008 US
60963364 Aug 2007 US
60972394 Sep 2007 US
Continuations (2)
Number Date Country
Parent 13540529 Jul 2012 US
Child 14040590 US
Parent 12497052 Jul 2009 US
Child 13540529 US
Continuation in Parts (1)
Number Date Country
Parent 12013342 Jan 2008 US
Child 12497052 US