Time-domain computation of scattering spectra for use in spectroscopic metrology

Information

  • Patent Grant
  • 7480047
  • Patent Number
    7,480,047
  • Date Filed
    Wednesday, December 28, 2005
    18 years ago
  • Date Issued
    Tuesday, January 20, 2009
    15 years ago
Abstract
In an embodiment, a method of time-domain simulation for simulating scattering spectra is described. The method may provide for computing spatial derivatives including computing spectral derivatives in some portion of the domain and finite difference derivatives in some other portion of the domain; forming an equation for non-reflecting boundary conditions; and computing a time-stepping scheme using a high-order unconditionally stable computation method.
Description
BACKGROUND

The subject matter described herein generally relates to a system and method for time-domain simulation. More specifically, an embodiment relates to time-domain computation of scattering spectra (e.g., electromagnetic (EM) spectra) for use in spectroscopic metrology.


Time-domain simulation has been used to compute scattering properties. Typically, a scattering geometry is given from which transmission and reflection coefficients are computed, as well as their associated phases.


Typical optical systems have a finite spatial width for the apertures used to produce the light incident on the scatterer, and define the range of collection angles. In order to accurately model the scattering process, it may be necessary to model the finite spread of incident angles.


The problem has traditionally been solved in the time-domain by performing the scattering computation for a fixed set of angles that samples the finite angular spread of the aperture. The reflection and transmission spectra are then computed as a weighted average of the spectra of the spectra obtained at each incident angle. Unfortunately, the computational load grows linearly with the number of angle samples used. Hence, for high accuracy work, e.g., required in scatterometry, 3 to 9 incident angles may be used, resulting in a factor of 3 to 9 increase in the computational time.


SUMMARY

Embodiments of the present invention provide systems and methods for efficiently truncating the computational domain using a non-reflecting boundary condition for dispersive materials. In a time-domain computation using transient wave excitation, the transmission and reflection coefficients for a range of wavelengths may be obtainable with one scattering simulation or “run.” A broadband pulse may be composed of a combination of plane-waves spanning the frequencies of interest, all traveling in the same direction. The simulation may be run from the time the broadband pulse is incident on the scatterer until the outgoing waves have diminished to a desired threshold level. The outgoing waveforms in the directions of interest may be Fourier transformed and the ratio of intensities between the incident and outgoing waveforms for each of the Fourier components may result in estimates of the transmission and reflection coefficients.


In an embodiment, a linear combination of plane waves for the incident pulse may be utilized to simulate a finite aperture for the incident beam in a single time-domain solution. Further, the present invention may use a “stitched” domain technique where the derivative in one part of the domain is computed using finite differences and spectral method in the other. In the transition region, the derivative may be a linear combination of the two techniques. Such an embodiment may use a high-order unconditionally stable time-stepping method which is both stable and accurate for large time-steps.


In one embodiment, a scattering spectrum (e.g., EM scattering spectrum) may be obtained for a finite width aperture in one time-domain simulation. An incident pulse may be synthesized that has a desired range of wavelengths as well as a desired range of angles. The scattering spectrum may be calculated using a single time-domain scattering calculation. This may have the same computational cost as a scattering calculation for a single incident angle. Accordingly, as many sample angles as practical may be included in the computation.


Since the light coming through the aperture may be spatially incoherent, a Monte Carlo-like technique may be used, where each of the components corresponding to different sample angles has a different, randomly generated phase φj The incident pulse is given by:










j







ω
i





A
ij



exp


(




(




k


ij

·

x



-


ω
i


t

+

φ
j


)


)







where







k


ij




=





k
i




cos


j



x
^


+




k
i




sin


j




y
^

.







The transmission and reflection spectra may be calculated in the standard fashion along the direction of interest. The averaging that results may correspond to an averaging over a random variable φ, resulting in a spatially incoherent averaging.


The relatively long integration time of the physical detector, as well as the corresponding computation, may result in the accurate approximation of the temporally incoherent source.


With the use of the “random phase” incident pulse, a single time-domain scattering computation may be needed, which results in significantly faster run times for calculations involving finite width apertures.


Additional advantages, objects and features of embodiments of the invention are set forth in part in the detailed description which follows. It is to be understood that both the foregoing general description and the following detailed description are merely exemplary of embodiments of the invention, and are intended to provide an overview or framework for understanding the nature and character of embodiments of the invention.





BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings are included to provide further understanding of embodiments of the invention, illustrate various embodiments of the invention, and together with the description serve to explain the principles and operation of the invention. In the figures, the left-most digit(s) of a reference number identifies the figure in which the reference number first appears. The use of the same reference numbers in different figures indicates similar or identical items.



FIG. 1 is a schematic view of an embodiment of a representative spectroscopic scatterometer system.



FIG. 2 is a flow diagram of a time step method in accordance with an embodiment of the present invention.



FIGS. 3-5 are flow diagrams of various embodiments of the present invention.





DETAILED DESCRIPTION

In the following description, numerous specific details are set forth in order to provide a thorough understanding of embodiments of the present invention. Embodiments of the present invention may be practiced without some or all of these specific details. In other instances, well known process operations have not been described in detail in order not to unnecessarily obscure the present invention. Also, reference in the specification to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment may be included in at least an implementation. The appearances of the phrase “in one embodiment” in various places in the specification may or may not be all referring to the same embodiment.



FIG. 1 is a schematic view of a representative spectroscopic scatterometer system, according to an embodiment. As shown in FIG. 1, a semiconductor wafer may comprise a silicon substrate 102a, a film 102b on the substrate and a diffracting structure 102c such as a photoresist pattern on the film, where the film is at least partially light-transmissive and has a certain film thickness and refractive index (n and k, the real and imaginary components of the index).


Before the diffracting structure 102c is measured, an XYZ stage 104 is used for moving the wafer in the horizontal XY directions in order to first measure the film thickness and refractive index of the underlying structure underneath the photoresist pattern 102c.


For the purpose of measuring the film thickness and refractive index of the underlying structure (102b and 102a), a broadband radiation source such as white light source 106 supplies light through a fiber optic cable 108 which randomizes the polarization and creates a uniform light source for illuminating the wafer. Upon emerging from fiber 108, the radiation passes through an optical illuminator that may include a slit aperture and a focus lens (not shown). The slit aperture causes the emerging light beam to image a small area of layer 102b. The light emerging from illuminator 110 is polarized by a polarizer 112 to produce a polarized sampling beam 114 illuminating the layer 102b.


The radiation originating from sampling beam 114 that is reflected by layer 102b, passed through an analyzer 116 and to a spectrometer 118 to detect different spectral components of the reflected radiation. In the spectroscopic ellipsometry (SE) mode of system 100 for measuring film thickness and refractive index, either the polarizer 112 or the analyzer 114 is rotated (to cause relative rotational motion between the polarizer and the analyzer) when spectrometer 118 is detecting the reflected light at a plurality of wavelengths, such as those in the spectrum of the radiation source 106, where the rotation is controlled by computer 120 in a manner known to those skilled in the art. The reflected intensities at different wavelengths detected is supplied to computer 120 which computes the film thickness and n and k values of the refractive index of layer 102b.


The use of SE in metrology of small structures and/or patterns has gained wide acceptance. The determination of the structure is achieved by starting with a model of the underlying structure, computing the scattered spectrum, comparing the computed spectrum with the obtained measured spectrum and then adjusting the model. This process is repeated until convergence.


In order to maximize the benefit to production lines, the determination of the model should happen as quickly as possible. The result should also be as reliable as possible, meaning that if the same structure is measured multiple times—the models produced should be as similar as possible.


The SE hardware uses a broad-band light source, thus, the collected spectrum may contain a large number of wavelengths, typically on the order of 1000. To increase the reliability of determining the model as many of these wavelengths as possible need to be used. The limiting factor is computational cost of the modeled spectrum. Currently in metrology applications, a frequency domain computational approach may be used—which means that the computational cost scales linearly with the number of wavelengths used. Given fixed computing budgets this leads to use of a small number of wavelengths.


In an embodiment, the present invention provides a technique to compute the scattering spectrum for all the wavelengths as the simulation of a single scattering event. Thus, the computational cost does not grow appreciably as the number of wavelengths used increases.


As shown in FIG. 2, to apply embodiments of the present invention to metrology, the method includes truncating the computational domain in a dispersive media and using a single scattering calculation to model the scattering of light (e.g., EM scattering) produced by an aperture of finite width. A further improvement is accomplished by computing spatial derivatives (202) by computing spectral derivatives in some portion of the domain and finite-difference in others, forming non-reflecting equations for boundary conditions (204) and computing high-order unconditionally stable time-stepping schemes with dispersive materials (206).


Total Field/Scattered Field Framework


In one embodiment of the present invention, a spatial derivative domain technique is used where the derivative in one portion of the domain is computed using a spectral method and a finite differences method is used in another portion of the domain. In the transition region, the derivative may be a linear combination of these two techniques.


As shown in FIG. 3, the stage 202 includes computing the three derivative types as follows. Let the domain be defined by (1):

N≦i≦N

For K<N, define the total field domain by (2):

N≦i≦K

and the scattered field domain by (3):

K<i≦N.


Thus, using the following notation (4):

H(xi,tj)=Hij and E(xi,tj)=Eij,

the update equations to first order in both time and space are given by (5):







E
i

j
+
1


=


E
i
j

+



Δ





t


2


ɛ
0


Δ





x





(


H

i
+
1

j

-

H

i
-
1

j


)

.







Thus, for i<K operations are with total fields everywhere in the equation, and for i>K+1 operations are with scattered fields. The transition yields the following (6):







E
K

j
+
1


=



E
K
j

+



Δ





t


2


ɛ
0


Δ





x




(


H


K
+
1

,
total

j

-

H

K
-
1

j


)



=



E
K
j

+



Δ





t


2


ɛ
0


Δ





x




(


(


H

K
+
1

j

+


H
inc



(


x

K
+
1


,

t
i


)



)

-

H

K
-
1

j


)



=


E
K
j

+



Δ





t


2


ɛ
0


Δ





x




(


(



H
inc



(


x

K
+
1


,

t
i


)


-

H

K
-
1

j


)

+

H

K
+
1

j


)









Operating on the incident and total quantities first and then adding in the scattered field quantities, the scattered field quantities are expected to be smaller when the incident field is impinging.


In the scattered region (7):







E

K
+
1


j
+
1


=



E

K
+
1

j

+



Δ





t


2


ɛ
0


Δ





x




(


H

K
+
2

j

-

H

K
,
scattered

j


)



=


E

K
+
1

j

+



Δ





t


2


ɛ
0


Δ





x




(


H

K
+
2

j

-

(


H
K
j

-


H
inc



(


x
K

,

t
j


)



)


)









where the differencing of total and incident quantities occurs first.


The H field is updated in substantially the same way. Using higher orders in space involves more points in the interface. For example, for 4th order spatial derivatives, there 4 points in the transition region which have to be updated using analogues of (6) and (7).


In one embodiment, for any point, the derivative may be written as a combination of the left and the right derivatives (8):









f



x


=


1
2



(




f




x
i



+



f




x
r




)






For i<K, the derivative is computed using spectral derivative on the total field (TF) region (302). For i>K+1, the derivative is computed using finite differences (FD) on the scattered field (304). Since there are only a few points, they may be very finely spaced. The spectral derivative is used for the left derivative and a right-handed stencil for the right derivative. To compute the transition region (306), the equation is (9):







E
K

j
+
1


=



E
K
j

+


1
2




Δ





t


2


ɛ
0


Δ





x




(


-

H


K
+
2

,
total

j


+

4


H


K
+
1

,
total

j


-

3


H
K
j



)


+


1
2




Δ





t


ɛ
0







H
K
j





x
spectral





=



E
K
j

+


1
2




Δ





t


2


ɛ
0


Δ





x








(


-

(


H

K
+
2

j

+


H
inc



(


x

K
+
2


,

t
i


)



)


+

4


(


H

K
+
1

j

+


H
inc



(


x

K
+
1


,

t
i


)



)


-

3


H
K
j



)


+


1
2




Δ





t


ɛ
0







H
K
j





x
spectral





=


E
K
j

+


1
2




Δ





t


2


ɛ
0


Δ





x




(


-

(

H

K
+
2

j

)


+

4


(

H

K
+
1

j

)


-

3


H
K
j



)


+


1
2




Δ





t


ɛ
0







H
K
j





x
spectral




+


1
2




Δ





t


2


ɛ
0


Δ





x




(


-

(


H
inc



(


x

K
+
2


,

t
i


)


)


+

4


(


H
inc



(


x

K
+
1


,

t
i


)


)



)









The last term in (9) allows for the injection of the incident field into the pseudo-spectral (PS) solve. For i=K+1, equation (7) continues to be used.


Accordingly, the matrix of coefficients is created using a combination of PS and FD methods. The incident field contributes solely to the right hand side of the matrix equation.


Non-Reflecting Boundary Conditions with Dispersion


In one embodiment of the present invention, the time-domain simulation uses non-reflecting boundary conditions so that the computational domain may be truncated. In stage 204 of FIG. 2, the solution of Maxwell's equations in the time domain may be used.


In one embodiment, an absorbing layer may be added to the computational domain or non-reflecting boundary conditions may be determined based on the solution the wave equation (402 of FIG. 4) to allow for the truncation of the computational domain. Several approaches may be used to form the non-reflecting boundary condition equations. The Perfectly Matched Layer (PML) is an alternative to non-reflecting boundary conditions based on the wave equation. In one embodiment, the non-reflecting boundary conditions may provide relatively smaller domains leading to smaller computational times.


In this alternative embodiment, the wave equation is given by (10):










2


u




t
2



=


c
2






2


u




x
2









from which the left traveling and the right traveling solutions (11) are obtained:










u



t


±

c




u



x




=
0





where the minus represents the right traveling solution and the plus the left traveling solution. Then, for example, for a right boundary, only the right traveling solutions are desired. Then an equation is determined for the update of the rightmost point ui. After discretizing and using one-sided stencils for the derivatives, from (11):













u
i

n
+
1


-

u
i
n



Δ





t


-

c




u
i

n
+
1


-

u

i
-
1


n
+
1




Δ





x




=
0




(
12
)







This yields (13):







u
i

n
+
1


=


1


Δ





x

-

c





Δ





t



·

(



u
i
n


Δ





x

-


u

i
-
1


n
+
1



c





Δ





t


)







which is accurate to first order. Larger stencils may be used for the derivatives to obtain results accurate to higher order.


Since outgoing waves could travel in a variety of directions, thus prohibiting the simple use of (11) for a single preferred direction, the equation may be solved using the Fourier space of the directions parallel to the planar boundary. Thus, for three dimensions an analogous expression to (11) is given by (14):









±



u



x





(

x
,
η
,
ζ
,
t

)


+




u



t




(

x
,
η
,
ζ
,
t

)


+


[


τ
w

*
u

]



(

x
,
η
,
ζ
,
t

)



=
0





where τw is the plane convolution kernel which is applied using recursive accumulators. The derivatives, in analogy to (11), are given by one-handed derivative stencils and may be solved for the update variable.


These annihilation operators are based on the existence of the wave equation in the time domain. For dispersive materials this may not be the case, as pulses of the form f(x−ct) will not be Eigen functions of the operator and may undergo dispersion for any choice of c.


Starting in the frequency domain, Maxwell's equations are given by (15):







ⅈω






H


(

x
,
ω

)



=




E



x




(

x
,
w

)









ⅈω






ɛ


(
ω
)




E


(

x
,
ω

)



=




H



x




(

x
,
ω

)






This assumes the dielectric constant does not vary parallel to the plane boundary or for several cells (the size of the stencil) perpendicular to it. Thus, (16):








-

ω
2




ɛ


(
ω
)




E


(

x
,
ω

)



=




2


E




x
2







This equation has two solutions given by (17):

E(x,ω)=A(ω)exp(−iω√{square root over (ε(ω))}·x)+B(ω)exp(+iω√{square root over (ε(ω))}·x)


The above equation may be rewritten using √{square root over (ε(ω))}=n(ω)+ik(ω) to get (18):

E(x,ω)=A(ω)exp((−iωn+ωkx)+B(ω)exp((iωn−ωkx)


The represents the left traveling and the right traveling solutions respectively. Thus, what is obtained is in analogy with (11) in the frequency domain (19):











u



x




(

x
,
ω

)


±


ⅈω


(


n


(
ω
)


+








k


(
ω
)




)




u


(

x
,
ω

)




=
0




The time domain dispersive kernel (20) may be defined:

χ1(t)=F−1((n(ω)+ik(ω)))


Then, in the time domain (21):











u



x




(

x
,
t

)


±

(


[


χ
1

*



u



t



]



(

x
,
t

)


)


=
0





where the convolution may be computed using the recursive accumulator approach and the x-derivative may be computed using a one-handed stencil of appropriate order.


Using left traveling equation as an example and computing the spatial derivative to second order, (22):









(


11


u
i

n
+
1



-

18


u

i
-
1


n
+
1



+

9


u

i
-
2


n
+
1



-

2


u

i
-
3


n
+
1




)


6

Δ





x


+




p
j





0

t
+

Δ





t








-


s
j



(

t
+

Δ





t

-
τ

)








u



t




(


x
i

,
τ

)








τ





+


ɛ






u



t




(


x
i

,
t

)



=
0





where the special susceptibility is represented as a sum exponentials.


Thus, (23):








p
j





0

t
+

Δ





t








-


s
j



(

t
+

Δ





t

-
τ

)








u



t




(


x
i

,
τ

)








t




=




p
j





0
t






-


s
j



(

t
+

Δ





t

+
τ

)








u



t




(


x
i

,
τ

)








τ




+


p
j





t

t
+

Δ





t








-


s
j



(

t
+

Δ





t

-
τ

)








u



t




(


x
i

,
τ

)








τ





=



ψ
j



(

t
+

Δ





t


)


=






-

s
j



Δ





t





ψ
j



(
t
)



+


p
j





t

t
+

Δ





t








-


s
j



(

t
+

Δ





t

-
τ

)








u



t




(


x
i

,
τ

)








τ











The last integral is a very thin integral. The variable u may be approximated as a linear function on this integral for this treatment (higher order polynomials may be used, if desired).


Then (24)








p
j





t

t
+

Δ





t








-


s
j



(

t
+

Δ





t

-
τ

)








u



t




(


x
i

,
τ

)








τ




=




p
j



(

(




s
j


Δ





t

-
1
+




-

s
j



Δ





t





s
j
2


Δ





t


)

)







u
i

n
+
1





t



+



p
j



(



(

1
-




-

s
j



Δ





t



)


s
j


-

(




s
j


Δ





t

-
1
+




-

s
j



Δ





t





s
j
2


Δ





t


)


)







u
i
n




t








By definition, (25):







χ
0
j

=



p
j



(


(

1
-




-

s
j



Δ





t



)


s
j


)







and








ξ
0
j

=


p
j



(



(

1
-




-

s
j



Δ





t



)


s
j


-

(




s
j


Δ





t

-
1
+




-

s
j



Δ





t





s
j
2


Δ





t


)


)






This yields (26) from (21):









(


11


u
i

n
+
1



-

18


u

i
-
1


n
+
1



+

9


u

i
-
2


n
+
1



-

2


u

i
-
3


n
+
1




)


6

Δ





x


+







-

s
j



Δ





t




ψ
j
n



+





u
i

n
+
1





t




(


ɛ


+



(


χ
0
j

-

ξ
0
j


)



)


+





u
i
n




t






ξ
0
j




=
0




Using a finite difference for the derivatives yields (27):









(


25


u
i

n
+
1



-

48


u

i
-
1


n
+
1



+

36


u

i
-
2


n
+
1



-

16


u

i
-
3


n
+
1



+

3


u

i
-
4


n
+
1




)


12

Δ





x


+







-

s
j



Δ





t




ψ
j
n



+




3


u
i

n
+
1



-

4


u
i
n


+

u
i

n
-
1




2

Δ





t




(


ɛ


+



(


χ
0
j

-

ξ
0
j


)



)


+




u
i

n
+
1


-

u
i

n
-
1




2

Δ





t






ξ
0
j




=
0




Solving for u, the final form for the update equation (27) is:







u
i

n
+
1


=



-
1



25

12

Δ





x


+



3


(


ɛ


+



(


χ
0
j

-

ξ
0
j


)



)


+



ξ
0
j




2

Δ





t






[








-

s
j



Δ





t




ψ
j
n



+


u
i
n





-
2



(


ɛ


+



(


χ
0
j

-

ξ
0
j


)



)



Δ





t



-


u
i

n
-
1







1
2





ξ
0
j



-


1
2



(


ɛ


+



(


χ
0
j

-

ξ
0
j


)



)




Δ





t



+




-
48



u

i
-
1


n
+
1



+

36


u

i
-
2


n
+
1



-

16


u

i
-
3


n
+
1



+

3


u

i
-
4


n
+
1





12

Δ





x



]






In an embodiment, one of the advantages of this method is that no additional cells are introduced and the cost of updating the special boundary points may be comparable to the cost of updating interior points in a dispersive material.


In two dimensions (28):







ⅈω







H
z



(

x
,
y
,
ω

)



=



-




E
y




x





(

x
,
y
,
w

)


+





E
x




y




(

x
,
y
,
w

)











ⅈωɛ


(
ω
)





E
x



(

x
,
y
,
ω

)



=





H
z




y




(

x
,
y
,
ω

)










ⅈωɛ


(
ω
)





E
y



(

x
,
y
,
ω

)



=


-




H
z




x





(

x
,
y
,
ω

)






Using a Fourier transform with respect to y yields (29):







ⅈω







H
z



(

x
,
ζ
,
ω

)



=



-




E
y




x





(

x
,
ζ
,
w

)


+

ⅈζ







E
x



(

x
,
ζ
,
w

)












ⅈωɛ


(
ω
)





E
x



(

x
,
ζ
,
ω

)



=

ⅈζ







H
z



(

x
,
ζ
,
ω

)











ⅈωɛ


(
ω
)





E
y



(

x
,
ζ
,
ω

)



=


-




H
z




x





(

x
,
ζ
,
ω

)






Eliminating the E-fields, an equation for Hz only may be given by (30):








-

ω
2




ɛ


(
ω
)





H
z



(

x
,
ζ
,
ω

)



=






2



H
z





x
2





(

x
,
ζ
,
w

)


-


ζ
2




H
z



(

x
,
ζ
,
w

)








From which we get (22):








(


ζ
2

-


ω
2



ɛ


(
ω
)




)




H
z



(

x
,
ζ
,
ω

)



=





2



H
z





x
2





(

x
,
ζ
,
w

)






This equation is in analogy with (16). Similarly to (17), an equation describing left and right traveling waves (31):







H


(

x
,
ζ
,
ω

)


=



A


(
ω
)




exp


(


-
ⅈω






ɛ


(
ω
)


-


ζ
2


ω
2




·
x


)



+


B


(
ω
)




exp


(


+
ⅈω






ɛ


(
ω
)


-


ζ
2


ω
2




·
x


)








In analogy with (20), time-domain non-reflecting boundary condition susceptibility is defined by function (32):








χ
1



(

t
,
ζ

)


=


F

-
1




(



ɛ


(
ω
)


-


ζ
2


ω
2




)






This yields an equation similar to (21) in two dimensions given by (33):











u



x




(

x
,
ζ
,
t

)


±

(


[


χ
1

*



u



t



]



(

x
,
ζ
,
t

)


)


=
0




The application of equations (22)-(27) is identical except for the use of the two dimension time-domain non-reflecting susceptibility function.


Now that the derivation of the two dimensional non-reflecting boundary condition is completed, the three dimensional condition may be determined by inspection. In three dimensions, instead of (32), what is generated is (35):







H


(

x
,
ζ
,
η
,
ω

)


=



A


(
ω
)




exp


(


-
ⅈω






ɛ


(
ω
)


-



ζ
2

+

η
2



ω
2




·
x


)



+


B


(
ω
)




exp


(


+
ⅈω






ɛ


(
ω
)


-



ζ
2

+

η
2



ω
2




·
x


)








Where η and ζ are conjugate variables with respect to y and z. Equation (34) becomes (36):











u



x




(

x
,
ζ
,
η
,
t

)


±

(


[


χ
1

*



u



t



]



(

x
,
ζ
,
η
,
t

)


)


=
0




The rest of the computation follows the (22)-(27) of the one-dimensional derivation above.


As shown in FIG. 5, stage 206 uses a high-order unconditionally stable computation method which is both stable and accurate for large time-steps. In one embodiment of stage 206, the time-step is computed using the standard Alternate Direction Implicit time-stepping method (ADI) with a full time step Δt advancing from time step n to time step n+1, is described by the following stepping equations which advance the state vector in two substeps








Δ





t

2

,





each having an implicit and an explicit part:











(

1
-



Δ





t

2


A


)



w

(

n
+

1
2


)



=


(

1
+



Δ





t

2


B


)



w

(
n
)







(

37

a

)








(

1
-



Δ





t

2


B


)



w

(

n
+
1

)



=


(

1
+



Δ





t

2


A


)



w

(

n
+

1
2


)







(

37

b

)







This method is of second order in time (as will be shown later).


If equation (37a) is multiplied by






(

1
+



Δ





t

2


A


)





and equation (37b) by







(

1
-



Δ





t

2


A


)

,





then add the two up and use the fact that







(

1
+



Δ





t

2


A


)






and






(

1
-



Δ





t

2


A


)






commute, the full step ADI equation is obtained:











(

1
-



Δ





t

2


A


)



(

1
-



Δ





t

2


B


)



w

(

n
+
1

)



=


(

1
+



Δ





t

2


A


)



(

1
+



Δ





t

2


B


)



w

(
n
)







(
38
)







The following embodiments describe various methods for increasing the order in time of ADI from 2nd to 4th and higher order.


In one embodiment, the power series approach may raise ADI order in time, at a very low cost.


In another embodiment, the Split-step method may be used to raise ADI order in time, at a cost of 3× (cost of ADI) for 4th order or 7× (cost of ADI) for 6th order.


In another embodiment, the Deferred Correction Method (DCM) may raise ADI order in time, at a cost of (roughly) 2× (cost of ADI) for 4th order or 3× (cost of ADI) for 6th order.


The DCM primarily is used to run 2nd order ADI over a possibly large number of steps, then to use the fields thus obtained to compute 3rd order corrections at each step, and re-run ADI while adding these corrections at each sub-step.


Assuming that the 2nd order ADI needs a correction C at each full step in order to become higher order, equation (38) becomes:











(

1
-



Δ





t

2


A


)



(

1
-



Δ





t

2


B


)



w

(

n
+
1

)



=



(

1
+



Δ





t

2


A


)



(

1
+



Δ





t

2


B


)



w

(
n
)



+
C





(
39
)







The correction would then be given by:









C
=




(

1
-



Δ





t

2


A


)



(

1
-



Δ





t

2


B


)



w

(

n
+
1

)



-


(

1
+



Δ





t

2


A


)



(

1
+



Δ





t

2


B


)



w

(
n
)




=



(

1
+



Δ






t
2


4


AB


)



(


w

(

n
+
1

)


-

w

(
n
)



)


-



Δ





t

2



(

A
+
B

)



(


w

(

n
+
1

)


+

w

(
n
)



)








(
40
)







The state vector difference and sum may be expanded Taylor series, taking advantage of the fact that these may contain only the odd or even terms, respectively:











w

(

n
+
1

)


-

w

(
n
)



=


Δ





t





w

(

n
+

1
2


)





t



+



Δ






t
3


24






3



w

(

n
+

1
2


)






t
3




+



Δ






t
5


1920






5



w

(

n
+

1
2


)






t
5




+






(

40

a

)








w

(

n
+
1

)


+

w

(
n
)



=


2






w

(

n
+

1
2


)



+



Δ






t
2


4






2



w

(

n
+

1
2


)






t
2




+



Δ






t
4


192






4



w

(

n
+

1
2


)






t
4




+






(

40





b

)







Substituting into the correction expression:









C
=



(





w

(

n
+

1
2


)





t


-


(

A
+
B

)



w

(

n
+

1
2


)




)


Δ





t

+


(



1
4


AB





w

(

n
+

1
2


)





t



-



(

A
+
B

)

8






2



w

(

n
+

1
2


)






t
2




+


1
24






3



w

(

n
+

1
2


)






t
3





)


Δ






t
3


+


(



AB
96






3



w

(

n
+

1
2


)






t
3




-



(

A
+
B

)

384






4



w

(

n
+

1
2


)






t
4




+


1
1920






5



w

(

n
+

1
2


)






t
5





)


Δ






t
5


+






(
41
)







In (41), the 1st order of the correction is identically 0 because of the original Maxwell equation, and there is no 2nd order term, thus confirming that ADI is 2nd order accurate in time.


In order to get a 4th order accurate method, it is enough to compute accurately enough and then use the 3rd order term in (41), since there is no 4th order term in the correction.


A particularly elegant way to compute the time derivatives of w is by repeated central differences:














w

(

n
+

1
2


)





t






w

(

n
+
1

)


-

w

(
n
)




Δ





t













2



w

(

n
+

1
2


)






t
2







w

(

n
+
2

)


-

w

(

n
+
1

)


-

w

(
n
)


+

w


(
n
)

-
1




2

Δ






t
2














3



w

(

n
+

1
2


)






t
3







w

(

n
+
2

)


-

3


w

(

n
+
1

)



+

3


w

(
n
)



-

w


(
n
)

-
1




Δ






t
3








(
42
)







Substituting these finite differences into (41), we get the expression of the correction needed in order to raise the accuracy in time to 4th order:









C





Δ






t
2


4



AB


(


w

(

n
+
1

)


-

w

(
n
)



)



-



Δ





t

16



(

A
+
B

)



(


w

(

n
+
2

)


-

w

(

n
+
1

)


-

w

(
n
)


+

w

(

n
-
1

)



)


+


1
24



(


w

(

n
+
2

)


-

3


w

(

n
+
1

)



+

3


w

(
n
)



-

w

(

n
-
1

)



)







(
43
)







Thus, after computing the correction in (43) based on the first run of ADI, ADI is run again but this time applying half the correction at each time sub-step:











(

1
-



Δ





t

2


A


)



w

(

n
+

1
2


)



=



(

1
+



Δ





t

2


B


)



w

(
n
)



+

C
2






(

44

a

)








(

1
-



Δ





t

2


B


)



w

(

n
+
1

)



=



(

1
+



Δ





t

2


A


)



w

(

n
+

1
2


)



+

C
2






(

44

b

)







This symmetrical application of half the correction at each sub-step is equivalent to the application of the full correction after the full step, as can be verified by multiplying equation (44a) by






(

1
+



Δ





t

2


A


)





and equation (44b) by







(

1
-



Δ





t

2


A


)

,





then add the two up and use the fact that







(

1
+



Δ





t

2


A


)






and






(

1
-



Δ





t

2


A


)






commute.


The DCM offers a way to raise the accuracy of ADI to 4th order. If a 6th order time accuracy turns out to be needed, a similar calculation of the 5th order correction is needed, based on the 4th order accurate state vectors computed in the second run of ADI. This correction may then be applied during a 3rd run of ADI.


Field Transformation


In cases of oblique incidence, a field transformation maybe used to transform the problem from an extended domain into a problem with a periodic domain. In that case the equations are slightly modified from Maxwell's equations. The new equations are given in the 2D TE case by:








1
c






Q
z




t



=


-




P
y




x



+



sin





θ

c






P
y




t












1
c






Q
x




t



=




P
y




z











ɛ


(

x
,
z

)


c






P
y




t



=





Q
z




z


-




Q
z




x


+



sin





θ

c






Q
z




t








This new set of equation may be solved by exactly the same techniques as the original set of Maxwell's equation. If an explicit, conditionally stable time-stepping method is used; however, a relatively very small time step may be required to obtain stability. In one embodiment, where an unconditionally stable time-stepping method is used—the time step utilized may be relatively large and, thus, significantly improve the computation time.


In the description and claims, the terms “coupled” and “connected,” along with their derivatives, may be used. In some embodiments of the invention, “connected” may be used to indicate that two or more elements are in direct physical contact with each other. “Coupled” may mean that two or more elements are in direct physical contact. However, “coupled” may also mean that two or more elements may not be in direct contact with each other, but may still cooperate or interact with each other.


Although embodiments have been described in language specific to structural features and/or methodological acts, it is to be understood that claimed subject matter may not be limited to the specific features or acts described. Rather, the specific features and acts are disclosed as sample forms of implementing various embodiments. While the invention has been described above in conjunction with one or more specific embodiments, it should be understood that the invention is not intended to be limited to one embodiment. The invention is intended to cover alternatives, modifications, and equivalents as may be included within the spirit and scope of the invention, such as those defined by the appended claims.

Claims
  • 1. A method of time-domain computation for simulating electromagnetic (EM) scattering spectra comprising: a processor computing spatial derivatives comprising computing spectral derivatives in some portion of the domain and finite difference derivatives in some other portion of the domain;the processor forming an equation for boundary conditions; andthe processor computing a time-stepping scheme.
  • 2. The method of claim 1, further comprising computing spatial derivatives of a transition portion of the domain using a linear combination of the spectral derivatives and finite difference derivatives.
  • 3. The method of claim 1, wherein forming the equation for boundary conditions comprises forming the equation for non-reflecting boundary conditions to truncate the computational domain.
  • 4. The method of claim 3, further comprising adding an absorbing layer to the computational domain.
  • 5. The method of claim 3, wherein forming the equation for non-reflecting boundary conditions comprises computing a solution to a wave equation.
  • 6. The method of claim 1, wherein computing the time-stepping scheme comprises computing the time-stepping using a high-order unconditionally stable computation method.
  • 7. The method of claim 1, wherein materials under simulation have frequency-dependent dispersive dielectric properties.
  • 8. The method of claim 1, wherein the time-stepping scheme comprises a field transformed system of equations for oblique incidence on a periodic domain.
  • 9. The method of claim 1, further comprising computing a linear combination of plane waves for an incident pulse to simulate a finite aperture for the incident pulse in a single time-domain solution.
  • 10. A method of time-domain computation for simulating electromagnetic (EM) scattering spectra comprising: a processor computing spatial derivatives of the domain;the processor forming an equation for non-reflecting boundary conditions to truncate the computational domain; andthe processor computing a time-stepping scheme.
  • 11. The method of claim 10, wherein computing spatial derivatives of the domain comprises computing spectral derivatives in some portion of the domain and finite difference derivatives in some other portion of the domain.
  • 12. The method of claim 10, further comprising computing spatial derivatives of a transition portion of the domain using a linear combination of the spectral derivatives and finite difference derivatives.
  • 13. The method of claim 10, wherein forming the equation for non-reflecting boundary conditions comprises computing a solution to a wave equation.
  • 14. The method of claim 10, wherein computing the time-stepping scheme comprises computing the time-stepping using a high-order unconditionally stable computation method.
  • 15. The method of claim 10, wherein materials under simulation comprise frequency-dependent dispersive dielectric properties.
  • 16. The method of claim 10, wherein the time-stepping scheme comprises a field transformed system of equations for oblique incidence on a periodic domain.
  • 17. A method of time-domain computation for simulating electromagnetic (EM) scattering spectra comprising: a processor computing spatial derivatives of the domain;the processor forming an equation for boundary conditions; andthe processor computing a time-stepping scheme using a high-order unconditionally stable computation method.
  • 18. The method of claim 17, wherein computing spatial derivatives of the domain comprises computing spectral derivatives in some portion of the domain and finite difference derivatives in some other portion of the domain.
  • 19. The method of claim 17, further comprising computing spatial derivatives of a transition portion of the domain using a linear combination of the spectral derivatives and finite difference derivatives.
  • 20. The method of claim 17, wherein forming the equation for boundary conditions comprises forming the equation for non-reflecting boundary conditions to truncate the computational domain.
  • 21. The method of claim 20, wherein forming the equation for non-reflecting boundary conditions comprises computing a solution to a wave equation.
  • 22. A system for measuring electromagnetic (EM) spectra and computing a time-domain simulation for simulating scattering spectra comprising: a broadband EM radiation source for illuminating a wafer;a spectrometer to detect different spectral components of radiation reflected from the wafer; anda processor to compute scattering spectra by: computing spatial derivatives comprising computing spectral derivatives in some portion of the domain and finite difference derivatives in some other portion of the domain;forming an equation for non-reflecting boundary conditions;computing a high-order unconditionally stable computation method;varying the model geometry; andre-computing the computed scattering spectra until the computed scatting spectra matches a measured spectrum.
  • 23. The system of claim 22, wherein the processor computes scattering spectra by computing spatial derivatives of a transition portion of the domain using a linear combination of the spectral derivatives and finite difference derivatives.
  • 24. The system of claim 22, wherein materials under simulation comprise frequency-dependent dispersive dielectric properties.
  • 25. The system of claim 22, wherein the processor computes scattering spectra by computing spatial derivatives of a transition portion of the time-domain using a linear combination of the spectral derivatives and finite difference derivatives.
  • 26. The system of claim 22, wherein the time-domain under computation comprises a time-domain of finite extent.
  • 27. The system of claim 22, wherein the time-domain under computation comprises a periodic domain.
  • 28. The system of claim 22, wherein the processor computes a field transformed system of equations for oblique incidence on a periodic domain.
US Referenced Citations (2)
Number Name Date Kind
6574650 Aoki Jun 2003 B1
20050105787 Gulati May 2005 A1