Methods for cell boundary encroachment and semiconductor devices implementing the same

Information

  • Patent Grant
  • 9530795
  • Patent Number
    9,530,795
  • Date Filed
    Tuesday, February 23, 2016
    8 years ago
  • Date Issued
    Tuesday, December 27, 2016
    7 years ago
Abstract
A semiconductor device includes a plurality of cells. Each of the cells has a respective outer cell boundary defined to circumscribe the cell in an orthogonal manner. Also, each of the cells includes circuitry for performing one or more logic functions. This circuitry includes a plurality of conductive features defined in one or more levels of the cell. One or more of the conductive features in at least one level of a given cell is an encroaching feature positioned to encroach by an encroachment distance into an exclusion zone. The exclusion zone occupies an area within the cell defined by an exclusion distance extending perpendicularly inward into the given cell from a first segment of the outer cell boundary. The exclusion distance is based on a design rule distance representing a minimum separation distance required between conductive features in adjacently placed cells on the semiconductor device.
Description
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 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 design rule 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 device is disclosed to include a plurality of cells. Each of the plurality of cells has a respective outer cell boundary defined to circumscribe the cell in an orthogonal manner. Also, each of the plurality of cells includes circuitry for performing one or more logic functions. This circuitry includes a plurality of conductive features defined in one or more levels of the cell. Within the semiconductor device, one or more of the conductive features in at least one level of a given cell is an encroaching feature positioned to encroach by an encroachment distance into an exclusion zone. The exclusion zone occupies an area within the cell defined by an exclusion distance extending perpendicularly inward into the given cell from a first segment of the outer cell boundary. The exclusion distance is based on a design rule distance. The design rule distance is a minimum separation distance required between conductive features in adjacently placed cells on the semiconductor device.


In one embodiment, a semiconductor device is disclosed to include a plurality of cells. Each of the plurality of cells has a respective outer cell boundary defined to circumscribe the cell in an orthogonal manner. Also, each of the plurality of cells includes circuitry for performing one or more logic functions. This circuitry includes a plurality of conductive features defined in one or more levels of the cell. At least one instance of a given cell is defined on the semiconductor device in accordance with any one of multiple versions of the given cell or combination thereof. The multiple versions of the given cell include a first version of the given cell having an encroachment region defined within a particular cell level adjacent to a first segment of the outer cell boundary. The first version of the given cell also includes a spacing allowance region defined within the particular cell level adjacent to a second segment of the outer cell boundary located opposite the given cell from the first segment. The multiple versions of the given cell also include a second version of the given cell having the encroachment region defined within the particular cell level adjacent to both the first and second segments of the outer cell boundary. The multiple versions of the given cell also include a third version of the given cell having the spacing allowance region defined within the particular cell level adjacent to both the first and second segments of the outer cell boundary. The encroachment region is defined as a peripheral region of the particular cell level of the given cell within which at least one encroaching feature is positioned to encroach by an encroachment distance into an exclusion zone. The exclusion zone occupies an area within the given cell defined by an exclusion distance extending perpendicularly inward into the given cell from the outer cell boundary adjacent to the encroachment region. The exclusion distance is based on a design rule distance. The spacing allowance region is defined to extend perpendicularly inward into the given cell from the outer cell boundary by a spacing allowance distance equal to at least the encroachment distance plus the exclusion distance. The spacing allowance region within the particular cell level does not include any conductive features.


In one embodiment, a cell library stored in a digital format on a computer readable storage medium is disclosed to include one or more layouts of a cell. The cell has an outer cell boundary defined to circumscribe the cell in an orthogonal manner. The cell is defined to include circuitry for performing one or more logic functions. Each of the layouts for the cell include layout shapes for conductive features in one or more levels of the cell. The layouts of the cell include a first layout of the cell having an encroachment region defined within a given level of the cell adjacent to a first segment of the outer cell boundary. The encroachment region includes at least one encroaching layout shape positioned to encroach by an encroachment distance into an exclusion zone. The exclusion zone occupies an area within the given cell defined by an exclusion distance extending perpendicularly inward into the cell from the first segment of the outer cell boundary. The exclusion distance is based on a design rule distance. The first layout of the cell also includes a spacing allowance region defined within the given level of the cell adjacent to a second segment of the outer cell boundary, located opposite the cell from the first segment of the outer cell boundary. The spacing allowance region extends perpendicularly inward into the cell from the second segment of the outer cell boundary by a spacing allowance distance equal to at least the encroachment distance of the encroachment region plus the exclusion distance. The spacing allowance region in the cell level does not include any layout shapes.


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 shows placement of a number of cells A-Z of various logic function in rows within the logic block, in accordance with one embodiment of the present invention;



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



FIG. 3A shows a level of a cell (Cell A) in which layout shapes are defined to comply with a design rule distance buffer requirement at the left and right cell edge boundaries, in accordance with one embodiment of the present invention;



FIG. 3B shows a variation of the Cell A of FIG. 3A, in which certain layout shapes are allowed to encroach into the design rule distance buffer at the left or right cell boundaries, in accordance with one embodiment of the present invention;



FIG. 4A shows an example of two cells (Cell A and Cell B) defined in accordance with the common boundary encroachment specification, as described above with regard to FIG. 3B, in accordance with one embodiment of the present invention;



FIG. 4B shows flipped versions of Cell A and Cell B placed next to each other, in accordance with one embodiment of the present invention;



FIG. 5A shows a first variation of a mirror cell (Cell C-v1) in which the left common boundary encroachment specification, as shown at the left boundary of Cell A of FIG. 3B, is applied to both the left and right boundaries of the mirror cell (Cell C-v1), in accordance with one embodiment of the present invention;



FIG. 5B shows a second variation of the mirror cell (Cell C-v2) in which the right common boundary encroachment specification, as shown at the right boundary in Cell A of FIG. 3B, is applied to both the left and right boundaries of the mirror cell (Cell C-v2), in accordance with one embodiment of the present invention;



FIG. 6A shows Cell A-flipped placed to the right of Cell C-v1, in accordance with one embodiment of the present invention;



FIG. 6B shows Cell C-v2 placed to the right of Cell A-flipped, in accordance with one embodiment of the present invention;



FIG. 7A shows an example of a cell (Cell E) that includes a two-dimensionally varying feature E3 and a number of linear-shaped features, in accordance with one embodiment of the present invention;



FIG. 7B shows another example cell (Cell F) that includes a two-dimensionally varying feature F4 and a number of linear-shaped features, in accordance with one embodiment of the present invention;



FIG. 7C shows side-by-side placement of Cells E and F of FIGS. 7A and 7B, respectively, in accordance with one embodiment of the present invention;



FIG. 8 shows an example cell layout for an AND logic circuit that implements the cell boundary encroachment techniques disclosed herein, in accordance with one embodiment of the present invention;



FIG. 9A shows a particular level L-x of the Cell J that has a right boundary encroachment specification defined by encroachment regions 951 and 953, in accordance with one embodiment of the present invention;



FIG. 9B shows the same particular level L-x of the Cell K that has a right boundary encroachment specification defined by an encroachment region 959, in accordance with one embodiment of the present invention;



FIG. 9C shows a first version of a Cell M that includes spacing allowance regions 961, 963, and 965, in accordance with one embodiment of the present invention;



FIG. 10A shows a layout of a level of an example Cell P-v1, in which the layout features have a width size W of odd number, in accordance with one embodiment of the present invention;



FIG. 10B shows a layout of a second version of Cell P (Cell P-v2), in which the cell is both flipped and shifted, in accordance with one embodiment of the present invention;



FIG. 11A shows an example of an interrelationship between the encroachment distance, exclusion distance, and spacing allowance region distance, with an encroachment feature that overlaps its cell boundary, in accordance with one embodiment of the present invention; and



FIG. 11B shows a variation of FIG. 11A, with an encroachment feature that does not overlap its cell boundary, 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.


Cell Description



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 may include layouts for the cell in each level of the chip extending from the substrate level up through a particular interconnect level.



FIG. 1B shows placement of a number of cells A-Z of various logic function in rows within the logic block 103, in accordance with one embodiment of the present invention. In this example embodiment, consider that the plurality 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 example 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.


Dynamic Array Architecture


Generally speaking, a dynamic array architecture is provided to address semiconductor manufacturing process variability associated with a continually increasing lithographic gap. In the area of semiconductor manufacturing, lithographic gap is defined as the difference between the minimum size of a feature to be defined and the wavelength of light used to render the feature in the lithographic process, wherein the feature size is less than the wavelength of the light. Current lithographic processes utilize a light wavelength of 193 nm. However, current feature sizes are as small as 45 nm and are expected to get even smaller. With a size of 45 nm, the shapes are three times smaller than the wavelength of the light used to define the shapes. Also, considering that the interaction radius of light is about five light wavelengths, it should be appreciated that shapes exposed with a 193 nm light source will influence the exposure of shapes approximately 5*193 nm (965 nm) away.


In the dynamic array architecture, layout features in a given layer are shaped and spaced such that constructive and destructive interference of the light from neighboring features will be optimized to produce the best rendering of all features in the neighborhood. The feature-to-feature spacing in a given layer is proportional to the wavelength of the light used to expose the features. The light used to expose each feature within about a five light wavelength distance from a given feature will serve to enhance the exposure of the given feature to some extent. The exploitation of constructive interference of the standing light waves used to expose neighboring features enables the manufacturing equipment capability to be maximized and not be limited by concerns regarding light interactions during the lithography process.


In the dynamic array architecture, 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. In one embodiment, the layout features are sized substantially smaller than the wavelength of the light used in the lithographic process to form the physical shapes corresponding to the layout features.


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.



FIG. 2 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. 2. 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. 2 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. 2, 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. 2, 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 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, if there are layout features placed in different chip levels according to virtual grates of rational spatial relationship, the layout features 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.


In one embodiment, 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, in this embodiment, 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 of layout features 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 at least one level 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.


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 cell boundary encroachment 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. Additionally, although the cell boundary encroachment techniques are described below within the exemplary context of the dynamic array architecture, it should be understood that the principles of the cell boundary encroachment techniques are equally applicable to essentially any cell layout, including non-dynamic array architecture layouts, in which it is beneficial to allow certain non-continuous layout shapes to encroach within a design rule spacing buffer at a cell boundary, while ensuring that neighboring layout shapes in an adjacently placed cell are spaced sufficiently far away to ensure compliance with global shape-to-shape design rule spacing requirements.


Cell Boundary Encroachment Technique



FIG. 3A shows a level of a cell (Cell A) in which layout shapes are defined to comply with a design rule distance buffer requirement at the left and right cell edge boundaries, in accordance with one embodiment of the present invention. A design rule distance, as used herein, is a minimum spacing distance required between conductive features in adjacently placed cells on the semiconductor chip to ensure proper fabrication of the conductive features. The design rule distance may be set by a fabrication facility based on the capabilities of their fabrication equipment and processes. Also, the design rule distance may vary between different cell levels. Moreover, the design rule distance can be defined as a function of various layout feature size parameters. Also, the design rule distance requirement can be defined by a combination of particular design rules. For example, in the gate electrode level, the design rule distance can be a combination of gate electrode width and spacing. For interconnect levels and contact or via interactions, the design rule distance can be a combination of interconnect feature overlap of contact/via, interconnect feature line-end-spacing, and in some cases, contact width, among others. Additionally, in one embodiment, the design rule distance, as used herein, can be a combination of established width and spacing design rules or a combination of established enclosure, width, and spacing design rules, or other appropriate combination of established design rules. For discussion purposes, the design rule distance referred to herein represents a distance value that is appropriate for a corresponding layout context in which it is applied.


In one embodiment, the design rule distance is within a range extending from about 30 nm (nanometers) to about 90 nm. In another embodiment, the design rule distance is less than 70 nm. The design rule distance buffer extends inside of the cell boundaries by a set fraction or multiple of one or more design rule values. In one embodiment, the design rule distance buffer is set at one-half of an established design rule spacing value. In another embodiment, the design rule distance buffer is set at one-third of the established design rule spacing value. It should be understood that in other embodiments, the design rule distance buffer can be set at other fractions or multiples of an established design rule value or combination of established design rule values.


In the example of FIG. 3A, layout shapes A1-A8 are placed along eight tracks T1-T8. In the dynamic array architecture, the tracks T1-T8 of FIG. 3A would correspond to virtual lines, and the layout shapes would be placed within feature layout channels respectively corresponding to those virtual lines. The layout shapes A1 and A8 on the bottom track T1 and top track T8, respectively, may define power/ground conductors and extend to the left and right cell boundaries so as to connect in a continuous manner with a corresponding layout shape in an adjacently placed cell. Layout shapes that extend completely to the cell boundary are referred to as “continuous shapes.” The other layout shapes A2 through A7 are defined to ensure that they do not encroach within the design rule distance buffer at the left and right cell boundaries. Layout shapes that do not extend completely to the cell boundary are referred to as “non-continuous shapes.” When cells are placed next to each other, layout shapes proximate to a given cell boundary interface along a given track will either extend continuously through the cell boundary interface or will be spaced apart by at least a full design rule compliant spacing amount.


Cell boundary encroachment techniques are disclosed herein to optimize cell area utilization by providing a systematic method for allowing encroachment of non-continuous layout shapes into the design rule distance buffer at the cell boundary, while preserving global shape-to-shape design rule spacing integrity. FIG. 3B shows a variation of the Cell A of FIG. 3A, in which certain layout shapes A2, A3, A6, and A7 are allowed to encroach into the design rule distance buffer at the left or right cell boundaries, in accordance with one embodiment of the present invention. Specifically, each of layout shapes A2 and A7 are defined to encroach within the design rule distance buffer at the left boundary of Cell A, as indicated by encroachment regions 901, with corresponding spacing allowance regions 903 at the opposite ends of the respective tracks upon which layout shapes A2 and A7 are placed. Each of layout shapes A3 and A6 are defined to encroach within the design rule distance buffer at the right boundary of the cell as indicated by encroachment regions 901, with corresponding spacing allowance regions 903 at the opposite ends of the respective tracks upon which layout shapes A3 and A6 are placed.


A boundary encroachment specification of a given track in a given cell level is defined by which end of the given track, if any, allows for layout shape encroachment within the design rule distance buffer at the cell boundary, and which end of the given track, if any, requires a spacing allowance region at the cell boundary. With regard to Cell A of FIG. 3B, the boundary encroachment specification of each track T1-T8 is as follows:


Track T1: No encroachment allowance.


Track T2: Left side encroachment region. Right side spacing allowance region.


Track T3: Right side encroachment region. Left side spacing allowance region.


Track T4: No encroachment allowance.


Track T5: No encroachment allowance.


Track T6: Right side encroachment allowance. Left side spacing allowance region.


Track T7: Left side encroachment region. Right side spacing allowance region.


Track T8: No encroachment allowance.


If each cell in a cell library is defined according to a common boundary encroachment specification, or includes layout shape-to-cell boundary spacings of at least the same size as the common boundary encroachment specification for each track, then the cells within the cell library can be placed next to each other in a compatible manner so as to comply with global shape-to-shape design rule separation requirements. For example, in one exemplary embodiment, each cell in a cell library is defined based on a left boundary encroachment specification and a complimentary right boundary encroachment specification. The left boundary encroachment specification will identify which tracks allow for layout shape encroachment within the design rule distance buffer at the left boundary of the cell, and which tracks require a spacing allowance region between a nearest layout shape and the left boundary of the cell.


Similarly, the right boundary encroachment specification will identify which tracks allow for layout shape encroachment within the design rule distance buffer at the right boundary of the cell, and which tracks require a spacing allowance region between a nearest layout shape and the right boundary of the cell. In this embodiment, if the boundary encroachment specification allows for encroachment of a given layout shape within the design rule distance buffer at the cell boundary of a given track, then actual layout shape encroachment at the cell boundary of the given track is allowed but not required. However, in this embodiment, if the boundary encroachment specification identifies a spacing allowance region at the cell boundary of a given track, then the spacing allowance region at the cell boundary of the given track is required.



FIG. 4A shows an example of two cells (Cell A and Cell B) defined in accordance with the common boundary encroachment specification, as described above with regard to FIG. 3B, in accordance with one embodiment of the present invention. The spacing allowance regions 903 located at the right boundary of Cell A compliment the encroachment regions 901 at the left boundary of Cell B. Similarly, the spacing allowance regions 903 located at the left boundary of Cell B compliment the encroachment regions 901 at the right boundary of Cell A. Therefore, layout shapes B2 and B7 can encroach within the design rule distance buffer at the left boundary of Cell B and still satisfy the global shape-to-shape design rule spacing requirement relative to layout shapes A2 and A7, respectively. Similarly, layout shapes A3 and A6 can encroach within the design rule distance buffer at the right boundary of Cell A and still satisfy the global shape-to-shape design rule separation requirement relative to layout shapes B3 and B6, respectively. Cells can also be flipped as necessary to match encroachment regions 901 to spacing allowance regions 903. For example, FIG. 4B shows flipped versions of Cell A and Cell B placed next to each other, in accordance with one embodiment of the present invention.


In an extension of the above-described embodiment, the cell library can also include one or more cells which implement a mirrored encroachment specification in which both the left and right boundaries of the cell have the same boundary encroachment specification. Cells that implement the mirrored encroachment specification are referred to herein as “mirror cells.” In this embodiment, to ensure full cell placement compatibility, two variations of each mirror cell are defined within the cell library. The first variation of a mirror cell applies the left common boundary encroachment specification to both the left and right boundaries of the mirror cell. The second variation of the mirror cell applies the right common boundary encroachment specification to both the left and right boundaries of the mirror cell.



FIG. 5A shows a first variation of a mirror cell (Cell C-v1) in which the left common boundary encroachment specification, as shown at the left boundary of Cell A of FIG. 3B, is applied to both the left and right boundaries of the mirror cell (Cell C-v1), in accordance with one embodiment of the present invention. FIG. 5B shows a second variation of the mirror cell (Cell C-v2) in which the right common boundary encroachment specification, as shown at the right boundary in Cell A of FIG. 3B, is applied to both the left and right boundaries of the mirror cell (Cell C-v2), in accordance with one embodiment of the present invention.


By having both variations of the mirror cell in the cell library, the mirror cell can be placed next to any other cell that complies with the common boundary encroachment specification. For example, to implement left-to-right placement of Cells C, A, C, the cell placement can be done as C-v1, Cell A-flipped, C-v2. FIG. 6A shows Cell A-flipped placed to the right of Cell C-v1, in accordance with one embodiment of the present invention. FIG. 6B shows Cell C-v2 placed to the right of Cell A-flipped, in accordance with one embodiment of the present invention.


Although the exemplary embodiments of FIGS. 3A through 6B show linear-shaped layout features which may correspond to the dynamic array architecture, it should be understood that the cell boundary encroachment techniques disclosed herein are not necessarily limited to use with the dynamic array architecture. For example, FIG. 7A shows an example of a cell (Cell E) that includes a two-dimensionally varying feature E3 and a number of linear-shaped features E1-E2, E4-E5, E6-E7, in accordance with one embodiment of the present invention. The two-dimensionally varying feature E3 extends into encroachment region 901 at the right boundary of Cell E. Also, Cell E includes a spacing allowance region 903 located at the left boundary to complement the encroachment region 901 at the right boundary of Cell E.



FIG. 7B shows another example cell (Cell F) that includes a two-dimensionally varying feature F4 and a number of linear-shaped features F1-F3 and F5-F7, in accordance with one embodiment of the present invention. The two-dimensionally varying feature F4 and the linear-shaped features F3 and F6 extend into encroachment region 901 at the right boundary of Cell F. Also, Cell F includes a spacing allowance region 903 located at the left boundary to complement the encroachment area 901 at the right boundary of Cell F. Therefore, Cells E and F have compatible boundary encroachment specifications, such that Cells E and F can be placed side-by-side.



FIG. 7C shows side-by-side placement of Cells E and F of FIGS. 7A and 7B, respectively, in accordance with one embodiment of the present invention. The spacing allowance regions 903 located at the left boundary of Cell F complements the encroachment region 901 at the right boundary of Cell E. Similarly, the spacing allowance regions 903 located at the right boundary of Cell E complement the encroachment regions 901 at the left boundary of Cell F. Therefore, the two-dimensionally varying layout shapes E3 can encroach within the design rule distance buffer at the right boundary of Cell E and still satisfy the global shape-to-shape design rule separation requirement relative to layout shapes F3, F4, and F5. Similarly, layout shapes F2 and F6 can encroach within the design rule distance buffer at the left boundary of Cell F and still satisfy the global shape-to-shape design rule separation requirement relative to layout shapes E2 and E6, respectively.



FIG. 8 shows an example cell layout for an AND logic circuit that implements the cell boundary encroachment techniques disclosed herein, in accordance with one embodiment of the present invention. The AND cell layout of FIG. 8 includes complementary (n-type and p-type) diffusion regions 501, gate electrode level features 503, contact features 505, and metal 1 (M1) level features 507. The gate electrode level layout includes gate electrode level features 503 that overlap each of the left and right cell boundaries. Also, the M1 level includes an M1 level feature that encroaches within the encroachment region 901 at the right boundary of the cell. The M1 level also includes a spacing allowance region 903 at the left boundary of the cell. It should also be appreciated that a mirrored version of the AND cell can be generated by flipping each layout of the cell about a centerline parallel to and equidistant between the left and right cell boundaries. The AND cell of FIG. 8 is one example of a logic cell implementation utilizing the cell boundary encroachment techniques disclosed herein. It should be understood that essentially any other cell defined to perform essentially any logic function can be implemented utilizing the cell boundary encroachment techniques disclosed herein.


It should be understood that the cell layouts presented in FIGS. 3A through 8 are provided by way of example only, and in no way limit the scope of the cell boundary encroachment techniques disclosed herein. For instance, any cell that utilizes the cell boundary encroachment techniques disclosed herein may have more or less tracks than shown in the examples herein. Also, a given common boundary encroachment specification can be defined in essentially any manner. Therefore, the specific tracks which include encroachment regions 901 and spacing allowance regions 903 can differ from what is shown by way of example in the cells of FIGS. 3A through 8. Also, any given cell that utilizes the cell boundary encroachment technique disclosed herein may incorporate layout shapes of varying size and shape beyond what is depicted in the examples herein.


Also, any given cell may utilize the cell boundary encroachment techniques disclosed herein on multiple cell levels. Cell boundary encroachment technique utilization within multiple cell levels of a given cell will be permutative in determining how many variations the given cell exists in the cell library. Additionally, different cells may utilize the cell boundary encroachment techniques on different cell levels. Moreover, some cells may not utilize the cell boundary encroachment techniques on a given level, but will comply with spacing allowance region requirements associated with the given level so as to be compatible for placement next to cells that do utilize the cell boundary encroachment techniques on the given level.


Utilizing the above-described cell boundary encroachment techniques, a semiconductor device is defined in accordance with one embodiment of the present invention. The semiconductor device includes a plurality of cells in which each cell has a respective outer cell boundary defined to circumscribe the cell in an orthogonal manner, i.e., with cell boundary segments extending at right angles to each other. For example, each of the example cell layouts of FIGS. 3A through 8 include a respective outer cell boundary defined to circumscribe the cell in an orthogonal manner, e.g., as a rectangle. It should be understood, however, that a rectangular shaped outer cell boundary is not required. In other embodiments, a cell can have essentially any polygonal shaped outer boundary. Each cell within the semiconductor device includes circuitry for performing one or more logic functions. This circuitry includes a plurality of conductive features defined in one or more levels of the cell.


In the semiconductor device, one or more of the conductive features in at least one level of a given cell is an encroaching feature positioned to encroach by an encroachment distance into an exclusion zone defined within the cell about the outer boundary of the cell. The exclusion zone occupies an area within the cell defined by an exclusion distance extending perpendicularly inward into the cell from the cell outer boundaries. In one embodiment, the exclusion distance is defined by one-half of a design rule distance as measured perpendicularly inward into the given cell from a segment of the outer cell boundary. However, in other embodiments, the exclusion distance is defined by a fraction or multiple of the design rule distance other than one-half, as measured perpendicularly inward into the given cell from a segment of the outer cell boundary. In one embodiment, the encroachment distance of the encroaching feature extends from a position corresponding to the inward extent of the exclusion distance from the segment of the outer cell boundary adjacent to the encroaching region, to an outermost edge of the encroaching feature relative to an interior of the given cell.


In one embodiment, the level of the given cell having the encroaching feature is also defined to correspondingly include a spacing allowance region adjacent to a segment of the outer cell boundary located opposite the given cell from the segment of the outer cell boundary where the encroaching region exists. The spacing allowance region extends perpendicularly inward into the given cell from its corresponding segment of the outer cell boundary by a spacing allowance distance equal to at least the encroachment distance plus the exclusion distance. This spacing allowance region size ensures that when two cells are placed side-by-side such that the encroachment region is placed next to the spacing allowance region, the conductive features within the encroachment region will be spaced apart from other conductive features by at least a full design rule separation distance. It should be understood that the spacing allowance region within the level of the given cell does not include any conductive features.



FIG. 11A shows an example of an interrelationship between the encroachment distance, exclusion distance, and spacing allowance region distance, with an encroachment feature 1101 that overlaps its cell boundary, in accordance with one embodiment of the present invention. Cells x and y are placed side-by-side such that their facing outer cell boundaries are aligned. That is to say the right cell boundary of Cell x is aligned with the left cell boundary of Cell y. Both Cell x and Cell y have exclusion zones 1102 and 1104, respectively, defined by an exclusion distance (XD). The encroaching feature 1101 extends into the exclusion zone 1102 of Cell x by an exclusion distance (ED), such that the encroaching feature 1101 overlaps the right cell boundary of Cell x. The corresponding spacing allowance region of Cell y had a distance of SD, which is equal to the sum of the encroaching distance (ED) plus the exclusion distance (XD). The neighboring feature 1103 in Cell y complies with the spacing allowance region, such that twice the exclusion distance (XD) exists between the encroaching feature 1101 from Cell x and the neighboring feature 1103 in Cell y.



FIG. 11B shows a variation of FIG. 11A, with an encroachment feature 1101A that does not overlap its cell boundary, in accordance with one embodiment of the present invention. The encroaching feature 1101A extends into the exclusion zone 1102 of Cell x by an exclusion distance (ED), such that the encroaching feature 1101A does not overlap the right cell boundary of Cell x. The corresponding spacing allowance region of Cell y had a distance of SD, which is equal to the sum of the encroaching distance (ED) plus the exclusion distance (XD). The neighboring feature 1103A in Cell y complies with the spacing allowance region, such that twice the exclusion distance (XD) exists between the encroaching feature 1101A from Cell x and the neighboring feature 1103A in Cell y.


In one embodiment, the encroaching feature within the encroachment region is a conductive feature within a gate electrode level of the given cell. In one version of this embodiment, the gate electrode level of the given cell is defined to include only linear-shaped conductive features positioned parallel to each other, such as in the dynamic array architecture. An example of this is shown by encroaching feature A6 in the example cell layout of FIG. 3B. However, in another version of this embodiment, the gate electrode level of the given cell is defined to include arbitrary shaped conductive features. In this case, the encroaching feature may include both a portion that is parallel to and a portion that is perpendicular to the segment of the outer cell boundary from which the encroachment region extends. An example of this is shown by encroaching feature E3 in the example cell layout of FIG. 7A.


In one embodiment, the encroaching feature is a conductive interconnect feature within an interconnect level of the given cell defined above a gate electrode level of the given cell. In one version of this embodiment, the interconnect level of the given cell is defined to include only linear-shaped conductive features positioned parallel to each other, such as in the dynamic array architecture. However, in another version of this embodiment, the interconnect level of the given cell is defined to include arbitrary shaped conductive features. In this case, the encroaching feature includes both a portion that is parallel to and a portion that is perpendicular to the segment of the outer cell boundary from which the encroachment region extends.


Also, in one embodiment, an outermost edge of the encroaching feature (relative to an interior of the given cell) is located inside of the outer cell boundary so as to be located inside of the given cell. However, in another embodiment, the outermost edge of the encroaching feature is located outside of the outer cell boundary, such that the encroaching feature overlaps the segment of the outer cell boundary from which the encroachment region extends, i.e., the reference segment of the outer cell boundary. For discussion purposes, this embodiment is referred to as an overlapping encroachment embodiment.


In one version of the overlapping encroachment embodiment, the encroaching feature is a linear-shaped conductive feature positioned parallel to the reference segment of the outer cell boundary, such that a width direction of the encroaching feature is perpendicular to the reference segment of the outer cell boundary. In one instance, a first extent of the encroaching feature in the width direction inside of the reference segment of the outer cell boundary is equal to a second extent of the encroaching feature in the width direction outside of the reference segment of the outer cell boundary. In another case, a first extent of the encroaching feature in the width direction inside of the reference segment of the outer cell boundary is different from a second extent of the encroaching feature in the width direction outside of the reference segment of the outer cell boundary.


In another version of the overlapping encroachment embodiment, the encroaching feature is a two-dimensionally shaped feature having one or more portions that extend parallel to the reference segment of the outer cell boundary and one or more portions that extend perpendicular to the reference segment of the outer cell boundary. In one instance, the encroaching portion of the two-dimensionally shaped encroaching feature includes both portions that extend parallel to and perpendicular to the reference segment of the outer cell boundary. In another instance, the encroaching portion of the two-dimensionally shaped encroaching feature may includes a portion that extends in a single direction either parallel to or perpendicular to the reference segment of the outer cell boundary. It should be understood that in various embodiments, the encroaching portion(s) of the encroaching feature may have essentially any shape depending on the particular layout of the cell.


In one example instance of the overlapping encroachment embodiment, the semiconductor device includes a first cell and a second cell, wherein the labels first and second are provided for identification purposes only and do not infer sequence or position. In this embodiment, the first cell includes an encroaching feature positioned to overlap a reference segment of an outer cell boundary of the first cell. Also, in this embodiment, the second cell includes an encroaching feature positioned to overlap a reference segment of an outer cell boundary of the second cell. The encroaching feature of the second cell is shaped to align with and overlap the encroaching feature of the first cell when the reference segments of the outer boundaries of the first and second cells are aligned. In this embodiment, the encroaching feature of the first cell and the encroaching feature of the second cell have a shared functionality such that a single instance of the overlapping encroaching features within the semiconductor device provides the shared functionality for both the first and second cells, when the first and second cells are placed such that their respective outer boundary reference segments are aligned.


Also, in one embodiment, the semiconductor chip includes mirrored versions of one or more cells. In this embodiment, a given cell and its mirrored version each have a common centerline defined parallel to and equidistant between two opposing segments of the outer cell boundary, e.g., between left and right segments of the outer cell boundary. In this embodiment, conductive features within the mirrored version of the given cell respectively correspond to conductive features within the given cell having been flipped about the common centerline.


In one embodiment, at least one instance of a given cell is defined on the semiconductor chip in accordance with any one of multiple versions of the given cell or combination thereof. The multiple versions of the given cell include:

    • a first version of the given cell having an encroachment region defined within a particular cell level adjacent to a first segment of the outer cell boundary and a spacing allowance region defined within the particular cell level adjacent to a second segment of the outer cell boundary located opposite the given cell from the first segment,
    • a second version of the given cell having the encroachment region defined within the particular cell level adjacent to both the first and second segments of the outer cell boundary, and
    • a third version of the given cell having the spacing allowance region defined within the particular cell level adjacent to both the first and second segments of the outer cell boundary.


Use of the labels first and second with regard to segments of the outer cell boundary are provided for reference purposes only and do not infer sequence or position. In this embodiment, the encroachment region is defined as a peripheral region of the particular cell level of the given cell within which at least one encroaching feature is positioned to encroach by an encroachment distance into an exclusion zone. As previously mentioned, the exclusion zone occupies the area within the cell defined by the exclusion distance extending perpendicularly inward into the cell from the cell outer boundaries.


The encroachment distance extends from a position corresponding to the inward extent of the exclusion distance from the segment of the outer cell boundary adjacent to the encroaching region, to an outermost edge of the encroaching feature relative to an interior of the given cell. Also, in this embodiment, the spacing allowance region is defined to extend perpendicularly inward into the given cell from the outer cell boundary by a spacing allowance distance equal to at least the encroachment distance plus the exclusion distance. The spacing allowance region within the particular cell level does not include any conductive features.


Also, in this embodiment, the multiple versions of the given cell include mirrored versions of each of the first, second, and third versions, i.e., non-mirrored versions, of the given cell, as described above. Each non-mirrored version of the given cell and its corresponding mirrored version both have a common centerline defined parallel to and equidistant between the first and second segments of the outer cell boundary. Conductive features within each mirrored version of the given cell respectively correspond to conductive features within the corresponding non-mirrored version of the given cell having been flipped about the common centerline.


In another embodiment, the cell boundary encroachment techniques described herein can be represented in a cell library stored in a digital format on a computer readable storage medium. The cell library includes one or more layouts of a cell. The cell has an outer cell boundary defined to circumscribe the cell in an orthogonal manner. The cell is also defined to include circuitry for performing one or more logic functions. Each layout for the cell includes layout shapes for conductive features in one or more levels of the cell. A first layout of the cell has an encroachment region defined within a given level of the cell adjacent to a first segment of the outer cell boundary. The encroachment region includes at least one encroaching layout shape positioned to encroach by an encroachment distance into an exclusion zone. The exclusion zone occupies an area within the cell defined by an exclusion distance extending perpendicularly inward into the cell from the cell outer boundaries. The encroachment distance extends from a position corresponding to the inward extent of the exclusion distance from the segment of the outer cell boundary adjacent to the encroaching region, to an outermost edge of the encroaching layout shape relative to an interior of the given cell.


The first layout of the cell also includes a spacing allowance region defined within the given level of the cell adjacent to a second segment of the outer cell boundary located opposite the cell from the first segment of the outer cell boundary. The spacing allowance region extends perpendicularly inward into the cell from the second segment of the outer cell boundary by a spacing allowance distance equal to at least the encroachment distance of the encroachment region plus the exclusion distance. The spacing allowance region in the cell level does not include any layout shapes.


In one embodiment, the cell library also includes a mirrored version of the first layout of the cell. The first layout of the cell and its mirrored version both have a common centerline defined parallel to and equidistant between the first and second segments of the outer cell boundary. Conductive features within the mirrored version of the first layout of the cell correspond to conductive features within the first layout of the cell having been flipped about the common centerline.


In one embodiment, the cell library also includes a second layout of the cell in which the cell level has a first encroachment region defined adjacent to the first segment of the outer cell boundary, and a second encroachment region defined adjacent to the second segment of the outer cell boundary located opposite the cell from the first segment of the outer cell boundary. In this embodiment, each of the first and second encroachment regions includes at least one encroaching layout shape positioned to encroach by a respective encroachment distance into a corresponding exclusion zone.


In one embodiment, the cell library also includes a mirrored version of the second layout of the cell. The second layout of the cell and its mirrored version both have a common centerline defined parallel to and equidistant between the first and second segments of the outer cell boundary. Conductive features within the mirrored version of the second layout of the cell correspond to conductive features within the second layout of the cell having been flipped about the common centerline.


In one embodiment, the cell library also includes a third layout of the cell in which the cell level has a first spacing allowance region defined adjacent to the first segment of the outer cell boundary, and a second spacing allowance region defined adjacent to the second segment of the outer cell boundary located opposite the cell from the first segment of the outer cell boundary. In this embodiment, the first spacing allowance region extends perpendicularly inward into the cell from the first segment of the outer cell boundary by a first spacing allowance distance equal to at least the encroachment distance of the second encroachment region of the second cell layout plus the exclusion distance. Also, the second spacing allowance region extends perpendicularly inward into the cell from the second segment of the outer cell boundary by a second spacing allowance distance equal to at least the encroachment distance of the first encroachment region of the first and second layouts plus the exclusion distance. Each of the first and second spacing allowance regions in the cell level does not include any layout shapes.


In one embodiment, the cell library also includes a mirrored version of the third layout of the cell. The third layout of the cell and its mirrored version both have a common centerline defined parallel to and equidistant between the first and second segments of the outer cell boundary. Conductive features within the mirrored version of the third layout of the cell correspond to conductive features within the third layout of the cell having been flipped about the common centerline.


The foregoing description of the cell boundary encroachment techniques have been provided primarily within the context of a given cell or a given pair of interfacing cells, i.e., adjacently placed cells. In addition to the principles of the cell boundary encroachment techniques, as described above, it should be understood that additional considerations may be made when implementing the cell boundary encroachment techniques across a cell library.


Specifically, within the cell library, there should be at least one version of each cell that has a boundary specification defined to accommodate the most aggressive boundary encroachments among the cells in the cell library. The most aggressive boundary encroachments are those that have the largest encroachment distance. For discussion purposes, consider an example cell library that includes multiple cells, including a Cell J and a Cell K, among others.



FIG. 9A shows a particular level L-x of the Cell J that has a right boundary encroachment specification defined by encroachment regions 951 and 953, in accordance with one embodiment of the present invention. The encroachment region 951 has an encroachment distance indicated by arrow 952. The encroachment region 953 has an encroachment distance indicated by arrow 954. And, the encroachment region 955 has an encroachment distance indicated by arrow 956. Cell J also has a left boundary encroachment specification defined by encroachment region 955. The encroachment region 955 has an encroachment distance indicated by arrow 956.



FIG. 9B shows the same particular level L-x of the Cell K that has a right boundary encroachment specification defined by an encroachment region 959, in accordance with one embodiment of the present invention. The encroachment region 959 has an encroachment distance indicated by arrow 960.


For discussion purposes, consider that within level L-x within all the cells in the cell library, the encroachment distance 952 of encroachment region 951 of Cell J is the maximum encroachment distance at the cell boundary location B-1. Also, consider that the encroachment distance 956 of encroachment region 955 of Cell J is the maximum encroachment distance at the cell boundary location B-2. Also, consider that the encroachment distance 960 of encroachment region 959 of Cell K is the maximum encroachment distance at the cell boundary location B-3.


To ensure that the cells within the library can be placed next to each other without violating the design rule spacing requirement between adjacent conductive features, there should be a version of each cell within the cell library that has a level L-x layout with spacing allowance regions defined to accommodate the most aggressive boundary encroachments among the cells in the cell library. In the present example, the most aggressive boundary encroachments among the cells in the cell library within level L-x are those corresponding to encroachment regions 951 and 955 of Cell J, and the encroachment region 959 of Cell K. Therefore, in the present example, there should be a version of each cell within the cell library that has a level L-x layout with spacing allowance regions defined to accommodate the encroachment regions 951 and 955 of Cell J, and the encroachment region 959 of Cell K.



FIG. 9C shows a first version of a Cell M that includes spacing allowance regions 961, 963, and 965, in accordance with one embodiment of the present invention. The spacing allowance regions 961, 963, and 965 are defined to accommodate boundary encroachment regions 955, 951, and 953, respectively. The spacing allowance region 961 extends inward into the Cell M by a distance 962 equal to at least a sum of the encroachment distance 956 (of encroachment region 955 of Cell J) plus the exclusion distance of the exclusion zone. In this manner, the spacing allowance region 961 at boundary location B-2 accommodates the most aggressive encroachment region within the cell library at boundary location B-2.


The spacing allowance region 963 extends inward into the Cell M by a distance 964 equal to at least a sum of the encroachment distance 952 (of encroachment region 951 of Cell J) plus the exclusion distance of the exclusion zone. The spacing allowance region 965 extends inward into the Cell M by a distance 966 equal to at least a sum of the encroachment distance 960 (of encroachment region 959 of Cell K) plus the exclusion distance of the exclusion zone. In this manner, the spacing allowance regions 963 and 965 at boundary locations B-1 and B-3, respectively, accommodate the most aggressive encroachment regions within the cell library at boundary locations B-1 and B-3, respectively.


In one embodiment, cells are placed next to each other in a sequential manner. In this case, it may be acceptable for a cell to have a version that accommodates the most aggressive boundary encroachment specification on one side of the cell at a time. For instance, a second version of Cell M may be defined to have the spacing allowance region 961 on the right cell boundary, and not have the spacing allowance regions 963 and 965 on the left cell boundary. However, in this case, the second version of Cell M could not be the only version of Cell M in the cell library. In this case, their should be at least one other version of Cell M that includes the spacing allowance regions 963 and 965 on the left cell boundary. This at least one other version of Cell M could be satisfied by the first version of Cell M as shown in FIG. 9C. Or, the cell library could further include a third version of Cell M that includes the spacing allowance regions 963 and 965 on the left cell boundary, without the spacing allowance region 961 on the right cell boundary.


It should be understood that mirrored version of the cells within the cell library can be placed on the semiconductor chip. Therefore, a version of a cell having spacing allowance region(s) located on a right side of a cell can be mirrored, i.e., flipped, to have the same spacing allowance region(s) located on a left side of the cell, vice-versa. Also, it should be understood that multiple levels of a cell can have encroachment boundary specifications. The example described above with regard to FIGS. 9A-9C correspond to one level L-x of the cells within the cell library. When multiple cell levels include boundary encroachment specifications, the spacing allowance regions necessary to accommodate the most aggressive encroachment regions within each level of the cell are permutated on a cell level-by-cell level basis to generate multiple versions of each cell. This ensures that each cell within the cell library has a version that can accommodate any combination of encroachment regions across multiple cell levels.


In various embodiments, the cell boundary encroachment techniques disclosed herein can be used to facilitate implementation of either standard or non-standard cell designs. In one embodiment, cells can be defined to include a level in which layout features are defined to have a width size of odd number, such as 35 nm (nanometers) by way of example. With the odd numbered feature width size, it may not be possible to have a centered alignment of layout features on the cell boundaries. In other words, the encroachment distance of a layout feature on one side of the cell boundary may be different than the encroachment distance of another layout feature on the other side of the cell boundary.


For example, FIG. 10A shows a layout of a level of an example Cell P-v1, in which the layout features have a width size W of odd number, in accordance with one embodiment of the present invention. Specifically, each of layout features 701, 703, 705, 707, and 709 is defined to have the odd numbered width W. In this case, a fixed cell layout grid increment spacing may be sized such that the left and right cell boundaries cannot be centered on the encroaching layout shapes 701 and 709, respectively. Therefore, the layout feature 701 extends outside of the cell boundary by a distance 711, and extends inside of the cell boundary by a distance 713, where the distance 713 is less than the distance 711. Also, the layout feature 709 extends outside of the cell boundary by the distance 713, and extends inside of the cell boundary by the distance 711. By way of example, in the embodiment where the odd numbered feature width size is 35 nm, the larger distance 711 may correspond to 20 nm, and the smaller distance 713 may correspond to 15 nm. It should be understood, however, that these size values are not limited and that essentially any other size values may be utilized.


It can be seen that a simple flipping, i.e., mirroring, of Cell P-v1 does not enable placement of Cell P in a side-by-side manner. Therefore, another version of Cell P is generated to enable side-by-side placement. FIG. 10B shows a layout of a second version of Cell P (Cell P-v2), in which the cell is both flipped and shifted, in accordance with one embodiment of the present invention. Specifically, to arrive at the layout of Cell P-v2, the layout features within Cell P-v1 are flipped and then shifted to the left, such that the layout features 709 and 701 of Cell P-v2 will align with the layout features 709 and 701, respectively, of Cell P-v1 when Cells P-v1 and P-v2 are placed side-by-side with overlapping cell boundaries.


In one embodiment, the cell boundary encroachment techniques utilized to implement cells with feature width sizes of odd number, such as described in FIGS. 10A-10B, can be implemented across an entire cell library. In this embodiment, each cell in the library will have at least one flipped and shifted version to accommodate its side-by-side placement next to any other cell in the library. Also, it should be understood that the embodiments described with regard to FIGS. 10A-10B can be applied to essentially any cell level layout, such as a gate electrode level and/or an interconnect level defined above the gate electrode level.


In summary, it should be understood that the cell boundary encroachment techniques disclosed herein provide a systematic approach for allowing certain layout shapes to encroach within the design rule spacing buffer at a cell boundary, while ensuring that global shape-to-shape design rule separation requirements are satisfied when cells are placed next to each other. For any given cell level, the cell boundary encroachment techniques disclosed herein can be applied to left/right cell boundaries, top/bottom cell boundaries, or both left/right and top/bottom cell boundaries.


It should be understood that the cell boundary encroachment techniques disclosed herein can be implemented in a layout that is stored in a tangible form, such as in a digital format on a computer readable medium. For example, the layouts incorporating the cell boundary encroachment techniques 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 boundary encroachment 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 on a computer readable medium. For example, the computer readable code can include the layout data file within which one or more layouts implementing the cell boundary encroachment techniques are stored. The computer readable code can also include program instructions for selecting one or more layout libraries and/or cells that include a layout utilizing the cell boundary encroachment techniques as defined therein. The layout libraries and/or cells can also be stored in a digital format on a computer readable medium.


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 boundary encroachment 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. A semiconductor device, comprising: a first cell including circuitry for performing one or more logic functions, the circuitry of the first cell including a plurality of conductive features defined in one or more levels of the first cell, the first cell having an outer cell boundary defined to circumscribe the first cell, the first cell including a conductive structure formed to extend to within at least one-half of a design rule spacing distance from the outer cell boundary of the first cell at a first location; anda second cell including circuitry for performing one or more logic functions, the circuitry of the second cell including a plurality of conductive features defined in one or more levels of the second cell, the second cell having an outer cell boundary defined to circumscribe the second cell, a portion of the outer cell boundary of the second cell aligned with a portion of the outer cell boundary of the first cell that includes the first location, the second cell formed to provide a spacing allowance region for the conductive structure of the first cell at the first location.
  • 2. The semiconductor device as recited in claim 1, wherein the conductive structure of the first cell is linear-shaped having a length extending in a first direction perpendicular to the outer cell boundary of the first cell that includes the first location.
  • 3. The semiconductor device as recited in claim 2, wherein an end of the conductive structure of the first cell closest to the first location is positioned inside of the first cell.
  • 4. The semiconductor device as recited in claim 2, wherein an end of the conductive structure of the first cell closest to the first location is positioned outside of the first cell and within the second cell.
  • 5. The semiconductor device as recited in claim 1, wherein the conductive structure of the first cell includes both a first portion that is parallel to the outer cell boundary of the first cell that includes the first location and a second portion that is perpendicular to the outer cell boundary of the first cell that includes the first location.
  • 6. The semiconductor device as recited in claim 5, wherein the first portion of the conductive structure of the first cell is positioned inside of the first cell.
  • 7. The semiconductor device as recited in claim 5, wherein the first portion of the conductive structure of the first cell is positioned inside of both the first cell and the second cell.
  • 8. The semiconductor device as recited in claim 5, wherein the first portion of the conductive structure of the first cell is positioned inside of the second cell.
  • 9. The semiconductor device as recited in claim 1, wherein the design rule distance is a minimum separation distance required between conductive features in adjacently placed cells on the semiconductor device.
  • 10. The semiconductor device as recited in claim 9, wherein the design rule distance is within a range extending from about 30 nanometers to about 90 nanometers.
  • 11. The semiconductor device as recited in claim 9, wherein the design rule distance is less than 70 nanometers.
  • 12. The semiconductor device as recited in claim 1, wherein the conductive structure of the first cell is formed within a gate electrode level of the first cell.
  • 13. The semiconductor device as recited in claim 12, wherein the gate electrode level of the first cell is defined to include only linear-shaped conductive structures positioned parallel to each other.
  • 14. The semiconductor device as recited in claim 1, wherein the conductive structure of the first cell is a conductive interconnect structure within an interconnect level of the first cell, wherein the interconnect level of the first cell is defined above a gate electrode level of the first cell.
  • 15. The semiconductor device as recited in claim 14, wherein the interconnect level of the first cell is defined to include only linear-shaped conductive structures positioned parallel to each other.
  • 16. The semiconductor device as recited in claim 1, wherein the spacing allowance region provided by the second cell at the first location is sized to ensure that a design rule spacing distance exists between the conductive structure of the first cell and any conductive structure in the second cell positioned adjacent to the conductive structure of the first cell.
  • 17. The semiconductor device as recited in claim 1, wherein a second end of the conductive structure of the first cell is positioned to provide a spacing allowance region at the outer cell boundary of the first cell at a second location across the first cell from the first location.
  • 18. The semiconductor device as recited in claim 1, wherein a second end of the conductive structure is positioned within at least one-half of a design rule spacing distance from the outer cell boundary of the first cell at a second location across the first cell from the first location.
  • 19. The semiconductor device as recited in claim 18, wherein the second cell is formed to provide another spacing allowance region at a second location across the second cell from the first location.
  • 20. A method for manufacturing a semiconductor device, comprising: forming a first cell including circuitry for performing one or more logic functions, the circuitry of the first cell including a plurality of conductive features defined in one or more levels of the first cell, the first cell having an outer cell boundary defined to circumscribe the first cell, the first cell including a conductive structure formed to extend to within at least one-half of a design rule spacing distance from the outer cell boundary of the first cell at a first location; andforming a second cell including circuitry for performing one or more logic functions, the circuitry of the second cell including a plurality of conductive features defined in one or more levels of the second cell, the second cell having an outer cell boundary defined to circumscribe the second cell, a portion of the outer cell boundary of the second cell aligned with a portion of the outer cell boundary of the first cell that includes the first location, the second cell formed to provide a spacing allowance region for the conductive structure of the first cell at the first location.
CLAIM OF PRIORITY

This application is a continuation under 35 U.S.C. 120 of prior U.S. application Ser. No. 14/187,171, filed on Feb. 21, 2014, issued as U.S. Pat. No. 9,269,702, on Feb. 23, 2016, which is a divisional application under 35 U.S.C. 121 of prior U.S. application Ser. No. 12/904,134, filed Oct. 13, 2010, issued as U.S. Pat. No. 8,661,392, on Feb. 25, 2014, which claims priority under 35 U.S.C. 119(e) to U.S. Provisional Patent Application No. 61/251,279, filed Oct. 13, 2009. The disclosure of each above-identified patent application is incorporated herein by reference in its entirety.

US Referenced Citations (844)
Number Name Date Kind
4069493 Bobenrieth Jan 1978 A
4197555 Uehara et al. Apr 1980 A
4417161 Uya Nov 1983 A
4424460 Best Jan 1984 A
4575648 Lee Mar 1986 A
4602270 Finegold Jul 1986 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 Shinichi 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
5047979 Leung Sep 1991 A
5068603 Mahoney Nov 1991 A
5079614 Khatakhotan Jan 1992 A
5097422 Corbin et al. Mar 1992 A
5117277 Yuyama 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
5338963 Klaasen Aug 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
5798298 Yang 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
5905287 Hirata 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
6026225 Iwasaki 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
6084255 Ueda et al. Jul 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
6408427 Cong et al. Jun 2002 B1
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 May 2003 B1
6571379 Takayama May 2003 B2
6574786 Pohlenz et al. Jun 2003 B1
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
6621132 Onishi 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 Mar 2004 B2
6714903 Chu et al. Mar 2004 B1
6732334 Nakatsuka May 2004 B2
6732338 Crouse et al. May 2004 B2
6732344 Sakamoto et al. May 2004 B2
6734506 Oyamatsu 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
6806180 Cho 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
6820248 Gan Nov 2004 B1
6826738 Cadouri Nov 2004 B2
6834375 Stine et al. Dec 2004 B1
6835991 Pell, III Dec 2004 B2
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 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
6998722 Madurawe Feb 2006 B2
7003068 Kushner et al. Feb 2006 B2
7009862 Higeta et al. Mar 2006 B2
7016214 Kawamata et al. 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
7183611 Bhattacharyya 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
7257017 Liaw Aug 2007 B2
7264990 Rueckes et al. Sep 2007 B2
7266787 Hughes et al. Sep 2007 B2
7269803 Khakzadi 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
7358131 Bhattacharyya 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
7424696 Vogel 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 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
7492013 Correale, Jr. Feb 2009 B2
7500211 Komaki Mar 2009 B2
7502275 Nii et al. Mar 2009 B2
7503026 Ichiryu 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
7514355 Katase Apr 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 Walter 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 Jun 2010 B2
7749662 Matthew et al. Jul 2010 B2
7755110 Gliese et al. Jul 2010 B2
7770144 Dellinger Aug 2010 B2
7781847 Yang Aug 2010 B2
7791109 Wann et al. Sep 2010 B2
7802219 Tomar et al. Sep 2010 B2
7816740 Houston Oct 2010 B2
7825437 Pillarisetty et al. Nov 2010 B2
7842975 Becker et al. Nov 2010 B2
7873929 Kahng Jan 2011 B2
7882456 Zach Feb 2011 B2
7888705 Becker Feb 2011 B2
7898040 Nawaz Mar 2011 B2
7906801 Becker et al. Mar 2011 B2
7908578 Becker 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
7926001 Pierrat Apr 2011 B2
7932544 Becker et al. Apr 2011 B2
7932545 Becker et al. Apr 2011 B2
7934184 Zhang Apr 2011 B2
7939443 Fox et al. May 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 Jul 2012 B2
8217428 Becker et al. Jul 2012 B2
8225239 Reed 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
8258581 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
8294212 Wang et al. Oct 2012 B2
8316327 Herold Nov 2012 B2
8356268 Becker et al. Jan 2013 B2
8363455 Rennie 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
8667443 Smayling et al. Mar 2014 B2
8701071 Kornachuk et al. Apr 2014 B2
8735995 Becker et al. May 2014 B2
8756551 Becker et al. Jun 2014 B2
8836045 Becker et al. Sep 2014 B2
8839162 Amundson et al. Sep 2014 B2
8839175 Smayling et al. Sep 2014 B2
8847329 Becker et al. Sep 2014 B2
8863063 Becker et al. Oct 2014 B2
9006841 Kumar Apr 2015 B2
9202779 Kornachuk et al. Dec 2015 B2
9269423 Sever Feb 2016 B2
9336344 Smayling May 2016 B2
20010049813 Chan et al. Dec 2001 A1
20020003270 Makino Jan 2002 A1
20020015899 Chen et al. Feb 2002 A1
20020030510 Kono et al. Mar 2002 A1
20020063582 Rikino May 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
20030103176 Abe et al. Jun 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
20030203287 Miyagawa 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
20040164360 Nishida 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
20050044522 Maeda Feb 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
20050278673 Kawachi Dec 2005 A1
20050280031 Yano Dec 2005 A1
20060036976 Cohn Feb 2006 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
20060113533 Tamaki et al. Jun 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 Jun 2006 A1
20060146638 Chang et al. Jul 2006 A1
20060151810 Ohshige Jul 2006 A1
20060158270 Gibet et al. Jul 2006 A1
20060170108 Hiroi Aug 2006 A1
20060177744 Bodendorf et al. Aug 2006 A1
20060181310 Rhee Aug 2006 A1
20060195809 Cohn et al. Aug 2006 A1
20060195810 Morton 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
20060261417 Suzuki Nov 2006 A1
20060277521 Chen Dec 2006 A1
20070001304 Liaw Jan 2007 A1
20070002617 Houston Jan 2007 A1
20070004147 Toubou 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
20070186196 Tanaka Aug 2007 A1
20070196958 Bhattacharya et al. Aug 2007 A1
20070209029 Ivonin et al. Sep 2007 A1
20070210391 Becker Sep 2007 A1
20070234252 Visweswariah et al. Oct 2007 A1
20070234262 Uedi et al. Oct 2007 A1
20070241810 Onda Oct 2007 A1
20070251771 Huang Nov 2007 A1
20070256039 White Nov 2007 A1
20070257277 Takeda et al. Nov 2007 A1
20070264758 Correale 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
20080001176 Gopalakrishnan Jan 2008 A1
20080005712 Charlebois et al. Jan 2008 A1
20080021689 Yamashita et al. Jan 2008 A1
20080022247 Kojima 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
20080098341 Kobayashi 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 Nov 2008 A1
20080308848 Inaba Dec 2008 A1
20080308880 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 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
20090235215 Lavin et al. Sep 2009 A1
20090273100 Aton Nov 2009 A1
20090280582 Thijs et al. Nov 2009 A1
20090283921 Wang 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
20100115484 Frederick May 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
20100252865 Van Der Zanden Oct 2010 A1
20100252896 Smayling Oct 2010 A1
20100264468 Xu Oct 2010 A1
20100270681 Bird et al. Oct 2010 A1
20100287518 Becker Nov 2010 A1
20100301482 Schultz et al. Dec 2010 A1
20110014786 Sezginer Jan 2011 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
20110317477 Liaw Dec 2011 A1
20120012932 Perng et al. Jan 2012 A1
20120118854 Smayling May 2012 A1
20120131528 Chen May 2012 A1
20120273841 Quandt 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
20140197543 Kornachuk et al. Jul 2014 A1
20150249041 Becker et al. Sep 2015 A1
20150270218 Becker et al. Sep 2015 A1
Foreign Referenced Citations (77)
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
58-215827 Dec 1983 JP
61-182244 Aug 1986 JP
S63-310136 Dec 1988 JP
H01284115 Nov 1989 JP
03-165061 Jul 1991 JP
H05152937 Jun 1993 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-100872 Apr 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
2006-073696 Mar 2006 JP
2005-114752 Oct 2006 JP
2006-303022 Nov 2006 JP
2007-012855 Jan 2007 JP
2007-013060 Jan 2007 JP
2007-043049 Feb 2007 JP
2007-141971 Jun 2007 JP
2011-515841 May 2011 JP
10-0417093 Jun 1997 KR
10-1998-087485 Dec 1998 KR
1998-0084215 Dec 1998 KR
10-1999-0057943 Jul 1999 KR
2000-0005660 Jan 2000 KR
10-2000-0028830 May 2000 KR
10-2002-0034313 May 2002 KR
10-2002-0070777 Sep 2002 KR
2003-0022006 Mar 2003 KR
2004-0005609 Jan 2004 KR
10-2005-0030347 Mar 2005 KR
2005-0037965 Apr 2005 KR
2006-0108233 Oct 2006 KR
386288 Apr 2000 TW
200709309 Mar 2007 TW
200709565 Mar 2007 TW
200811704 Mar 2008 TW
200947567 Nov 2009 TW
WO 2005104356 Nov 2005 WO
WO 2006014849 Feb 2006 WO
WO 2006052738 May 2006 WO
WO 2006090445 Aug 2006 WO
WO 2007014053 Feb 2007 WO
WO 2007103587 Sep 2007 WO
Non-Patent Literature Citations (204)
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. 16, 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?articlelD=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/intel45nanometer-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, c-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 Forniation 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 et 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): TDF 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 No. 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-techniquedriven 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.
Kawasaki, H., et al., “Challenges Sram Cell and a Logic Circuit and Solutions of FinFET Integration in an for 22 nm node and beyond,” Electron Devices Meeting (IEDM), 2009 IEEE International, IEEE, Piscataway, NJ, USA, Dec. 7, 2009, pp. 1-4.
Related Publications (1)
Number Date Country
20160172375 A1 Jun 2016 US
Provisional Applications (1)
Number Date Country
61251279 Oct 2009 US
Divisions (1)
Number Date Country
Parent 12904134 Oct 2010 US
Child 14187171 US
Continuations (1)
Number Date Country
Parent 14187171 Feb 2014 US
Child 15051532 US