Method, system and medium for controlling manufacture process having multivariate input parameters

Information

  • Patent Grant
  • 7966087
  • Patent Number
    7,966,087
  • Date Filed
    Tuesday, July 31, 2007
    17 years ago
  • Date Issued
    Tuesday, June 21, 2011
    13 years ago
Abstract
A method, system, and medium of modeling and/or for controlling a manufacturing process is disclosed. In particular, a method according to embodiments of the present invention includes calculating a set of predicted output values, and obtaining a prediction model based on a set of input parameters, the set of predicted output values, and empirical output values. Each input parameter causes a change in at least two outputs. The method also includes optimizing the prediction model by minimizing differences between the set of predicted output values and the empirical output values, and adjusting the set of input parameters to obtain a set of desired output values to control the manufacturing apparatus. Obtaining the prediction model includes transforming the set of input parameters into transformed input values using a transformation function of multiple coefficient values, and calculating the predicted output values using the transformed input values.
Description
FIELD OF THE INVENTION

The present invention relates to a method, system and medium for modeling and controlling processes. More specifically, the present invention relates to modeling and controlling semiconductor-processing equipment that has multivariate input parameters.


BACKGROUND OF THE INVENTION

In manufacturing products that include precision discrete parts (e.g., microelectronic chips on silicon substrates), controlling manufacturing processes plays a crucial role. Controlling such processes may require, among other things, monitoring the characteristics of manufactured parts (e.g., processed wafers, hereinafter referred to as outputs) and adjusting input parameters accordingly. By adjusting the values of the input parameters, different types of outputs can be produced and the characteristics of the outputs can also be controlled.


For automating the control of the manufacturing processes, a mathematical model of the processing equipment can be used. One example of such a model is called a predictive model. This model is used to predict the future output values (e.g., the characteristics of products) based on historical information (e.g., input parameter values and the corresponding output qualities).


One such predictive model is an offset technique, which is illustrated in FIG. 1. In particular, the values of a number of input parameters 101 are received by an input/output dependency model 103, which calculates a predicted output value y1Pred 105 based on the input values. A corrector 109 then compares the predicted value y1Pred with an actual output value y1a 107 for the given values of the input parameters. If the predicted and actual output values are similar to each other within a certain range, no change is made to the input/output dependency model 103. If the predicted and actual output values are different (e.g., outside the range) from each other, the predictor input/output dependency model 103 is modified by adjusting an offset value (O1) 111 based on the magnitude of the difference.


In equipment that has more than one output, at least some of the outputs may include mutual (shared) inputs. This means the output values of the equipment are not completely independent from each other (e.g., changing an input to adjust a given output may unintentionally change the characteristics of other outputs). In a conventional modeling technique, each output has its own correction system as if the output values are independent from each other. Because the dependencies between the different outputs are not accounted for by the conventional technique, it does not always lead to accurate predictions. In addition, adjusting one offset of one output can affect other outputs.


SUMMARY OF THE INVENTION

Embodiments of the present invention advantageously overcome the above-described shortcomings of the aforementioned techniques. More specifically, embodiments of the present invention provide a system, method and medium for controlling semiconductor-processing equipment that has multivariate input parameters and outputs.


Embodiments of the present invention minimize the effects of outputs being interdependent from each other. This is achieved by providing input parameter transformations having transformation coefficients. The coefficients are obtained by minimizing a score function. This, in turn, allows accurate models to be obtained. Using the models, highly precise control of manufacturing equipment is accomplished.


In particular, an example method according to embodiments of the present invention includes the steps of identifying at least one input that causes a change in at least two of a plurality of outputs, storing values of the identified inputs and corresponding empirical output values, and calculating and storing predicted output values, based on, in part, the values of the identified inputs. The example method may further include the steps of calculating a set of transform coefficients by minimizing a score equation that is a function of, in part, differences between one or more of the empirical output values and their corresponding predicted output values, and calculating one or more input values for one or more desired output values based on, in part, the calculated set of transform coefficients.





BRIEF DESCRIPTION OF THE DRAWINGS

The detailed description of the present application showing various distinctive features may be best understood when the detailed description is read in reference to the appended drawings in which:



FIG. 1 is a diagram showing a conventional offset model;



FIG. 2 is a diagram illustrating processing equipment;



FIG. 3 is a diagram illustrating a model of the processing equipment shown in FIG. 2 in accordance with embodiments of the present invention;



FIG. 4 is a block diagram illustrating various components of embodiments of the present invention;



FIG. 5 is a flow chart illustrating processing steps of embodiments of the present invention;



FIG. 6 is a diagram illustrating a CMP process;



FIG. 7 is a block diagram representation of an example embodiment of a computer configured to perform embodiments of the present invention; and



FIG. 8 is a diagram illustrating an example of a memory medium that can be used for storing computer programs of embodiments of the present invention.





DETAILED DESCRIPTION

Embodiments of the present invention generally provide systems, methods and mediums for creating one or more adaptive process models to mathematically represent multivariate input parameter systems. The present invention is particularly applicable in a manufacturing process such as manufacturing and/or processing semiconductor wafers. In particular, the present invention relates to modeling techniques as used by equipment involved in the manufacturing of semiconductor wafers. A general overview of embodiments of the present invention is provided below. It will be followed by a specific example implementation of the present invention.


Before discussing embodiments of the present invention, FIG. 2 shows a simplified graphical representation of processing equipment 205 with input parameters 201 and outputs 203. Examples of processing equipment include etcher tools, deposition tools, chemical mechanical planarization (CMP) tools, etc. The processing equipment 205 can include one or more tools. Depending upon the values of the input parameters 201, different processes can be achieved. For instance, in a deposition tool, different types of layers can be deposited on a wafer and/or the thickness of the layer can be varied.


As a general overview of embodiments of the present invention, in FIG. 3, the processing equipment 205 has a set of input parameters 301, a set of predicted outputs 303, and a prediction model 305 therebetween (replacing the processing equipment of FIG. 2). The overall goal of the prediction model is to minimize differences between the predicted output values and empirically collected output values (i.e., the actual output values). Once the prediction model is optimized (e.g., the differences between the predicted and actual output values have been minimized), the model can then be used in setting input parameters based on desired output values. In other words, for a given set of desired output values, the model can be used in a reverse fashion to calculate the input parameter values that would cause output values close to the desired output values. The calculated input parameter values are also known as recipes.


In embodiments of the present invention, the step of obtaining the predictive model can be divided into two steps. The first is to transform the values of the input parameters 301 into transformed input values 307. The second is to use the transformed input values 307 in calculating predicted output values 303.


With respect to the transformation, input parameter values (X1, X2, X3) along with coefficient vector {right arrow over (P)} are transformed into (X′1, X′2, and X′3) by transform functions ψ1, ψ2, and ψ3. Examples of transformation functions include:


X′1=PX1; X′2=PX2 (In this example, the value of {right arrow over (P)} is identical for both X1 and X2.)


2) X′1=P11X1+P12X12; X′2=P21X12+P22X22+PcrossX1X2 (In this example, P11, P12, P21, P22 and Pcross can have different values.)


The coefficient values are calculated by the steps of: a. collecting historical information on input parameter values and actual output values; b. creating a score function based on the collected information; and c. finding the coefficient values that minimize the score function, Sp.


The above steps are described by making references to semiconductor processing tools. As such, the step of collecting the historical information entails a set of data points for processing a number of wafers. In particular, input parameter values and actual output values for a number of wafers that have been processed by the processing equipment would be collected. This collection would then be used in the next step of minimizing the score function. Here, the score function, Sp, is:







S
p

=




i
,
k






W

i
,
k


(


y
actual
ik

-


y
predicted
ik



(



X
->


i





(



X
->

i

,

P
->


)


)



)

2







where:

  • i—number of wafer;
  • k—number of output;
  • yactual—an actual output value;
  • ypredicted—a predicted output value, as calculated based on transformed inputs for a particular wafer i ({right arrow over (X)}′i);
  • {right arrow over (X)}′i=(X′1i, X′2i, X′3i) is the transformed input vector, calculated on the base of the actual input;
  • and {right arrow over (X)}i=(X1i, X2i, X3i) for wafer i together with the transformation parameters {right arrow over (P)}. This calculation is performed using the following transformation functions:

    ψ1(X1, X2, X3,{right arrow over (P)}); ψ2(X1, X2, X3,{right arrow over (P)}); and ψ3(X1, X2, X3,{right arrow over (P)}).

    The next step, as noted above, is to minimize the score Sp, i.e., to find {right arrow over (P)} values that provide the minimum of Sp (Spcustom charactermin)


The above-described steps calculate an optimal {right arrow over (P)} (i.e., a vector of coefficients for input transformation functions) such that the prediction model of the present invention provides the closest possible predicted outputs to the actual outputs. In a processing model with multivariate input parameters, when the score is minimized, the negative effect of the interdependencies between output values on the model accuracy would also be minimized.


Now turning to describe an example implementation of the embodiments described above, as shown in FIG. 4, the example implementation includes a number of components: an input transformer 401, an input-output dependency model 403, a corrector 405 and a storage device 407. All these components can be implemented in hardware, firmware, software and/or any combination thereof.


These components are further explained by also referring to FIG. 5. In particular, the historical information (i.e., yaik,{right arrow over (X)}i) is stored into the storage device 407. The corrector 405 then retrieves the historical information (yaik,{right arrow over (X)}i) from the storage device 407 (step 501). Since the retrieved historical information contains raw input parameter values, the information is sent to the input transformer 401 along with coefficients {right arrow over (P)} (step 503). The coefficient {right arrow over (P)} can be stored in the storage device 407 or in the corrector 405.


The input transformer 401, upon receiving the information from the corrector 405, calculates transformed input parameter values {right arrow over (X)}′i (step 505). Once the transformed input parameter values are calculated, the input transformer 401 sends the transformed input values to the corrector 405.


The corrector 405, upon receiving the transformed input parameter values from the input transformer 401, sends the transformed input parameter values to the input/output dependence model 403. The input/output dependency model 403 then calculates predicted output parameter values ypred (step 507). The corrector 405 then calculates the score Sp, and sets a new {right arrow over (P)} (a vector of parameters of input transformation functions) in order to minimize the score Sp (step 509). These steps can be repeated until an optimum {right arrow over (P)} that yields a minimal score Sp is obtained, and return the optimum {right arrow over (P)}. Each time new data is obtained, a new score from new data is created and a new optimum {right arrow over (P)} value is calculated. This newly calculated vector {right arrow over (P)} could be used for transforming the input values, meaning: {right arrow over (P)}new≡{right arrow over (P)}optimum.


In embodiments of the present invention, the optimum coefficients can be combined with the most recent vector such that:

{right arrow over (P)}new≡{right arrow over (P)}previous+K({right arrow over (P)}optimum−{right arrow over (P)}previous) wherein K<1.


As a new set of data points arrives, a new optimum {right arrow over (P)} can be recalculated.


Once a set of coefficients is calculated, a set of input values can be obtained (e.g., a recipe) for a desired set of output values. More specifically, from a set of desired values, a set of transformed input values, {right arrow over (X)}′i, can be obtained by reversing the predictive model (e.g., the input/output dependence model 403). The transformed input values can then be reverse transformed using the coefficients {right arrow over (P)} to obtain the input value to produce the desired output values.


In the above-described embodiments, the raw input values are transformed using the calculated coefficients. The transformation is required to account for the dependencies among input parameters as graphically illustrated in FIG. 6. More specifically, a surface of a wafer having five regions with varying degrees of roughness is to be polished by a CMP process. The goal is to achieve a flat surface depicted by a dotted line in FIG. 6. In conventional techniques, one region would be polished without regard to the other regions. However, polishing one region can affect the polishing of another region (e.g., when an offset is applied in region 1 in order to bring the height in region 1 down to the broken line, the height in region 2 is also influenced by the changes of region 1). Using the embodiments of the present invention, these dependencies are accounted for.


An example embodiment of the computer in which embodiments of the present invention operate (e.g., the various components described in FIG. 4) is described below in connection with FIGS. 7-8. FIG. 7 illustrates a block diagram of one example of the internal hardware 713 of a computer configured to perform embodiments of the present invention. A bus 756 serves as the main information highway interconnecting various components therein. CPU 758 is the central processing unit of the internal hardware 713, performing calculations and logic operations required to execute embodiments of the present invention as well as other programs. Read only memory (ROM) 760 and random access memory (RAM) 762 constitute the main memory. Disk controller 764 interfaces one or more disk drives to the system bus 756. These disk drives are, for example, floppy disk drives 770, or CD ROM or DVD (digital video disks) drives 766, or internal or external hard drives 768. These various disk drives and disk controllers are optional devices.


A display interface 772 interfaces display 748 and permits information from the bus 756 to be displayed on display 748. Communications with external devices, such as the other components of the system described above, occur utilizing, for example, communication port 774. Optical fibers and/or electrical cables and/or conductors and/or optical communication (e.g., infrared, and the like) and/or wireless communication (e.g., radio frequency (RF), and the like) can be used as the transport medium between the external devices and communication port 774. Peripheral interface 754 interfaces the keyboard 750 and mouse 752, permitting input data to be transmitted to bus 756. In addition to these components, the internal hardware 713 also optionally includes an infrared transmitter and/or infrared receiver. Infrared transmitters are optionally utilized when the computer system is used in conjunction with one or more of the processing components/stations/modules that transmit/receive data via infrared signal transmission. Instead of utilizing an infrared transmitter or infrared receiver, the computer system may also optionally use a low power radio transmitter 780 and/or a low power radio receiver 782. The low power radio transmitter transmits the signal for reception by components of the production process, and receives signals from the components via the low power radio receiver. The low power radio transmitter and/or receiver are standard devices in industry.


Although the computer in FIG. 7 is illustrated having a single processor, a single hard disk drive and a single local memory, the analyzer is optionally suitably equipped with any multitude or combination of processors or storage devices. For example, the computer may be replaced by, or combined with, any suitable processing system operative in accordance with the principles of embodiments of the present invention, including sophisticated calculators, and hand-held, laptop/notebook, mini, mainframe and super computers, as well as processing system network combinations of the same.



FIG. 8 is an illustration of an example computer readable memory medium 884 utilizable for storing computer readable code or instructions. As one example, medium 884 may be used with disk drives illustrated in FIG. 7. Typically, memory media such as floppy disks, or a CD ROM, or a digital video disk will contain, for example, a multi-byte locale for a single byte language and the program information for controlling the modeler to enable the computer to perform the functions described herein. Alternatively, ROM 760 and/or RAM 762 illustrated in FIG. 7 can also be used to store the program information that is used to instruct the central processing unit 758 to perform the operations associated with various automated processes of the present invention. Other examples of suitable computer readable media for storing information include magnetic, electronic, or optical (including holographic) storage, some combination thereof, etc.


In general, it should be emphasized that the various components of embodiments of the present invention can be implemented in hardware, software or a combination thereof. In such embodiments, the various components and steps would be implemented in hardware and/or software to perform the functions of embodiments of the present invention. Any presently available or future developed computer software language and/or hardware components can be employed in such embodiments of the present invention. For example, at least some of the functionality mentioned above could be implemented using Visual Basic, C, C++, or any assembly language appropriate in view of the processor(s) being used. It could also be written in an interpretive environment such as Java and transported to multiple destinations to various users.


The many features and advantages of embodiments of the present invention are apparent from the detailed specification, and thus, it is intended by the appended claims to cover all such features and advantages of the invention which fall within the true spirit and scope of the invention. Further, since numerous modifications and variations will readily occur to those skilled in the art, it is not desired to limit the invention to the exact construction and operation illustrated and described, and accordingly, all suitable modifications and equivalents may be resorted to, falling within the scope of the invention. For instance, output values can be transformed similar to the transform performed on the input parameters, and operations can be performed on the transformed output values similar to those performed on the transformed input parameters.

Claims
  • 1. A method for controlling a manufacturing apparatus, the method comprising: calculating, by a computer system, a set of predicted output values; obtaining, by the computer system, a prediction model based on a set of input parameters, the set of predicted output values and empirical output values, wherein obtaining the predication model comprises transforming the set of input parameters into transformed input values using a transformation function having a plurality of coefficient values;optimizing, by the computer system, the prediction model by minimizing differences between the set of predicted output values and the empirical output values, wherein minimizing the differences comprises collecting historical information on the set of input parameters and the empirical output values; creating a score function on the collected information; and determining coefficient values that minimize the score function to minimize the difference; andadjusting, by the computer system, the set of input parameters using the optimized prediction model to obtain a set of desired output values to control the manufacturing apparatus.
  • 2. The method of claim 1, wherein obtaining the prediction model comprises: transforming the set of input parameters into transformed input values using a transformation function having a plurality of coefficient values; andcalculating predicted output values using the transformed input values.
  • 3. The method of claim 1, wherein the score function is
  • 4. The method of claim 3, further comprising: collecting additional empirical output values and corresponding input values;calculating a new set of coefficients {right arrow over (P)}new; andusing the new set of coefficients as the optimal value of {right arrow over (P)}.
  • 5. The method of claim 3, further comprising: collecting additional empirical output values and corresponding input values;calculating a new set of coefficients as {right arrow over (P)}new≡{right arrow over (P)}previous+K({right arrow over (P)}optimum−{right arrow over (P)}previous),
  • 6. A manutacturing apparatus, comprising: a memory device storing a set of input parameters and empirically-collected output values; a processing device, coupled to the memory device, to receive the set of input parameters and to calculate a set of predicted output values, wherein the processing device is configured to calculate a prediction model to minimize differences between the set of predicted output values and the empirically collected output values;calculate the predication model to minimized the difference comprises the processing device to transform the set of input parameters into transformed input values using a transformation function having a plurality of coefficient value, to collect historical information on the set to input parameters and the empirical output values, to create a score function based on the collected information, and to determine coefficient values that minimize the score function to minimize the differences and to obtain a set of desired output value to control manufacturing apparatus.
  • 7. The manufacturing apparatus of claim 6, wherein the processing device is configured to use the prediction model in a reverse fashion to set a new set of input parameters to obtain a set of desired output values.
  • 8. The manufacturing apparatus of claim 6, further comprising a tool that is controlled by the processing device, wherein the set of input parameters is a recipe for the tool.
  • 9. The manufacturing apparatus of claim 6, wherein the tool is at least one of a etcher tool, a deposition tool, or a chemical mechanical planarization tool.
  • 10. A non-transitory computer-readable medium for storing instructions that when executed a computer cause the computer to perform a method for predicting output characteristics of a device produced by a manufacturing apparatus, the method comprising: calculating a set of predicted output values;obtaining a prediction model based on a set of input parameters, the set of predicted output values, and empirical output values, wherein obtaining the predication model comprises transforming the set of input parameters into transformed input values using a transformation function having a plurality of coefficient values;optimizing the prediction model by minimizing differences between the set of predicted output values and the empirical output values, wherein minimizing the differences comprises collecting historical information on the set of input parameters and the empirical output values; creating a score function on the collected information; and determining coefficient values that minimize the score function to minimize the difference; andadjusting the set of input parameters using the optimized prediction model to obtain a set of desired output values to control the manufacturing apparatus.
  • 11. The medium of claim 10, wherein obtaining the prediction model further comprise: calculating predicted output values using the transformed input values.
  • 12. The medium of claim 11, wherein the score function is
  • 13. The medium of claim 12, wherein the method further comprises: collecting additional empirical output values and corresponding input values;calculating a new set of coefficients {right arrow over (P)}new; andusing the new set of coefficients as the optimal value of {right arrow over (P)}.
  • 14. The medium of claim 12, wherein the method further comprises: collecting additional empirical output values and corresponding input values;calculating a new set of coefficients as {right arrow over (P)}new≡{right arrow over (P)}previous+K({right arrow over (P)}optimum−{right arrow over (P)}previous),
  • 15. A system for controlling a manufacturing apparatus, comprising: a memory device storing an input that causes a change in at least two of a plurality of outputs, and empirical output values;means for calculating predicted output values based on the input; and means for minimizing effects of the at least two of the plurality of outputs that are interdependent from each other, wherein the means for minimizing effects comprises means for collecting historical information on the input parameter and the empirical output values, means for creating a score function based on the collected information and means for calculating a set of transform coefficients that minimize the score function to minimize the effects on the empirical output values and the predicted output values to obtain a set of desired output values to control the manufacturing apparatus.
  • 16. The system of claim 15, further comprising means for calculating an input value for one or more desired output values based on the calculated set of transform coefficients.
  • 17. The system of claim 15, further comprising means for identifying the input that causes the change in the at least two of the plurality of outputs.
  • 18. An apparatus, comprising: a storage device configured to store historical information including input parameter data and empirical output data;a corrector coupled to the storage device to receive the historical information from the storage device;an input transformer to receive the historical information and a set of coefficients {right arrow over (P)} from the collector, wherein the input transformer is configured to calculate transformed input parameters {right arrow over (X)}′i and to send the transformed input parameters {right arrow over (X)}′i to the corrector;an input-output dependency model to receive the transformed input parameters {right arrow over (X)}′i from the corrector, wherein the input-output dependency model is configured to calculate predicted output parameter values ypred;the corrector is configured to calculate a score equation and a new set of coefficients P to minimize the score equation; and the corrector is configured to obtain a set of input values for a set of desired output values.
  • 19. The apparatus of claim 18, wherein the corrector is configured to obtain the set of input values for the set of desired output values by obtaining a set of transformed input parameters {right arrow over (X)}′i by reversing the input-output dependency model and by obtaining the set of input values to produce the set of desired output values by reversing the transformed input parameters {right arrow over (X)}′i using the new set of coefficients {right arrow over (P)}.
RELATED APPLICATION

This application is a continuation of U.S. patent application Ser. No. 10/712,273, now U.S. Pat. No. 7,272,459, filed Nov. 14, 2003, which claims the benefit of U.S. Provisional Application No. 60/426,393, filed Nov. 15, 2002, which is incorporated herein by reference.

US Referenced Citations (357)
Number Name Date Kind
3205485 Noltingk Sep 1965 A
3229198 Libby Jan 1966 A
3767900 Chao et al. Oct 1973 A
3920965 Sohrwardy Nov 1975 A
4000458 Miller et al. Dec 1976 A
4207520 Flora et al. Jun 1980 A
4209744 Gerasimov et al. Jun 1980 A
4302721 Urbanek et al. Nov 1981 A
4368510 Anderson Jan 1983 A
4609870 Lale et al. Sep 1986 A
4616308 Morshedi et al. Oct 1986 A
4663703 Axelby et al. May 1987 A
4698766 Entwistle et al. Oct 1987 A
4750141 Judell et al. Jun 1988 A
4755753 Chern Jul 1988 A
4757259 Charpentier Jul 1988 A
4796194 Atherton Jan 1989 A
4901218 Cornwell Feb 1990 A
4938600 Into Jul 1990 A
4957605 Hurwitt et al. Sep 1990 A
4967381 Lane et al. Oct 1990 A
5089970 Lee et al. Feb 1992 A
5108570 Wang Apr 1992 A
5208765 Turnbull May 1993 A
5220517 Sierk et al. Jun 1993 A
5226118 Baker et al. Jul 1993 A
5231585 Kobayashi et al. Jul 1993 A
5236868 Nulman Aug 1993 A
5240552 Yu et al. Aug 1993 A
5260868 Gupta et al. Nov 1993 A
5270222 Moselhi Dec 1993 A
5283141 Yoon et al. Feb 1994 A
5295242 Mashruwala et al. Mar 1994 A
5309221 Fischer et al. May 1994 A
5329463 Sierk et al. Jul 1994 A
5338630 Yoon et al. Aug 1994 A
5347446 Lino et al. Sep 1994 A
5367624 Cooper Nov 1994 A
5369544 Mastrangelo Nov 1994 A
5375064 Bollinger Dec 1994 A
5398336 Tantry et al. Mar 1995 A
5402367 Sullivan et al. Mar 1995 A
5408405 Mozumder et al. Apr 1995 A
5410473 Kaneko et al. Apr 1995 A
5420796 Weling et al. May 1995 A
5427878 Corliss Jun 1995 A
5444837 Bomans et al. Aug 1995 A
5469361 Moyne Nov 1995 A
5485082 Wisspeintner et al. Jan 1996 A
5490097 Swenson et al. Feb 1996 A
5495417 Fuduka et al. Feb 1996 A
5497316 Sierk et al. Mar 1996 A
5497381 O'Donoghue et al. Mar 1996 A
5503707 Maung et al. Apr 1996 A
5508947 Sierk et al. Apr 1996 A
5511005 Abbe et al. Apr 1996 A
5519605 Cawlfield May 1996 A
5525808 Irie et al. Jun 1996 A
5526293 Mozumder et al. Jun 1996 A
5534289 Bilder et al. Jul 1996 A
5541510 Danielson Jul 1996 A
5546312 Mozumder et al. Aug 1996 A
5553195 Meijer Sep 1996 A
5586039 Hirsch et al. Dec 1996 A
5599423 Parker et al. Feb 1997 A
5602492 Cresswell et al. Feb 1997 A
5603707 Trombetta et al. Feb 1997 A
5617023 Skalski Apr 1997 A
5627083 Tounai May 1997 A
5629216 Wijaranakula et al. May 1997 A
5642296 Saxena Jun 1997 A
5646870 Krivokapic et al. Jul 1997 A
5649169 Berezin et al. Jul 1997 A
5654903 Reitman et al. Aug 1997 A
5655951 Meikle et al. Aug 1997 A
5657254 Sierk et al. Aug 1997 A
5661669 Mozumder et al. Aug 1997 A
5663797 Sandhu Sep 1997 A
5664987 Renteln Sep 1997 A
5665199 Sahota et al. Sep 1997 A
5665214 Iturralde Sep 1997 A
5666297 Britt et al. Sep 1997 A
5667424 Pan Sep 1997 A
5674787 Zhao et al. Oct 1997 A
5687077 Gough, Jr. Nov 1997 A
5694325 Fukuda et al. Dec 1997 A
5695810 Dubin et al. Dec 1997 A
5698989 Nulman Dec 1997 A
5719495 Moslehi Feb 1998 A
5719796 Chen Feb 1998 A
5735055 Hochbein et al. Apr 1998 A
5740429 Wang et al. Apr 1998 A
5751582 Saxena et al. May 1998 A
5754297 Nulman May 1998 A
5761064 La et al. Jun 1998 A
5761065 Kittler et al. Jun 1998 A
5764543 Kennedy Jun 1998 A
5777901 Berezin et al. Jul 1998 A
5781432 Keeler et al. Jul 1998 A
5787021 Samaha Jul 1998 A
5787269 Hyodo Jul 1998 A
5808303 Schlagheck et al. Sep 1998 A
5812407 Sato et al. Sep 1998 A
5823854 Chen Oct 1998 A
5824599 Schacham-Diamand et al. Oct 1998 A
5825356 Habib et al. Oct 1998 A
5825913 Rostami et al. Oct 1998 A
5828778 Hagi et al. Oct 1998 A
5831851 Eastburn et al. Nov 1998 A
5832224 Fehskens et al. Nov 1998 A
5838595 Sullivan et al. Nov 1998 A
5838951 Song Nov 1998 A
5844554 Geller et al. Dec 1998 A
5857258 Penzes et al. Jan 1999 A
5859777 Yokoyama et al. Jan 1999 A
5859964 Wang et al. Jan 1999 A
5859975 Brewer et al. Jan 1999 A
5862054 Li Jan 1999 A
5863807 Jang et al. Jan 1999 A
5867389 Hamada et al. Feb 1999 A
5870306 Harada Feb 1999 A
5871805 Lemelson Feb 1999 A
5883437 Maruyama et al. Mar 1999 A
5889991 Consolatti et al. Mar 1999 A
5901313 Wolfe et al. May 1999 A
5903455 Sharpe, Jr. et al. May 1999 A
5910011 Cruse Jun 1999 A
5910846 Sandhu Jun 1999 A
5912678 Saxena et al. Jun 1999 A
5916016 Bothra Jun 1999 A
5923553 Yi Jul 1999 A
5926690 Toprac et al. Jul 1999 A
5930138 Lin et al. Jul 1999 A
5940300 Ozaki Aug 1999 A
5943237 Van Boxem Aug 1999 A
5943550 Fulford, Jr. et al. Aug 1999 A
5960185 Nguyen Sep 1999 A
5960214 Sharpe, Jr. et al. Sep 1999 A
5961369 Bartels et al. Oct 1999 A
5963881 Kahn et al. Oct 1999 A
5975994 Sandhu et al. Nov 1999 A
5978751 Pence et al. Nov 1999 A
5982920 Tobin, Jr. et al. Nov 1999 A
6002989 Shiba et al. Dec 1999 A
6012048 Gustin et al. Jan 2000 A
6017771 Yang et al. Jan 2000 A
6036349 Gombar Mar 2000 A
6037664 Zhao et al. Mar 2000 A
6041263 Boston et al. Mar 2000 A
6041270 Steffan et al. Mar 2000 A
6054379 Yau et al. Apr 2000 A
6059636 Inaba et al. May 2000 A
6064759 Buckley et al. May 2000 A
6072313 Li et al. Jun 2000 A
6074443 Venkatesh et al. Jun 2000 A
6077412 Ting et al. Jun 2000 A
6078845 Friedman Jun 2000 A
6094688 Mellen-Garnett et al. Jul 2000 A
6096649 Jang Aug 2000 A
6097887 Hardikar et al. Aug 2000 A
6100195 Chan et al. Aug 2000 A
6108092 Sandhu Aug 2000 A
6111634 Pecen et al. Aug 2000 A
6112130 Fukuda et al. Aug 2000 A
6113462 Yang Sep 2000 A
6114238 Liao Sep 2000 A
6127263 Parikh Oct 2000 A
6128016 Coelho et al. Oct 2000 A
6136163 Cheung et al. Oct 2000 A
6141660 Bach et al. Oct 2000 A
6143646 Wetzel Nov 2000 A
6148099 Lee et al. Nov 2000 A
6148239 Funk et al. Nov 2000 A
6148246 Kawazome Nov 2000 A
6150270 Matsuda et al. Nov 2000 A
6157864 Schwenke et al. Dec 2000 A
6159075 Zhang Dec 2000 A
6159644 Satoh et al. Dec 2000 A
6161054 Rosenthal et al. Dec 2000 A
6169931 Runnels Jan 2001 B1
6172756 Chalmers et al. Jan 2001 B1
6173240 Sepulveda et al. Jan 2001 B1
6175777 Kim Jan 2001 B1
6178390 Jun Jan 2001 B1
6181013 Liu et al. Jan 2001 B1
6183345 Kamono et al. Feb 2001 B1
6185324 Ishihara et al. Feb 2001 B1
6191864 Sandhy Feb 2001 B1
6192291 Kwon Feb 2001 B1
6197604 Miller et al. Mar 2001 B1
6204165 Ghoshal Mar 2001 B1
6210983 Atchison et al. Apr 2001 B1
6211094 Jun et al. Apr 2001 B1
6212961 Dvir Apr 2001 B1
6214734 Bothra et al. Apr 2001 B1
6217412 Campbell et al. Apr 2001 B1
6219711 Chari Apr 2001 B1
6222936 Phan et al. Apr 2001 B1
6226563 Lim May 2001 B1
6226792 Goiffon et al. May 2001 B1
6228280 Li et al. May 2001 B1
6230069 Campbell et al. May 2001 B1
6236903 Kim et al. May 2001 B1
6237050 Kim et al. May 2001 B1
6240330 Kurtzberg et al. May 2001 B1
6240331 Yun May 2001 B1
6245581 Bonser et al. Jun 2001 B1
6246972 Klimasauskas Jun 2001 B1
6248602 Bode et al. Jun 2001 B1
6249712 Boiquaye Jun 2001 B1
6252412 Talbot et al. Jun 2001 B1
6253358 Takahashi Jun 2001 B1
6253366 Mutschler, III Jun 2001 B1
6259160 Lopatin et al. Jul 2001 B1
6263255 Tan et al. Jul 2001 B1
6268270 Scheid et al. Jul 2001 B1
6271670 Caffey Aug 2001 B1
6276989 Campbell et al. Aug 2001 B1
6277014 Chen et al. Aug 2001 B1
6278899 Piche et al. Aug 2001 B1
6280289 Wiswesser et al. Aug 2001 B1
6281127 Shue Aug 2001 B1
6284622 Campbell et al. Sep 2001 B1
6287879 Gonzales et al. Sep 2001 B1
6290572 Hofmann Sep 2001 B1
6291367 Kelkar Sep 2001 B1
6292708 Allen et al. Sep 2001 B1
6298274 Inoue Oct 2001 B1
6298470 Breiner et al. Oct 2001 B1
6303395 Nulman Oct 2001 B1
6304999 Toprac et al. Oct 2001 B1
6307628 Lu et al. Oct 2001 B1
6314379 Hu et al. Nov 2001 B1
6317643 Dmochowski Nov 2001 B1
6320655 Matsushita et al. Nov 2001 B1
6324481 Atchison et al. Nov 2001 B1
6334807 Lebel et al. Jan 2002 B1
6336841 Chang Jan 2002 B1
6339727 Ladd Jan 2002 B1
6340602 Johnson et al. Jan 2002 B1
6345288 Reed et al. Feb 2002 B1
6345315 Mishra Feb 2002 B1
6346426 Toprac et al. Feb 2002 B1
6355559 Havemann et al. Mar 2002 B1
6360133 Campbell et al. Mar 2002 B1
6360184 Jacquez Mar 2002 B1
6363294 Coronel et al. Mar 2002 B1
6366934 Cheng et al. Apr 2002 B1
6368879 Toprac Apr 2002 B1
6368883 Bode et al. Apr 2002 B1
6368884 Goodwin et al. Apr 2002 B1
6373033 de Waard et al. Apr 2002 B1
6379980 Toprac Apr 2002 B1
6381564 David et al. Apr 2002 B1
6388253 Su May 2002 B1
6389491 Jacobson et al. May 2002 B1
6391780 Shih et al. May 2002 B1
6395152 Wang May 2002 B1
6397114 Eryurek et al. May 2002 B1
6400162 Mallory et al. Jun 2002 B1
6405096 Toprac et al. Jun 2002 B1
6405144 Toprac et al. Jun 2002 B1
6417014 Lam et al. Jul 2002 B1
6427093 Toprac Jul 2002 B1
6432728 Tai et al. Aug 2002 B1
6435952 Boyd et al. Aug 2002 B1
6438438 Takagi et al. Aug 2002 B1
6440295 Wang Aug 2002 B1
6442496 Pasadyn et al. Aug 2002 B1
6449524 Miller et al. Sep 2002 B1
6455415 Lopatin et al. Sep 2002 B1
6455937 Cunningham Sep 2002 B1
6465263 Coss, Jr. et al. Oct 2002 B1
6470230 Toprac et al. Oct 2002 B1
6479902 Lopatin et al. Nov 2002 B1
6479990 Mednikov et al. Nov 2002 B2
6482660 Conchieri et al. Nov 2002 B2
6486492 Su Nov 2002 B1
6484064 Campbell Dec 2002 B1
6492281 Song et al. Dec 2002 B1
6495452 Shih Dec 2002 B1
6503839 Gonzales et al. Jan 2003 B2
6515368 Lopatin et al. Feb 2003 B1
6517413 Hu et al. Feb 2003 B1
6517414 Tobin et al. Feb 2003 B1
6528409 Lopatin et al. Mar 2003 B1
6529789 Campbell et al. Mar 2003 B1
6532555 Miller et al. Mar 2003 B1
6535783 Miller et al. Mar 2003 B1
6537912 Agarwal Mar 2003 B1
6540591 Pasadyn et al. Apr 2003 B1
6541401 Herner et al. Apr 2003 B1
6546508 Sonderman et al. Apr 2003 B1
6556881 Miller Apr 2003 B1
6560504 Goodwin et al. May 2003 B1
6563308 Nagano et al. May 2003 B2
6567717 Krivokapic et al. May 2003 B2
6580958 Takano Jun 2003 B1
6587744 Stoddard et al. Jul 2003 B1
6590179 Tanaka et al. Jul 2003 B2
6604012 Cho et al. Aug 2003 B1
6605549 Leu et al. Aug 2003 B2
6607976 Chen et al. Aug 2003 B2
6609946 Tran Aug 2003 B1
6616513 Osterheld Sep 2003 B1
6618692 Takahashi et al. Sep 2003 B2
6624075 Lopatin et al. Sep 2003 B1
6625497 Fairbairn et al. Sep 2003 B2
6630741 Lopatin et al. Oct 2003 B1
6640151 Somekh et al. Oct 2003 B1
6652355 Wiswesser et al. Nov 2003 B2
6660633 Lopatin et al. Dec 2003 B1
6678570 Pasadyn et al. Jan 2004 B1
6708074 Chi et al. Mar 2004 B1
6708075 Sonderman et al. Mar 2004 B2
6725402 Coss, Jr. et al. Apr 2004 B1
6728587 Goldman et al. Apr 2004 B2
6735492 Conrad et al. May 2004 B2
6748280 Zou et al. Jun 2004 B1
6751518 Sonderman et al. Jun 2004 B1
6754542 Tanaka Jun 2004 B1
6774998 Wright et al. Aug 2004 B1
7092863 Goldman et al. Aug 2006 B2
7272459 Kokotov et al. Sep 2007 B2
20010001755 Sandhu et al. May 2001 A1
20010003084 Finarov Jun 2001 A1
20010006873 Moore Jul 2001 A1
20010030366 Nakano et al. Oct 2001 A1
20010039462 Mendez et al. Nov 2001 A1
20010040997 Tsap et al. Nov 2001 A1
20010042690 Talieh Nov 2001 A1
20010044667 Nakano et al. Nov 2001 A1
20020032499 Wilson et al. Mar 2002 A1
20020058460 Lee et al. May 2002 A1
20020070126 Sato et al. Jun 2002 A1
20020077031 Johansson et al. Jun 2002 A1
20020081951 Boyd et al. Jun 2002 A1
20020089676 Pecen et al. Jul 2002 A1
20020102853 Li et al. Aug 2002 A1
20020107599 Patel et al. Aug 2002 A1
20020107604 Riley et al. Aug 2002 A1
20020113039 Mok et al. Aug 2002 A1
20020127950 Hirose et al. Sep 2002 A1
20020128805 Goldman et al. Sep 2002 A1
20020149359 Crouzen et al. Oct 2002 A1
20020165636 Hasan Nov 2002 A1
20020183986 Stewart et al. Dec 2002 A1
20020185658 Inoue et al. Dec 2002 A1
20020193899 Shanmugasundram et al. Dec 2002 A1
20020193902 Shanmugasundram et al. Dec 2002 A1
20020197745 Shanmugasundram et al. Dec 2002 A1
20020197934 Paik Dec 2002 A1
20020199082 Shanmugasundram et al. Dec 2002 A1
20030017256 Shimane Jan 2003 A1
20030020909 Adams et al. Jan 2003 A1
20030020928 Ritzdorf et al. Jan 2003 A1
20030154062 Daft et al. Aug 2003 A1
Foreign Referenced Citations (82)
Number Date Country
2050247 Aug 1991 CA
2165847 Aug 1991 CA
2194855 Aug 1991 CA
0 397 924 Nov 1990 EP
0 621 522 Oct 1994 EP
0 747 795 Dec 1996 EP
0 877 308 Jan 1998 EP
0 869 952 Oct 1998 EP
0 881 040 Dec 1998 EP
0 895 145 Feb 1999 EP
0 910 123 Apr 1999 EP
0 932 194 Jul 1999 EP
0 932 195 Jul 1999 EP
1 066 925 Jan 2001 EP
1 067 757 Jan 2001 EP
1 071 128 Jan 2001 EP
1 083 470 Mar 2001 EP
1 092 505 Apr 2001 EP
1 072 967 Nov 2001 EP
1 182 526 Feb 2002 EP
2 347 885 Sep 2000 GB
2 363 477 Dec 2001 GB
2 365 215 Feb 2002 GB
61-066104 Apr 1986 JP
61-171147 Aug 1986 JP
01-283934 Nov 1989 JP
03-202710 Sep 1991 JP
05-151231 Jun 1993 JP
05-216896 Aug 1993 JP
05-266029 Oct 1993 JP
06-110894 Apr 1994 JP
06-176994 Jun 1994 JP
06-184434 Jul 1994 JP
06-252236 Sep 1994 JP
06-260380 Sep 1994 JP
08-23166 Jan 1996 JP
08-50161 Feb 1996 JP
08-149583 Jun 1996 JP
08-304023 Nov 1996 JP
09-034535 Feb 1997 JP
09-246547 Sep 1997 JP
10-034522 Feb 1998 JP
10-173029 Jun 1998 JP
11-067853 Mar 1999 JP
11-126816 May 1999 JP
11-135601 May 1999 JP
2000-183001 Jun 2000 JP
2001-076982 Mar 2001 JP
2001-284299 Oct 2001 JP
2001-305108 Oct 2001 JP
2002-009030 Jan 2002 JP
2002-343754 Nov 2002 JP
434103 May 2001 TW
436383 May 2001 TW
455938 Sep 2001 TW
455976 Sep 2001 TW
WO 9534866 Dec 1995 WO
WO 9805066 Feb 1998 WO
WO 9845090 Oct 1998 WO
WO 9909371 Feb 1999 WO
WO 9925520 May 1999 WO
WO 9959200 Nov 1999 WO
WO 0000874 Jan 2000 WO
WO 0005759 Feb 2000 WO
WO 0035063 Jun 2000 WO
WO 0054325 Sep 2000 WO
WO 0079355 Dec 2000 WO
WO 0101205 Jan 2001 WO
WO 0111679 Feb 2001 WO
WO 0115865 Mar 2001 WO
WO 0118623 Mar 2001 WO
WO 0125865 Apr 2001 WO
WO 0133277 May 2001 WO
WO 0166501 May 2001 WO
WO 0152055 Jul 2001 WO
WO 0152319 Jul 2001 WO
WO 0157823 Aug 2001 WO
WO 0180306 Oct 2001 WO
WO 0217150 Feb 2002 WO
WO 0231613 Apr 2002 WO
WO 0233737 Apr 2002 WO
WO 02074491 Sep 2002 WO
Related Publications (1)
Number Date Country
20080021571 A1 Jan 2008 US
Provisional Applications (1)
Number Date Country
60426393 Nov 2002 US
Continuations (1)
Number Date Country
Parent 10712273 Nov 2003 US
Child 11888363 US