1. Field of the Invention
The present application generally relates to generating simulated-diffraction signals/signals for periodic gratings. More particularly, the present application relates to generating a library of simulated-diffraction signals indicative of electromagnetic signals diffracting from periodic gratings.
2. Description of the Related Art
In semiconductor manufacturing, periodic gratings are typically used for quality assurance. For example, one typical use of periodic gratings includes fabricating a periodic grating in proximity to the operating structure of a semiconductor chip. The periodic grating is then illuminated with an electromagnetic radiation. The electromagnetic radiation that deflects off of the periodic grating are collected as a diffraction signal. The diffraction signal is then analyzed to determine whether the periodic grating, and by extension whether the operating structure of the semiconductor chip, has been fabricated according to specifications.
In one conventional system, the diffraction signal collected from illuminating the periodic grating (the measured-diffraction signal) is compared to a library of simulated-diffraction signals. Each simulated-diffraction signal in the library is associated with a theoretical profile. When a match is made between the measured-diffraction signal and one of the simulated-diffraction signals in the library, the theoretical profile associated with the simulated-diffraction signal is presumed to represent the actual profile of the periodic grating.
The accuracy of this conventional system depends, in part, on the range and/or resolution of the library. More particularly, the range of the library relates to the range of different simulated-diffraction signals in the library. As such, if the collected-diffraction signal is outside of the range of the library, then a match cannot be made. The resolution of the library relates to the amount of variance between the different simulated-diffraction signals in the library. As such, a lower resolution produces a coarser match.
Therefore, the accuracy of this convention system can be increased by increasing the range and/or resolution of the library. However, increasing the range and/or the resolution of the library also increases the amount of computations required to generate the library. As such, it is desirable to determine an appropriate range and/or resolution for the library without unduly increasing the amount of computations required.
The present application relates to generating a library of simulated-diffraction signals (simulated signals) of a periodic grating. In one embodiment, a measured-diffraction signal of the periodic grating is obtained (measured signal). Hypothetical parameters are associated with a hypothetical profile. The hypothetical parameters are varied within a range to generate a set of hypothetical profiles. The range to vary the hypothetical parameters is adjusted based on the measured signal. A set of simulated signals is generated from the set of hypothetical profiles.
The present invention can be best understood by reference to the following description taken in conjunction with the accompanying drawing figures, in which like parts may be referred to by like numerals:
The following description sets forth numerous specific configurations, parameters, and the like. It should be recognized, however, that such description is not intended as a limitation on the scope of the present invention, but is instead provided to provide a better description of exemplary embodiments.
With reference to
As described earlier, periodic grating 145 call be formed proximate to or within an operating structure formed on wafer 140. For example, periodic grating 145 can be formed adjacent a transistor formed on wafer 140. Alternatively, periodic grating 145 can be formed in an area of the transistor that does not interfere with the operation of the transistor. As will be described in greater detail below, the profile of periodic grating 145 is obtained to determine whether periodic grating 145, and by extension the operating structure adjacent periodic grating 145, has been fabricated according to specifications.
More particularly, as depicted in
Diffraction signal 115 is received by detector 170 and analyzed by signal-processing system 190. When electromagnetic source 120 is an ellipsometer, the magnitude ψ and the phase Δ of diffraction signal 115 is received and detected. When electromagnetic source 120 is a reflectometer, the relative intensity of diffraction signal 115 is received and detected.
Signal-processing system 190 compares the diffraction signal received by detector 170 to simulated-diffraction signals stored in a library 185. Each simulated-diffraction signal in library 185 is associated With a theoretical profile. When a match is made between the diffraction signal received from detector 170 and one of the simulated-diffraction signals in library 185, the theoretical profile associated with the matching simulated-diffraction signal is presumed to represent the actual profile of periodic grating 145. The matching simulated-diffraction signal and/or theoretical profile can then be provided to assist in determining whether the periodic grating has been fabricated according to specifications.
As described above, library 185 includes simulated-diffraction signals that are associated with theoretical profiles of periodic grating 145. As depicted in
With reference to
Furthermore, it should be noted that the process outlined above for generating library 185 is meant to be exemplary and not exhaustive or exclusive. As such, the process for generating library 185 can include additional steps not set forth above. The process for generating library 185 can also include fewer steps than set forth above. Additionally, the process for generating library 185 can include the steps set forth above in a different order. With this in mind, the exemplary process outlined above is described in greater detail below:
1. Characterizing the Film Stack of the Periodic Grating
With continued reference to
These characteristics of periodic grating 145 can be obtained based on experience and familiarity with the process. For example, these characteristics can be obtained from a process engineer who is familiar with the process involved in fabricating wafer 140 and periodic grating 145. Alternatively, these characteristics can be obtained by examining sample periodic gratings 145 using Atomic Force Microscope (AFM), tilt-angle Scanning Electron Microscope (SEM), X-SEM, and the like.
2. Obtaining the Optical Properties of the Materials Used in Forming the Periodic Grating
In the present exemplary embodiment, the optical properties of the materials used in forming the periodic grating are obtained by measuring diffraction signals. With reference to
As depicted in
Alternative, as depicted in
With reference again to
When layers 204 through 210 include a metal layer, which is highly reflective, the incident signal 110 (
For non-metal layers, a variety of physical models can be used in conjunction with the SAC optimizer to extract the optical properties, including the thickness, of the films. For examples of suitable physical models, see G. E. Jellison, F. A. Modine, “Parameterization of the optical functions of amorphous materials in the interband region”, Applied Physics Letters, 15 vol. 69, no. 3, 371-373, July 1996, and A. R. Forouhi. I. Bloomer, “Optical Properties of crystalline semiconductors and dielectrics”, Physical Review B., vol. 38, no. 3, 1865-1874, July 1988, the entire content of which is incorporated herein by reference.
Additionally, when an ellipsometer is used to obtain the diffraction signals, the logarithm of the tan (ψ) signal and the cos (Δ) signal can be compared (as is described in “Novel DUV Photoresist Modeling by Optical Thin-Film Decompositions from Spectral Ellipsometry/Reflectometry Data,” SPIE LASE 1998, by Xinhui Niu, Nickhil Harshvardhan Jakatdar and Costas Spanos the entire content of which is incorporated herein by reference). Comparing the logarithm of tan (ψ) and cos (Δ) rather than simply tan (ψ) and cos (Δ) has the advantage of being less sensitive to noise.
3. Obtaining Measured-Diffraction Signals from the Periodic Grating
In the present exemplary embodiment, prior to generating library 185, a measured-diffraction signal is obtained from at least one sample periodic grating 145. However, multiple measured-diffraction signals are preferably obtained from multiple sites on wafer 140. Additionally, multiple measured-diffraction signals can be obtained from multiple sites on multiple wafers 140. As will be described below, these measured-diffraction signals can be used in generating library 185.
4. Determining the Number of Hypothetical Parameters to Use in Modeling the Profile of the Periodic Grating
In the present exemplary embodiment, a set of hypothetical parameters is used to model the profile of periodic grating 145 (
For example, with reference to
With reference now to
With reference now to
With reference not to
With reference now to
In this manner, any number of hypothetical parameters can be used to generate hypothetical profiles having various shapes and features, such as undercutting, footing, t-topping, rounding, concave sidewalls, convex sidewalls, and the like. It should be understood that any profile shape could be approximated using combinations of stacked trapezoids. It should also be noted that although the present discussion focuses on periodic gratings of ridges, the distinction between ridges and troughs is somewhat artificial, and that the present application may be applied to any periodic profile.
As will be described in greater detail below, in the present embodiment, a simulated-diffraction signal can be generated for a hypothetical profile. The stimulated-diffraction signal can then be compared with a measured-diffraction signal from periodic grating 145 (
The accuracy of this match depends, in part, on the selection of the appropriate number of parameters to account for the complexity of the actual profile of periodic grating 145 (
For example, assume that the actual profile of periodic grating 145 (
As such, in the present exemplary embodiment, the measured-diffraction signals that were obtained prior to generating library 185 (
Alternatively, in another configuration, the number of hypothetical parameters can be decreased until the simulated-diffraction signal generated from the hypothetical profile defined by the hypothetical parameters ceases to match the measured-diffraction signal within a desired tolerance. One advantage of decreasing rather than increasing the number of hypothetical parameters is that it can be more easily automated since the hypothetical profiles generated by lower numbers of hypothetical parameters are typically subsets of the hypothetical profiles generated by higher numbers of hypothetical parameters.
Additionally, in the present exemplary embodiment, a sensitivity analysis can be performed on the hypothetical parameters. By way of example, assume that a set of hypothetical parameters are used that include 3 width parameters (i.e., w1, w2, and w3). Assume that the second width, w2, is an insensitive width parameter. As such, when the second width, w2, is varied, the simulated-diffraction signals that are generated do not vary significantly. As such, using a set of hypothetical parameters with an insensitive parameter can result in a coarse or incorrect match between the hypothetical profile and the actual profile.
As such, in one configuration, after a match is determined between a simulated-diffraction signal and the measured-diffraction signal that was obtained prior to generating library 185 (
Alternatively, in another configuration, after a match is determined between a simulated-diffraction signal and the measured-diffraction signal obtained prior to generating library 185 (
Assume now that the number of hypothetical parameters was being decreased to determine the appropriate number of parameters to use in modeling periodic grating 145 (
Once the parameterization is completed, the critical dimension (CD) can then be defined based on any portion of the profile. Following are two examples of CD definitions based on the profile of
Definition 1: CD=w1
Definition 2: CD=w1/2+(4 w2+w3)/10
CD definitions can be user specific, and the above are typical examples that can be easily modified to suit different needs. Thus, it should be understood that there are a wide variety of CD definitions that will prove useful in various circumstances.
5. Adjusting the Range to Vary the Hypothetical Parameters in Generating a Set of Hypothetical Profiles
As described above, a set of hypothetical profiles can be generated by varying the hypothetical parameters. As will be described in greater detail below, a simulated-diffraction signal can be generated for each of the hypothetical profile in this set. Thus, the range of simulated-diffraction signals available in library 185 (
As also describe above, an initial range over which the hypothetical parameters are to be varied can be obtained from users/customers. In some cases, however, this initial range is based on mere conjecture. Even when this initial range is based on empirical measurements, such as measurements of samples using AFM, X-SEM, and the like, inaccuracy in the measurement can produce poor results.
As such, in the present exemplary embodiment, the range over which the hypothetical parameters are to be varied is adjusted based on the measured-diffraction signal obtained prior to generating library 185 (
In the present exemplary embodiment, the range over which the hypothetical parameters are to be varied is adjusted before generating library 185 (
Additionally, in the present exemplary embodiment, an optimization routine is used to generate matching simulated-diffraction signals. More particularly, a range of hypothetical parameters to be used in the optimization process is selected. Again, if the profile shape is known in advance, due to AFM or X-SEM measurements, a tighter range can be used. However, when the profile shape is not known in advance, a broader range can be used, which can increase the optimization time.
An error metric is selected to guide the optimization routine. In the present exemplary embodiment, the selected error metric is the sum-squared-error between the measured and simulated diffraction signals. While this metric can work well for applications where the error is identically and independently normally distributed (iind) and differences are relevant, it may not be a good metric for cases where the error is a function of the output value (and is hence not iind) and ratios are relevant. A sum-squared-difference-log-error can be a more appropriate error metric when the error is an exponential function of the output. Therefore, in the present embodiment, the sum-squared-error is used in comparisons of cos(Δ), and the sum-squared-difference-log-error is used in comparisons of tan(ψ) where the ratio of the 0th order TM reflectance to the zeroth order TE reflectance is given by tan(ψ)eiΔ.
After selecting an error metric, the optimization routine is run to find the values of the hypothetical parameters that produce a simulated-diffraction signal that minimizes the error metric between itself and the measured-diffraction signal. More particularly, in the present exemplary embodiment, a simulated annealing optimization procedure is used (see “Numerical Recipes,” section 10.9, Press, Flannery, Teukolsky & Vetterling, Cambridge University Press, 1986, the entire content of which is incorporated herein by reference). Additionally, in the present exemplary embodiment, simulated-diffraction signals are produced by rigorous models (sec University of California at Berkeley Doctoral Thesis of Xinhui Niu, “An Integrated System of Optical Metrology for Deep Sub-Micron Lithography,” Apr. 20, 1999, the entire content of which is incorporated herein by reference).
In the present exemplary embodiment, if the simulated-diffraction signal matches the measured-diffraction signal to within a standard chi-squared goodness-of-fit definition (see Applied Statistics by J. Neter, W. Wasserman, G, Whitmore, Publishers: Allyn and Bacon, 2nd Ed. 1982, the entire content of which is incorporated herein by reference), then the optimization is considered successful. The values of all of the hypothetical parameters are then examined and the CD is calculated.
This process is repeated to find matching simulated-diffraction signals for all of the measured-diffraction signals. The appropriateness of the range of the hypothetical parameters can then be determined by examining where the values of the hypothetical parameters of the matching simulated-diffraction signals lie in the range. For example, if they group near one end of the range, then the range can be shifted and re-centered. If they lie at the limits of the range, then the range can be broadened.
If the optimization process is unable to find a matching simulated-diffraction signal for a measured-diffraction signal, then either the range or the number of hypothetical parameters need to be altered. More particularly, the values of the hypothetical parameters are examined, and if they lie close to the limit of a range, then this is an indication that that range should be altered. For example, the range can be doubled or altered by any desirable or appropriate amount. If the values of the hypothetical parameters do not lie close to the limits of a range, then this typically is an indication that the number and/or type of hypothetical parameters being used to characterize the profile shape needs to be altered. In either case, after the range of the number of hypothetical parameters is altered, the optimization process is carried out again.
6. Determining the Number of Layers to Use in Dividing Up a Hypothetical Profile to Generate a Simulated-Diffraction Signal for the Hypothetical Profile
As described above, a set of hypothetical parameters defines a hypothetical profile. A simulated-diffraction signal is then generated for each hypothetical profile. More particularly, in the present exemplary embodiment, the process of generating simulated-diffraction signals for a hypothetical profile includes partitioning the hypothetical profile into a set of stacked rectangles that closely approximates the shape of the hypothetical profile. From the set of stacked rectangles for a given hypothetical profile, the corresponding simulated-diffraction signals are generated (see University of California at Berkeley Doctoral Thesis of Xinhui Niu, “An Integrated System of Optical Metrology for Deep Sub-Micron Lithography,” Apr. 20, 1999, the entire content of which is incorporated herein by reference; and U.S. patent application Ser. No. 09/764,780, entitled CACHING OF INTRA-LAYER CALCULATIONS FOR RAPID RIGOROUS COUPLED-WAVE ANALYSIS, filed on Jan. 17, 2001, the entire content of which is incorporated herein by reference).
Therefore, the quality of the library depends, in part, on how well the selected sets of stacked rectangles approximate the hypothetical profiles. Furthermore, since a typical library 185 (
It should be noted that deciding on a fixed number of rectangles for a profile without consideration of the profile shape, and then representing the profile using the fixed number of rectangles of equal height, is not a rapid or efficient method. This is because the optimal number of rectangles that approximates one profile call be different from the optimal number of rectangles that approximate another profile. Also, the heights of the stacked rectangles that approximate a given profile need not be the same. Thus, in order to provide a good approximation, the number of rectangles, k, and the height of the rectangles are preferably determined for each profile.
However, the library generation time is a linear function of the number of rectangles, k. Consequently, increasing k in order to improve the library quality results in an increase in the amount of time required to generate a library 185 (
Thus, in one exemplary embodiment, a process is provided to determine the number k of rectangles of varying heights that better approximate the shape of a profile. More particularly, this problem is transformed into a combinatorial optimization problem called a “set-cover” problem. Heuristics can then be used to solve the “set-cover” problem.
In brief, a set-cover problem involves a base set B of elements, and a collection C of sets C1, C2, . . . , Cn, where each Ci is a proper subset of B, and the sets C1, C2, . . . , Cn may share elements. Additionally, each set Ci has weight Wi associated with it. The task of a set-cover problem is to cover all the elements in B with sets Ci such that their total cost, ΣiWi, is minimized.
Returning to the present application of transforming the problem of rectangularization into a “set-cover” problem, let P denote a given profile. For ease of presentation, the profile P will be considered to be symmetric along the y-axis, so it is possible to consider only one side of the profile P. In the following description, the left half of the profile P is considered. Points on the profile are selected at regular intervals Δy along y-axis, where Δy is much smaller than the height of the profile. This selection allows the continuous curve to be approximated with discrete points denoted by p1, p2, . . . , pn. In other words, the points p1, p2, . . . , pn correspond to the coordinates (x1, 0), (x2, Δy), . . . , (xn, (n−1) Δy), respectively. These points p1, p2, . . . , pn from the base set B and the sets in C correspond to the rectangles that can be generated by these points.
As shown in the exemplary rectangularization of
Thus, a set system C that has its sets C1, C2 , . . . , Cm is established. Weights are then assigned to the sets Ci. Since the objective of a set-cover problem is to minimize the total cost of the cover, the weights Wi are assigned to reflect that goal, i.e., to approximate the profile shape by quantifying the quality of approximation. Therefore, as shown in
Thus far the mapping between a set-cover problem and the rectangularization of the profile has been presented. The next step is to solve the set-cover problem. It has been shown that solving a set-cover problem is computationally difficult since the running time of the best known exact-solution algorithm is an exponential function of the input size. However, there are a number of efficient heuristics that can generate near-optimal solutions.
For example, a heuristic called a “greedy” heuristic can be used. At every step, this heuristic selects the set Ci whose value of Wi/|Ci| is the least. It then adds Ci to the solution set Z and deletes all the elements in Ci for the base set B, and deletes any other sets Cj that share any elements with Ci. Additionally, any empty set in C is removed from it. Thus, at every step, the number of elements in the base set B decreases. This process is repeated until the base set B is empty. At this point, the solution set Z consists of sets that cover all the profile points pi. The sets in the solution Z can be transformed back into the rectangles which approximate the profile P. It should be noted that the value of |Ci| at a given stage is the number of elements that it contains in that stage—not the number of elements that it originally started with. Since the selection of sets Ci depends on the value Wi/|Ci|, the rectangles that are obtain can have different sizes. A detailed description on the basic algorithm of this heuristic can be found in an article entitled “Approximation algorithms for clustering to minimize the sum of diameters.” by Srinivas Doddi, Madhav Marathe, S. S. Ravi, David Taylor, and Peter Widmayer, Scandinavian workshop on algorithm theory (SWAT) 2000, Norway, the entire content of which is incorporated herein by reference.
Although the above method returns a set of rectangles that approximate a given profile, the number of rectangles might be very large. In the above mentioned article, Doddi, et. al found that by uniformly increasing the weights of each set by Δw and remaining the above method, the number of rectangles will be reduced. By repeating this process for increasing values of Δw, it is possible to achieve a target number of rectangles.
Although rectangles have been described as being used to represent profile shapes, it should be noted that any other geometric shape, including trapezoids, can be used. A process for automatically approximating a profile with trapezoids may, for instance, be applied to the step of adjusting the range to vary the parameters in generating a set of simulated-diffraction signals.
7. Determining the Number of Harmonic Orders to Use in Generating the Set of Simulated-Diffraction Signals
As described above, in the present exemplary embodiment, simulated-diffraction signals can be generated using a rigorous coupled wave analysis (RCWA). For a more detailed description of RCWA, see T. K. Gaylord, M. G. Moharam, “Analysis and Applications of Optical Diffraction by Gratings”, Proceedings of the IEEE, vol. 73, no. 5, May 1985, the entire content of which is incorporated herein by reference.
Prior to performing an RCWA calculation, the number of harmonic orders to use is selected. In the present exemplary embodiment, an Order Convergence Test is performed to determine the number of harmonic orders to use in the RCWA calculation. More particularly, simulated-diffraction signals are generated using RCWA calculations with the number of harmonic orders incremented from 1 to 40 (or higher if desired). When the change in the simulated-diffraction signal for a pair of consecutive order values is less at every wavelength than the minimum absolute change in the signal that can be detected by the optical instrumentation detector (e.g., detector 170 in
When multiple profile shapes are determined in characterizing periodic grating 145 (
8. Determining a Resolution to Use in Generating the Set of Simulated-Diffraction Signals
As described earlier, the value of hypothetical parameters are varied within a range to generate a set of hypothetical profiles. Simulated-diffraction signals are then generated for the set of hypothetical profiles. Each simulated-diffraction signal is paired with a hypothetical profile, then the pairings are stored in library 185 (
Thus, the resolution of hypothetical parameters used in generating library 185 (
By way of example, assume that three hypothetical parameters (top CD, middle CD, and bottom CD) are used to characterize a profile. Assume that the range for the top CD, middle CD, and bottom CD are 60 to 65 nanometers, 200 to 210 nanometers, and 120 to 130 nanometers, respectively. Also assume that the critical parameter is the bottom CD and the specified resolution for the bottom CD is 0.1 nanometer, and no particular resolution is specified for the top) and middle CDs.
In the present exemplary embodiment, an abbreviated library is generated using a portion of the range specified for the hypothetical parameters. In this example, an abbreviated library of simulated-diffraction signals is generating for top CD between 60 and 61, middle CD between 200 and 201, and bottom CD between 120 and 121.
Initially, the abbreviated library is generated at the highest specified resolution. In this example, simulated-diffraction signals are generated for the top CD, middle CD, and bottom CD as they are incremented by 0.1 nanometers between their respective ranges. For example, simulated-diffraction signals are generated for a top CD of 60, 60.1, 60.2, . . . , 60.9, and 61. Simulated diffraction signals are generated for middle CD of 200, 200.1, 200.2, . . . , 200.9, and 201. Simulated-diffraction signals are generated for bottom CD of 120, 120.1, 120.2, . . . , 120.9, and 121.
The resolution of the non-critical parameters is then incrementally reduced in the abbreviated library until an attempted match for the critical parameter fails. In this example, the simulated-diffraction signal corresponding to the set of hypothetical parameters with top CD of 60.1, middle CD of 200, and bottom CD of 120 is removed from the abbreviated library. An attempt is then made to match the removed simulated-diffraction signal with remaining simulated-diffraction signals in the abbreviated library. If a match is made with a simulated-diffraction signal having the same critical parameter as the removed simulated-diffraction signal (i.e., a bottom CD of 120), then the resolution for the top CD can be further reduced. In this manner, each of the non-critical parameters are tested to determine the minimum resolution that can be used. This study is performed for all the non-critical parameters simultaneously in order to take into account the parameter interaction effects.
In the following description, a more thorough description is provided of a process for determining the resolution Δpi of hypothetical parameters pi used in generating library 185 (
The parameters pi which are used to characterize various profiles P were described in detail above. In the following description, the general case of m parameters p1, p2, . . . ,pm will be presented, and the special case of m=2 will be depicted in
Typically, the particular resolution of interest in semiconductor fabrication, i.e., the target resolution R, is the resolution of the critical dimension. In general, the resolution of the critical dimension is some function of the resolution Δpi of multiple parameters pi. {In the two-dimensional case, the resolution of the critical dimension happens to be the resolution Δp1 of the first parameter p1=w1. But to make the two-dimensional discussion correspond to the general case, the critical dimension will be assumed to be a function of the resolution Δpi of multiple parameters pi.}
Typically only a single target resolution R is considered. However, in the present embodiment, multiple target resolutions Ri can be considered, and the accuracy of the mappings between profiles and signals allows the resolution Δpi of multiple profile shape parameters pi to be determined.
A grating of a particular profile P produces a complex-valued diffraction signal S(P, λ), which is plotted as a function of wavelength λ. The magnitude of the signal S(P, λ) is the intensity, and the phase of the signal S(P, λ) is equal to the tangent of the ratio of two, perpendicular planar polarizations of the electric field vector. A diffraction signal may, of course, be digitized, and the sequence of digital values may be formed into a vector, albeit a vector having a large number of entries if the signal is to be accurately represented. Therefore, each signal S(P, λ) corresponds to a point in a high-dimensional signal space, and points in the high-dimensional space which are near each other correspond to diffraction signals which are similar. For ease of depiction in the present discussion, in
In the present embodiment, the determination of the library resolutions Δpi of the parameters pi begins by choosing a nominal profile p(n) and generating its corresponding signal S(P(n)). Then a set of profiles P near the nominal profile P(n) is generated. This may be done by choosing a regularly-spaced array of points in the profile space around the nominal n, an irregularly-spaced array of points in the profile space around the nominal n, or a random scattering of points in the profile space around the nominal n. For ease of discussion and depiction, a regularly-spaced array of points around the nominal n will be considered {and depicted in FIG. 9}, so parameter increment values δpi are chosen for each parameter pi. Therefore, profiles located at
n+Σiaiδpi,
and the corresponding diffraction signals
S(n+Σiaiδpi)
are generated, where a 1 takes integer values ( . . . , −2, −1, 0, 1, 2, 3, . . . ) and the sum runs from i=1 to i=m, and n is the vector corresponding to the nominal profile p(n). {Therefore, as shown in
n+a1δp1+a2δp2,
and the corresponding diffraction signals,
S(n+a 1δp1+a 2δp2),
are generated, where a 1 and a 2 take integer values ( . . . , −2, −1, 0, 1, 2, 3, . . . ).} (For ease of presentation, a profile p and its corresponding vector in the profile space will be used synonymously.) The parameter increment values δpi are chosen to be small relative to the expected values of the library resolutions Δpi, i.e.,
δpi>>Δpi.
{In the example shown in
The next step in determining the resolutions Δpi of the parameters pi, is to order the signals S(n+a1δp1+a2δp2) by increasing distance from the signal S(n) of the nominal profile P(n), which will hereafter be referred to as the nominal signal S(n) or S(n). In the present embodiment, the distance between a first signal S(1) and a second signal S(2) is measured using a sum-squared-difference-log error measure φ, i.e.,
φ(S(1), S(2))=Σλ[log S(1)(λ)−log S(2)(λ)]2,
where the sum is taken over uniformly-spaced wavelengths λ. As shown in
S(n)(λ)−S(λ)≦ε,
at all wavelengths λ. In the exemplary case of
According to the next step of the present invention, the signals S(n+Σiaiδpi) {S(n+a1δp1+a2δp2)} are tested in order of increasing distance Φ from the nominal signal S(n) to determine which is the signal S(n+Σiaiδpi) {S(n+a1δp1+a2δp2)} closest to the nominal signal S(n) which has a profile (n+Σiaiδpi) {n+a1δp1+a2δp2} which differs from the nominal profile P(n) by the target resolution R. In the case of multiple target resolutions R, the signals S(n+Σiaiδpi) {S(n+a1δp1+a2δp2)} are tested in order of increasing distance Φ from the nominal signal S(n) to determine which is the signal S(n+Σiaiδpi) {S(n+a1δp1+a2δp2)} closest to the nominal signal S(n) which has a profile (n+Σiaiδpi) {n+a1δp1+a2δp2} which differs from the nominal profile P(n) by one of the target resolutions Ri. That particular signal is termed the border signal S(B), and the smallest hypersphere 1002, 1004, 1006, and 1008 which encloses the border signal S(B) is termed the border hypersphere B. For those signals S which fall outside the border hypersphere B, the corresponding profiles P are discarded from consideration in the process of determining the library resolutions Δpi.
Then, for each signal S which lies within the border hypersphere B, a displacement vector V for its relation to the nominal profile vector n is determined. In particular, the displacement vector V between a profile P(a) described by the vector (p1a, p2a, . . . , pma) and the nominal vector n=(p1n, p2n, . . . , pmn) is given by
V=(p1a−p1n−p2a−p2n, . . . , pma−pmn),
{or in the two-dimensional case depicted in FIG. 9,
V=(p1a−p1n, p2a−p2n).
The exemplary displacement vector V shown in
V′=(±|p1a−p1n|,±|p2a−p2n|, . . . ,±|pma−p2n|),
{or in the two-dimensional case depicted in FIG. 9,
V′=(±|p1a−p1n|,±|p2a−p2n|), }
i.e., the set of equivalent displacement vectors V′, which includes the original displacement vector V, defines the 2m {four} corners of an m-dimensional hyperrectangle {a two-dimensional rectangle 920 depicted in FIG. 9}.
Then, for each signal S(V) which lies within the border hypersphere B, it is determined whether all the equivalent displacement vectors V′ correspond to signals S(V′) which also lie within the hypersphere B. If one or more signals S(V′) do not lie within the hypersphere B, the profiles corresponding to the entire set of the equivalent displacement vectors V′ are discarded from consideration in the process of determining the library resolutions Δpi. In other words, what remains under consideration in determining the library resolutions Δpi are those m-dimensional hyperrectangles {two-dimensional rectangles} in profile space for which all the corresponding signals S lie inside the border hypersphere B. It is these m-dimensional hyperrectangles {two-dimensional rectangles} which are under consideration as the library resolutions Δpi.
For each of the m-dimensional hyperrectangles {two-dimensional rectangles} in profile space for which all the corresponding signals S lie inside the border hypersphere B, the number N of m-dimensional hyperrectangles {two-dimensional rectangles} required to fill the profile space is simulated. For a p1*×p2*× . . . ×pm* hyperrectangle, the count number N is the number of such p1*×p2*× . . . ×pm* hyperrectangles which fit into a hyperrectangular space defined by the bounds pi(min)<pi<pi(max). The count number N is given by
N=max[p1(max)−p1(min)/p1*, (p2(max)−p2(min)/p2*, . . .],
where the square brackets in the above equation indicate that each fractional value within is rounded up to the nearest integer. {For instance, for the 2δp1×4δp2 rectangle 620 defined by the equivalent vectors V′ shown in
Finally, the resolutions Δpi which are used for the library are equal to the dimensions of the m-dimensional hyperrectangular defined by the set of equivalent vectors V′, which (i) has the smallest count N, and for which (ii) all the corresponding signals S(V′) lie inside the border hypersphere B.
9. Generating the Set of Simulated-Diffraction Signals Based on the Adjusted Range, Parameterization, and/or Resolution
In the present exemplary embodiment, library 185 (
10. Comparing a Set of Measured-Diffraction Signals with the Simulated-Diffraction Signals in the Library
In the present exemplary embodiment, after generating library 185 (
Although exemplary embodiments have been described, various modifications can be made without departing from the spirit and/or scope of the present invention. Therefore, the present invention should not be construed as being limited to the specific forms shown in the drawings and described above.
This application is a continuation of U.S. application Ser. No. 09/907,488, filed Jul. 16, 2001 now U.S. Pat. No. 6,943,900, entitled “Generation of a Library of Periodic Grating Diffraction Signals, the entire content of which is incorporated herein by reference, which claims the benefit of earlier filed U.S. Provisional Application Ser. No. 60/233,017, entitled GENERATION OF A LIBRARY OF PERIODIC GRATING DIFFRACTION SPECTRA, filed on Sep. 15, 2000, the entire content of which is incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
5599594 | Pauley | Feb 1997 | A |
5963329 | Conrad et al. | Oct 1999 | A |
6049762 | Ganz et al. | Apr 2000 | A |
6091486 | Kirk | Jul 2000 | A |
6657736 | Finarov et al. | Dec 2003 | B1 |
6943900 | Niu et al. | Sep 2005 | B2 |
Number | Date | Country |
---|---|---|
196 36612 | Mar 1998 | DE |
WO-0223231 | Mar 2002 | WO |
Number | Date | Country | |
---|---|---|---|
20050256687 A1 | Nov 2005 | US |
Number | Date | Country | |
---|---|---|---|
60233017 | Sep 2000 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 09907488 | Jul 2001 | US |
Child | 11189161 | US |