Model-based SRAF insertion

Information

  • Patent Grant
  • 8037429
  • Patent Number
    8,037,429
  • Date Filed
    Friday, September 30, 2005
    18 years ago
  • Date Issued
    Tuesday, October 11, 2011
    12 years ago
Abstract
A system for producing mask layout data retrieves target layout data defining a pattern of features, or portion thereof and an optimized mask layout pattern that includes a number of printing and non-printing features. Mask layout data for one or more subresolution assist features (SRAFs) is then defined to approximate one or more non-printing features of the optimized mask layout pattern.
Description
FIELD OF THE INVENTION

The present invention relates to the preparation of layout data for use in a photolithographic processing system and, in particular, to resolution enhancement techniques for improving the quality of a printed layout pattern on a semiconductor wafer.


BACKGROUND OF THE INVENTION

In conventional photolithographic processing, integrated circuits are created on a semiconductor wafer by exposing the wafer with a pattern of features on a mask or reticle. The pattern of features selectively exposes photosensitive chemicals on a wafer that is then further chemically and mechanically processed to build up layers of the integrated circuit.


As the features on a mask become smaller and smaller, optical distortions can occur whereby the exposure pattern created on a wafer will not match the pattern of features on the mask. To correct this, numerous resolution enhancement techniques (RETs) may be employed to improve the image quality so that the exposure pattern on a wafer more faithfully matches the pattern of features desired. Such RETs often comprise making extensive changes to the corresponding pattern of features on a mask to compensate for the known distortions in the imaging process.


With conventional resolution enhancement techniques, data for a pattern of mask features are analyzed with a computer program to estimate how a corresponding pattern of features will print on a mask. The data for the individual mask features or portions thereof may be adjusted such that the pattern created on the wafer will more faithfully match the desired layout. In addition, features, such as subresolution assist features (SRAFs), may be added to the layout data as necessary to improve printing fidelity. Typically, SRAFs are rectangular elements that are positioned adjacent to an edge of a feature in order to improve the contrast of the feature. The shape, size and placement of the SRAFs are typically predetermined, and often follow simple geometric rules.


While conventional resolution enhancement techniques are functional at compensating for some process distortions, a better match between the image produced and the image desired can be achieved.


SUMMARY OF THE INVENTION

To further improve the fidelity of a lithographic image to the desired layout pattern, the present invention is a system for generating mask layout data that approximates an optimized mask layout pattern that has been calculated to print a target pattern of features with a photolithographic process. The target layout pattern or portion thereof is received and the optimized mask layout pattern is calculated using the target layout pattern and the known parameters of a photolithographic printing system. The optimized mask layout pattern includes a number of printing features that correspond to features in the target layout and a number of non-printing features. In one embodiment of the invention, the mask layout data is generated from the optimized mask layout pattern by approximating one or more of the non-printing features as sub-resolution assist features (SRAFs). These SRAFs can in particular be generated with further constraints and criteria based on manufacturability parameters derived from the mask fabrication and/or wafer manufacturing processes.





BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing aspects and many of the attendant advantages of this invention will become more readily appreciated as the same become better understood by reference to the following detailed description, when taken in conjunction with the accompanying drawings, wherein:



FIG. 1 illustrates an example for a target pattern of features to be created on a semiconductor wafer;



FIG. 2 illustrates an optimized mask layout pattern calculated to print the target pattern of features on a semiconductor wafer shown in FIG. 1;



FIG. 3 illustrates a number of non-printing features contained in the optimized mask layout pattern shown in FIG. 2;



FIG. 4 illustrates a number of first order or primary non-printing features identified within the optimized mask layout pattern;



FIG. 5 illustrates a method of creating mask layout data that approximates one or more of the non-printing features in the optimized mask layout pattern in accordance with an embodiment of the present invention;



FIG. 6 illustrates a number of polygons defined in the mask layout data to approximate one or more of the non-printing features;



FIG. 7 illustrates a number of polygons defined in the mask layout data to approximate one or more of the non-printing features, including polygons oriented at 45 degree angles;



FIG. 8 is a flow chart of a method of creating mask layout data that approximates an optimized mask layout pattern in accordance with one embodiment of the present invention; and



FIG. 9 illustrates a representative computer system that can implement the present invention.





DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

As indicated above, the present invention is a system for approximating an optimized mask layout pattern for use in printing a target pattern of features with a photolithographic process. FIG. 1 illustrates a layout pattern of target features 8a, 8b, 8c . . . 8h etc., to be created on a semiconductor wafer.


In the example shown, the target features 8a-8h, etc. are square or rectangular contact pads in an integrated circuit. In the example, the normal 4× magnification of the mask features over the wafer features has also been assumed, and mask features are shown at the same scale of the corresponding wafer.



FIG. 2 illustrates one possible optimized mask layout pattern that is calculated to print the target features of FIG. 1. In the example shown in FIG. 2, the optimized mask layout pattern includes irregular polygons 10a, 10b, 10c, etc., corresponding to and occupying approximately the same position as each target feature/contact pad 8a, 8b, 8c . . . , to be created on the wafer. Also included in the optimized mask layout pattern are a number of first order non-printing features 12a, 12b, 12c . . . and second order non-printing features 14a, 14b, 14c . . . . At least some features are necessary in order to achieve an optimum printing of the individual target features 8a-8h . . . . The non-printing features 12a, 12b, 12c . . . are generally irregularly shaped polygons. This is generally a function of the inverse calculation performed to calculate the optimized mask layout pattern. Each polygon for the printing and non-printing features is stored in a layout database.


In one embodiment of the invention, the optimized mask layout pattern shown in FIG. 2 is calculated by reading in the target layout data, or portion thereof, from a layout database. Typically, the target layout data is stored as a number of polygons in a layout language such as GDS-II or OASIS™. In the example shown, the target layout database stores a polygon for each of the contact pads to be created on a wafer. In some embodiments, the layout database may store polygons hierarchically, whereby the data for a repeated target feature may be defined once in the database along with a list of where each instance of the target feature is to be printed on the wafer.


From the target layout data received and the known properties of the photolithographic system that will be used to print the mask layout data on a wafer, a calculation is performed with a computer system to determine what the optimized mask layout pattern should be in order to actually print the target layout of features 8 on a wafer. In one embodiment of the invention, the calculation of the optimized mask layout pattern comprises creating an inverse image of the target pattern using Fourier transforms and numerical de-convolution. In one embodiment of the invention, a gradient of an objective function based on the difference between a simulated image of the mask layout and the target image is generated analytically by convolution, and individual pixels in the mask layout are systematically changed to minimize this objective function. In one embodiment of the invention, the changes to the individual pixels can be further constrained by additional mask constraints, such as a minimum pixel size, total number of mask writer shots, or other mask writing limitations. In one embodiment of the invention, the calculation of the optimized mask layout pattern comprises optimizing both the mask and the illumination.


In one embodiment of the invention, the calculation of the optimized mask layout pattern is performed in accordance with techniques described in the paper “Solving Inverse Problems of Optical Microlithography” by Yuri Granik, published in Optical Microlithography XVIII, Proceedings of the SPIE Vol. 5754, pp. 506-526 (May 2005) and contained in U.S. Provisional Application No. 60/658,278, which are expressly incorporated by reference. In another embodiment of the invention, the optimized mask layout pattern is calculated in the manner described in U.S. Provisional Patent Application No. 60/722,840, titled “Fast Pixel-Based Mask Optimization for Inverse Lithography” by Yuri Granik, which is filed concurrently herewith and expressly incorporated by reference herein.


As used herein, the term “optimized” mask layout pattern refers to a layout pattern that is calculated mathematically from the target layout data and one or more optical parameters, e.g., illumination system, numerical aperture NA, illumination wavelength λ, etc. and process parameters such as print bias, resist threshold, etch bias, etc.


Once the optimized mask layout pattern has been calculated for printing the target pattern of features on a wafer, the non-printing features of the mask pattern are analyzed. Some of the non-printing features, for example, feature 12a, completely surround a printing feature, i.e., feature 10a. Other non-printing features, e.g., feature 12e, are merely nearby a corresponding printing feature, e.g., 10g. As indicated above, the optimized mask layout pattern also includes a number of second order non-printing features 14a, 14b, etc. For example, feature 14a is a second order feature to the printing feature 10a because it is farther away from the printing feature 10a than the primary or first order non-printing feature 12a.



FIG. 3 illustrates the optimized mask layout pattern with the printing features 10a-10h etc. removed, thereby leaving the non-printing features 12a, 12b, 12c . . . 14a, 14b, . . . . In one embodiment of the invention, second order non-printing features are not approximated in the mask layout data created. However, if time and processing power permit and if the features can be approximated on a mask, such second order (or higher) features can be included in the final mask layout data, if desired.



FIG. 4 illustrates the first order non-printing features 12 (shown as shaded) identified from the second order non-printing features 14 (shown as non-shaded). In one embodiment, the first order non-printing features 12 are identified in the optimized mask layout pattern by creating a set of polygons, with each of the printing features surrounded by a polygon. The dimension of the polygon will typically be the dimension of the printing feature expanded by a predetermined amount. This amount will typically be the sum of 1) a predetermined allowable distance between a printing feature and a first order non-printing feature, and 2) an additional amount added to accommodate the complete non-printing feature. This additional amount can be, for example, a factor of two or more times the typical non-printing feature width. A logical Boolean operation (typically an AND operation) is then carried out between the features of the optimized mask layout pattern and the polygons. Non-printing features which overlap the polygons are considered to be first order non-printing features, while those that do not overlap the polygons are higher order non-printing features. The critical maximum distance between printing features and the first order non-printing features is determined by evaluating the full mask optimization data. This distance typically varies according to the particular photolithographic process to be used and the target design to be created.


As can be seen, the non-printing features shown in FIGS. 3 and 44 generally have irregular shapes that either cannot be directly produced on a mask or would require too much time or memory to produce accurately on a mask. Typically, mask writers are limited by one or more parameters, including a minimum jog width for the beam writer and certain allowed angles with which mask features can be defined, and mask writing time can increase in proportion to the number of exposure shots required. To approximate a curved feature, several shots may be required where only one is needed for an equivalent rectangle. These limitations can prevent the non-printing features from being written on a mask directly. In addition, incorrect interpretation of these detailed shapes by the fracturing software used to convert data to mask writer formats can result in these features being incorrectly rendered, with odd polygonal shapes, additional unwanted jogs, or other structures that will not function correctly when included on the mask. Therefore, in one embodiment of the invention, one or more of the non-printing features of an optimized mask layout are analyzed and approximated with subresolution assist features that can be printed on a mask.


One method of generating mask features that approximate one or more of the non-printing features in the optimized mask layout pattern is shown in FIG. 5. In the embodiment shown, an area 50 of the optimized mask layout pattern is selected and divided into a grid having a number of cells. In one embodiment, each grid cell has a dimension corresponding to the minimum jog size of the mask writer to be used in creating the masks. The grid cells may be square but that is not required. The search area 50 is analyzed with a mathematical algorithm or numerical program in which an analysis window 52 has a length and width equal to a preset number of grid cells. The analysis window 52 is generally rectangular or square but could be other shapes. In the example shown in FIG. 5, the analysis window 52 is a rectangle having a width of four grid cells and a height of two grid cells. The analysis window 52 is compared to various regions of the search area 50 by using a numerical algorithm that places a corner of the window 52 at a corresponding corner of a grid cell, and then stepping the location through each of the grid cells one-by-one. Next, it is determined if the analysis window 52 overlaps an area of a first order non-printing feature. In one embodiment shown, the area of the non-printing feature contained by the analysis window 52 is compared to the area of the analysis window to determine what the percentage of the window is occupied by a non-printing feature. If the area occupied is greater than some predetermined threshold, a polygon having a dimension equal to the dimensions of the analysis window 52 is defined in the mask layout data. The mask layout data is typically created in a separate data layer, distinct from the data layers used to represent the polygons of the target layout and also the those that represent the optimized mask layout pattern. This process is repeated until the window is stepped through the entire search area 50.


If the analysis window 52 is not square, the orientation of the window can be changed and the window stepped through the search area 50 again. In the example shown, the analysis window 52 is rotated by 90 degrees to be two grid cells wide and four grid cells high to capture vertically oriented portions of the non-printing features. FIG. 6 illustrates a number of polygons 60, 62, 64, 66 overlaying a non-printing feature 12a. The polygons 60-66 are defined to approximate portions of the non-printing feature 12a. Polygons 60 and 62 are created by stepping a horizontally oriented, rectangular analysis window through the optimized mask layout pattern. In addition, polygons 64 and 66 are defined to approximate portions of the non-printing feature 12a by stepping a vertically oriented rectangular analysis window through the optimized mask layout pattern.


In some instances, a mask writer can write geometries at an angle such as ±45 degrees. Therefore, if the mask layout data is to be used with such a mask writer, the optimized mask layout pattern can be rotated by ±45 degrees and the above process of searching areas with an analysis window repeated. FIG. 7 illustrates additional polygons 68, 70, 72, 74, positioned over a corresponding feature 12a. The polygons 68-79 are defined in the mask layout data to approximate the non-printing feature 12a. The polygons 68-74 are obtained by creating a version of the optimized mask layout pattern with coordinates rotated at angles of ±45 degrees, stepping a rectangular search window through the pattern in the manner described above, then rotating the coordinates of the mask data generated in this step by an inverse of the original rotation. The inverse rotation ensures that all mask data is written using the same orientation as the original target data.


As will be appreciated, each of the polygons 60-74 is initially defined as a series of rectangular (or other shape) polygons corresponding to the shape of the analysis window. For example, a single polygon may be defined for each group overlapping polygons by including the outer perimeter of the overlapping polygons. The combined polygon defines a subresolution assist feature within the mask layout data because the polygon is not large enough to print on a wafer but does aid in printing a target feature.


Once the mask data are determined that approximate one or more of the non-printing features of optimized mask layout pattern, a data clean-up step can be executed. In one embodiment, polygons or portions thereof in the mask layout data that overlap can be removed if the density of one of the overlapping polygons is less than that of another. Similarly, the maximum width of an individual polygon can be thinned to have a width that is less than the maximum width of a non-printing feature for the photolithographic processing system to be used. Similarly, the maximum length of any polygon can be shortened to be less than the length of a maximum non-printing feature.


In yet another embodiment, irregularly shaped polygons that approximate a non-printing feature or portion thereof can be simplified to remove jogs or other features that are difficult to write on a mask, or the shot count has increased to such a degree that the write time is too long. The exact parameters and limitations of the clean-up step can be selected by a user, and can use criteria based on rules derived from the printing capabilities of the mask writer or can be based on a model simulation of how the polygons will behave during photolithographic processing.


Although the embodiment of the present invention described operates to create mask layout data features that approximate one or more first order, non-printing features in the optimized mask layout pattern, it will be appreciated that polygons that approximate the second order or higher non-printing features could also be included in the mask layout data if desired.



FIG. 8 is a flow chart illustrating a series of steps performed by one embodiment of the present invention in order to produce mask layout data for one or more masks to print a target layout pattern. Beginning at 100, target layout data for a layout design, or portion thereof, is retrieved from a layout database. At 102, an optimized mask layout pattern is computed from the target layout data and the optical properties of the photolithographic system to be employed in printing the target layout.


At 104, the non-printing features of the optimized mask layout pattern are identified. These can be copied to a separate data layer containing only these non-printing features, or remain in a data layer merged with printing features. At 106, mask features are defined that approximate all or a portion of one or more of the non-printing features. As described above, in one embodiment of the invention, subresolution assist features are defined to approximate only the first order non-printing features. However, subresolution assist features that approximate higher order non-printing features can be included in the mask layout data, if desired. At 108, the mask layout data is created by merging the printing features and the sub-resolution assist features corresponding to the non-printing features and is stored in a database.


The data for the printing features can be either the polygons 10 computed in the optimized mask layout pattern or can be the polygons that describe the original target features 8. The mask layout data, including the data for the target features and the data that correspond to the non-printing features, is then finalized. In some embodiments of the invention, additional analysis and correction of the mask layout data may be performed (such as DRC, OPC, PSM, etc.) at 110. At 112, the finalized data is converted to standard encapsulation formats such as GDS-II or OASIS, or converted (fractured) into mask writer formats (MEBES, Hitachi, .MIC, etc.). At 114, the finalized, converted mask data is exported, for example, to a mask writer to create one or more masks used for creating the target pattern features on a semiconductor wafer.



FIG. 9 illustrates one embodiment of a computer system that can be used to implement the present invention. In the example shown, a computer system 200 includes one or more programmable processors that receive a set of executable instructions on a computer-readable media 202. Alternatively, the instructions may be received from a wireless or wired communications link 204. The computer system 200 executes the instructions to receive target layout data from a layout database 206 in order to compute mask layout data that can be transmitted to a mask writer 210, as described above.


The computer system 200 may be a stand alone, single or multiprocessor device or may be a networked or parallel processing computer system. In addition, the computer system 200 may be connected by a communication link 220, such as the Internet, to one or more remotely located computers 240. Target layout data can be retrieved from the layout database and transmitted to the remotely located computer 240, which may be inside or outside the United States, to perform the mask data calculations as described above. Mask layout data from the remotely located computer 240 can be returned to the computer system 200 or transmitted directly to the mask writer 210 to create one or more corresponding masks or reticles.


While the preferred embodiment of the invention has been illustrated and described, it will be appreciated that various changes can be made therein without departing from the scope of the invention. It is therefore intended that the scope of the invention be determined from the following claims and equivalents thereof.

Claims
  • 1. A method of preparing mask layout data for use in a photolithographic printing system to create a pattern of features on a semiconductor wafer, comprising: receiving target layout data that defines a pattern of features to be printed on a semiconductor wafer;determining an optimized mask layout pattern that will produce the pattern of features on a semiconductor wafer, wherein the optimized mask layout pattern includes data for printing features and data for a number of non-printing features, and wherein the optimized mask layout pattern is determined by computing a deconvolution,defining one or more subresolution assist features in the mask layout data that approximates one or more non-printing features; andusing a computer, combining the data for the subresolution assist features and the data for the printing features to create the mask layout data.
  • 2. One or more computer-readable storage media storing a sequence of program instructions that when executed by a computer causes the computer to perform a method, the method comprising: receiving target layout data that defines a pattern of features to be printed on a semiconductor wafer;determining an optimized mask layout pattern that will produce the pattern of features on a semiconductor wafer, wherein the optimized mask layout pattern includes data for printing features and data for non-printing features;stepping a first analysis window at a predefined first orientation through at least a portion of the optimized mask layout pattern;determining if the analysis window overlaps with at least a portion of a first non-printing feature;defining a first subresolution assist feature for mask layout data if the analysis window and the first non-printing feature overlap by a first predetermined amount:stepping a second analysis window at a second orientation through at least a portion of the optimized mask layout pattern;determining if the second analysis window overlaps with a least a portion of a second non-printing feature;defining a second subresolution assist feature for the mask layout data if the second analysis window and the second non-printing feature overlap by a second predetermined amount; andstoring data for the first subresolution assist feature and the second subresolution assist features.
  • 3. The one or more computer-readable storage media of claim 2, wherein the first orientation is orthogonal to the second orientation.
  • 4. The one or more computer-readable storage media of claim 2, wherein the first orientation is oriented about 45 degrees to the second orientation.
  • 5. The one or more computer-readable storage media of claim 2, wherein the method further comprises: determining an area of overlap between the first subresolution assist feature and the second subresolution assist feature; andmodifying one of the first subresolution assist feature or the second subresolution assist feature to reduce the area of the overlap.
  • 6. A method of preparing mask layout data for use in a photolithographic printing system comprising: receiving target layout data that defines a pattern of features to be printed on a semiconductor wafer;determining an optimized mask layout pattern that will produce the pattern of features on a semiconductor wafer, wherein the optimized mask layout pattern includes data for printing features and data for non-printing features;using a computer, selecting one or more of the non-printing features based in part upon on a distance between one or more of the non-printing features and at least one of the printing feature, wherein the distance is calculated using one or more Boolean operations on the one or more of the non-printing features and the at least one of the printing features;defining data for one or more subresolution assist features that approximate the selected non-printing features, wherein at least one of the sub resolution assist features is defined by:defining a first polygon that approximates a respective selected non-printing feature,defining a second polygon that approximates the respective selected nonprinting feature, wherein the second polygon is different than the first polygon, andcombining the first polygon and the second polygon to produce data for the at least one of the sub resolution features; andcreating the mask layout data at least in part from the data for the subresolution assist features and the data for the printing features.
CROSS-REFERENCE TO RELATED APPLICATION

The present application claims the benefit of U.S. Provisional Application No. 60/658,278, filed Mar. 2, 2005.

US Referenced Citations (100)
Number Name Date Kind
4532650 Wihl et al. Jul 1985 A
4762396 Dumant et al. Aug 1988 A
4989156 Ikenaga Jan 1991 A
5396584 Lee et al. Mar 1995 A
5502654 Sawahata Mar 1996 A
5655110 Krivokapic et al. Aug 1997 A
5699447 Alumot et al. Dec 1997 A
5723233 Garza et al. Mar 1998 A
5815685 Kamon Sep 1998 A
5825647 Tsudaka Oct 1998 A
5879844 Yamamoto et al. Mar 1999 A
5886908 Conn et al. Mar 1999 A
5991006 Tsudaka Nov 1999 A
6016357 Neary et al. Jan 2000 A
6042257 Tsudaka Mar 2000 A
6049660 Ahn et al. Apr 2000 A
6056785 Chisaka May 2000 A
6077310 Yamamoto et al. Jun 2000 A
6080527 Huang et al. Jun 2000 A
6120952 Pierrat et al. Sep 2000 A
6128067 Hashimoto Oct 2000 A
6187483 Capodieci et al. Feb 2001 B1
6243855 Kobayashi et al. Jun 2001 B1
6249904 Cobb Jun 2001 B1
6263299 Aleshin et al. Jul 2001 B1
6269472 Garza et al. Jul 2001 B1
6301697 Cobb Oct 2001 B1
6312854 Chen et al. Nov 2001 B1
6317859 Papadopoulou Nov 2001 B1
6370679 Chang et al. Apr 2002 B1
6416907 Winder et al. Jul 2002 B1
6425117 Pasch et al. Jul 2002 B1
6430737 Cobb et al. Aug 2002 B1
6453452 Chang et al. Sep 2002 B1
6453457 Pierrat et al. Sep 2002 B1
6467076 Cobb Oct 2002 B1
6470489 Chang et al. Oct 2002 B1
6499003 Jones et al. Dec 2002 B2
6574784 Lippincott et al. Jun 2003 B1
6620561 Winder et al. Sep 2003 B2
6643616 Granik et al. Nov 2003 B1
6649309 Mukherjee Nov 2003 B2
6665845 Aingaran et al. Dec 2003 B1
6668367 Cobb et al. Dec 2003 B2
6728946 Schellenberg et al. Apr 2004 B1
6748578 Cobb Jun 2004 B2
6792159 Aufrichtig et al. Sep 2004 B1
6792590 Pierrat et al. Sep 2004 B1
6815129 Bjorkholm et al. Nov 2004 B1
6817003 Lippincott et al. Nov 2004 B2
6851103 Van Den Broeke et al. Feb 2005 B2
6857109 Lippincott Feb 2005 B2
6887633 Tang May 2005 B2
6901576 Liebmann et al. May 2005 B2
6928634 Granik et al. Aug 2005 B2
6973633 Lippincott et al. Dec 2005 B2
7010776 Gallatin et al. Mar 2006 B2
7013439 Robles et al. Mar 2006 B2
7024655 Cobb Apr 2006 B2
7028284 Cobb et al. Apr 2006 B2
7047516 Futatsuya May 2006 B2
7073162 Cobb et al. Jul 2006 B2
7155689 Pierrat et al. Dec 2006 B2
7155699 Cobb Dec 2006 B2
7172838 Maurer et al. Feb 2007 B2
7181721 Lippincott et al. Feb 2007 B2
7237221 Granik et al. Jun 2007 B2
7240305 Lippincott Jul 2007 B2
7240321 Cobb et al. Jul 2007 B2
7247574 Van Den Broeke et al. Jul 2007 B2
7266803 Chou et al. Sep 2007 B2
7281234 Lippincott Oct 2007 B2
7293249 Robles et al. Nov 2007 B2
7324930 Cobb Jan 2008 B2
7367009 Cobb et al. Apr 2008 B2
7487489 Granik Feb 2009 B2
7493587 Word Feb 2009 B2
7552416 Granik et al. Jun 2009 B2
20020199157 Cobb Dec 2002 A1
20030170551 Futatsuya Sep 2003 A1
20040005089 Robles et al. Jan 2004 A1
20040044431 Pellegrini et al. Mar 2004 A1
20040088149 Cobb May 2004 A1
20050050490 Futatsuya et al. Mar 2005 A1
20050053848 Wampler et al. Mar 2005 A1
20050149900 Laidig Jul 2005 A1
20050149901 Tang Jul 2005 A1
20050251771 Robles Nov 2005 A1
20050278686 Word et al. Dec 2005 A1
20060188796 Word Aug 2006 A1
20060199084 Word Sep 2006 A1
20060240342 Tang Oct 2006 A1
20060269875 Granik Nov 2006 A1
20070006113 Hu et al. Jan 2007 A1
20070074143 Cobb et al. Mar 2007 A1
20070118826 Lippincott May 2007 A1
20070124708 Robles et al. May 2007 A1
20070198963 Granik et al. Aug 2007 A1
20080141195 Robles et al. Jun 2008 A1
20080193859 Hamouda Aug 2008 A1
Foreign Referenced Citations (6)
Number Date Country
09319067 Dec 1997 JP
2004-502961 Jan 2004 JP
WO 9914637 Mar 1999 WO
WO 9914638 Mar 1999 WO
WO 0165315 Sep 2001 WO
WO 2007041135 Apr 2007 WO
Related Publications (1)
Number Date Country
20060200790 A1 Sep 2006 US
Provisional Applications (1)
Number Date Country
60658278 Mar 2005 US