CN113568278A - Curve type reverse photoetching method based on rapid covariance matrix self-adaptive evolution strategy - Google Patents
Curve type reverse photoetching method based on rapid covariance matrix self-adaptive evolution strategy Download PDFInfo
- Publication number
- CN113568278A CN113568278A CN202110761169.9A CN202110761169A CN113568278A CN 113568278 A CN113568278 A CN 113568278A CN 202110761169 A CN202110761169 A CN 202110761169A CN 113568278 A CN113568278 A CN 113568278A
- Authority
- CN
- China
- Prior art keywords
- mask
- evaluation function
- mask pattern
- pattern
- photoresist
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 90
- 239000011159 matrix material Substances 0.000 title claims abstract description 81
- 238000001259 photo etching Methods 0.000 title claims abstract description 23
- 230000002441 reversible effect Effects 0.000 title claims description 44
- 238000011156 evaluation Methods 0.000 claims abstract description 85
- 229920002120 photoresistant polymer Polymers 0.000 claims abstract description 53
- 238000005457 optimization Methods 0.000 claims abstract description 46
- 238000001459 lithography Methods 0.000 claims abstract description 31
- 238000002834 transmittance Methods 0.000 claims abstract description 22
- 238000003384 imaging method Methods 0.000 claims abstract description 19
- 230000003044 adaptive effect Effects 0.000 claims abstract description 17
- 238000009826 distribution Methods 0.000 claims abstract description 12
- 230000006870 function Effects 0.000 claims description 96
- 239000013598 vector Substances 0.000 claims description 21
- 239000000243 solution Substances 0.000 claims description 14
- 230000035772 mutation Effects 0.000 claims description 12
- 230000001186 cumulative effect Effects 0.000 claims description 9
- 238000001914 filtration Methods 0.000 claims description 9
- 238000012545 processing Methods 0.000 claims description 9
- 238000012804 iterative process Methods 0.000 claims description 8
- 230000013016 learning Effects 0.000 claims description 8
- 230000006798 recombination Effects 0.000 claims description 8
- 238000005215 recombination Methods 0.000 claims description 8
- 238000004364 calculation method Methods 0.000 claims description 7
- 230000035945 sensitivity Effects 0.000 claims description 7
- 230000001174 ascending effect Effects 0.000 claims description 6
- 238000011161 development Methods 0.000 claims description 6
- 239000000203 mixture Substances 0.000 claims description 6
- 238000001228 spectrum Methods 0.000 claims description 6
- 230000005540 biological transmission Effects 0.000 claims description 4
- 238000007476 Maximum Likelihood Methods 0.000 claims description 3
- 239000007983 Tris buffer Substances 0.000 claims description 3
- 238000013016 damping Methods 0.000 claims description 3
- 210000001747 pupil Anatomy 0.000 claims description 3
- 230000000717 retained effect Effects 0.000 claims description 3
- 238000009499 grossing Methods 0.000 claims 1
- 238000010586 diagram Methods 0.000 description 13
- 238000005516 engineering process Methods 0.000 description 9
- 238000000206 photolithography Methods 0.000 description 9
- 238000004519 manufacturing process Methods 0.000 description 7
- 230000002829 reductive effect Effects 0.000 description 6
- 238000012937 correction Methods 0.000 description 4
- 238000010894 electron beam technology Methods 0.000 description 4
- 230000009326 social learning Effects 0.000 description 3
- 230000004075 alteration Effects 0.000 description 2
- 238000000354 decomposition reaction Methods 0.000 description 2
- 230000000670 limiting effect Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000010355 oscillation Effects 0.000 description 2
- 239000002245 particle Substances 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- XUIMIQQOPSSXEZ-UHFFFAOYSA-N Silicon Chemical compound [Si] XUIMIQQOPSSXEZ-UHFFFAOYSA-N 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005286 illumination Methods 0.000 description 1
- 238000007654 immersion Methods 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 239000007788 liquid Substances 0.000 description 1
- 230000036961 partial effect Effects 0.000 description 1
- 230000010287 polarization Effects 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 229910052710 silicon Inorganic materials 0.000 description 1
- 239000010703 silicon Substances 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G03—PHOTOGRAPHY; CINEMATOGRAPHY; ANALOGOUS TECHNIQUES USING WAVES OTHER THAN OPTICAL WAVES; ELECTROGRAPHY; HOLOGRAPHY
- G03F—PHOTOMECHANICAL PRODUCTION OF TEXTURED OR PATTERNED SURFACES, e.g. FOR PRINTING, FOR PROCESSING OF SEMICONDUCTOR DEVICES; MATERIALS THEREFOR; ORIGINALS THEREFOR; APPARATUS SPECIALLY ADAPTED THEREFOR
- G03F7/00—Photomechanical, e.g. photolithographic, production of textured or patterned surfaces, e.g. printing surfaces; Materials therefor, e.g. comprising photoresists; Apparatus specially adapted therefor
- G03F7/70—Microphotolithographic exposure; Apparatus therefor
- G03F7/70425—Imaging strategies, e.g. for increasing throughput or resolution, printing product fields larger than the image field or compensating lithography- or non-lithography errors, e.g. proximity correction, mix-and-match, stitching or double patterning
- G03F7/70433—Layout for increasing efficiency or for compensating imaging errors, e.g. layout of exposure fields for reducing focus errors; Use of mask features for increasing efficiency or for compensating imaging errors
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Exposure And Positioning Against Photoresist Photosensitive Materials (AREA)
Abstract
An Inverse Lithography (IL) method of curve type based on Fast Covariance Matrix adaptive evolution strategy (Fast CMA-ES). The method characterizes the mask pattern in pixels, each pixel representing the mask transmittance at that location. And (3) optimizing the mask pattern by adopting a rapid covariance matrix adaptive evolution strategy by taking weighted superposition of pattern errors between the photoresist pattern and the target pattern under different exposure dose deviations and defocus conditions as an evaluation function. The method approximates the covariance matrix representing the solution space distribution to a set of simple models only composed of two evolution paths, learns the main solution search direction and variable correlation by means of the low-rank approximation of the covariance matrix, adaptively adjusts the search step length, improves the convergence efficiency and the optimization capability, and effectively improves the photoetching imaging quality and the process robustness.
Description
Technical Field
The invention belongs to the technical field of photoetching resolution enhancement, and particularly relates to a curvilinear reverse photoetching method based on a rapid covariance matrix adaptive evolution strategy.
Background
Photolithography is one of the key technologies in the manufacture of very large scale integrated circuits, and the photolithography resolution determines the Critical Dimension (CD) of the integrated circuit pattern. As feature sizes of integrated circuit patterns continue to shrink, mask diffraction effects become increasingly non-negligible, resulting in reduced lithographic imaging quality, and a series of lithography Resolution Enhancement Techniques (RETs) have been proposed in the art. Inverse Lithography (ILT) was first used for 65nm node integrated circuit fabrication, and has been developed to become one of the resolution enhancement techniques essential for 22nm and below technology node integrated circuit fabrication. The reverse lithography technique utilizes a lithography imaging model to reversely calculate the mask pattern with the best imaging quality under given process conditions. The optimal solution search space of the reverse photoetching is large, and the mask optimization process is not restricted by the target pattern. Since Sub-Resolution Assist Feature (SRAF) can be flexibly generated and optimization of the main Feature and the Assist Feature can be simultaneously achieved, the optimal mask pattern calculated by the reverse lithography technique can achieve the pattern fidelity and process window that cannot be achieved by Optical Proximity Correction (OPC) and the Sub-Resolution Assist Feature.
The early reverse photoetching technology has the problems of low optimization efficiency, weak manufacturability of the optimized mask and the like. In order to avoid the loss of imaging performance caused by improving Mask manufacturability by the regularization method, technologies such as Curvilinear Mask Process Correction (CLMPC), Curvilinear Mask Rule Check (CLMC), Model-Based Mask Data Preparation (MBMDP), etc. are successively proposed in the industry, and Curvilinear Mask patterns are generated by the reverse lithography technology. Due to the limiting factors of the shape of the electron beam, the sensitivity of the photoresist, the resolution of the lithography machine, etc., the actual mask pattern and the pattern transferred to the silicon wafer are both curvilinear. The imaging quality of the curvilinear mask pattern is better than that of the manhattan mask pattern produced by optical proximity correction. However, in order to precisely manufacture a curved mask pattern, more electron beam bombardment times are required, increasing mask write-through time and mask manufacturing costs. The Multi Beam Mask Writer (MBMW) can manufacture a Mask pattern with any shape by a single bombardment of electron beams with a large number of independent control switches, so that the Mask write time only depends on the Mask area and is not influenced by the shape of the Mask pattern. The introduction of multi-electron beam mask direct writing is considered by the industry to greatly improve the efficiency of curve type mask direct writing and clear the biggest obstacle of mask mass production. In recent years, the development of the full-chip reverse lithography technology is promoted by the introduction of a Graphics Processing Unit (GPU), and the scheme of mask block optimization, optimization result integration, global verification and multiple iterative adjustment and correction as in the conventional reverse lithography technology is not required any more, so that the efficiency of the full-chip reverse lithography is improved. Therefore, it is important to perform reverse lithography by using an efficient core optimization algorithm.
The optimization of the Mask pattern is guided by calculating the gradient of the evaluation function based on the gradient of the reverse photoetching method (prior art 1, W.Lv, Q.Xia, and S.Liu, "Mask-filtering-based inversion lithography," J.Micro/Nanolith. MEMS MOEMS,12(4),043003 (2013)). Since the gradient calculation process involves frequent calling of the lithography imaging module, when the complexity of the lithography imaging model and the evaluation function expression is increased, the time consumption of the gradient calculation is obviously increased, and the mask optimization efficiency is reduced. The mask optimization method based on the heuristic optimization algorithm does not need to master the priori knowledge of photoetching, and any imaging model and optimization target can be selected. Reverse lithography pixelates the mask pattern with a small-size grid, which is essentially a non-convex (multi-peaked), inseparable high-dimensional nonlinear mask optimization problem. The mask optimization method based on the Covariance Matrix adaptive Evolution Strategy (CMA-ES) algorithm (prior art 2, G.Chen, S.Li, and X.Wang, "Source mask optimization using the Covariance Matrix adaptive Evolution Strategy," Opt.express 28(22), "33371-. However, when the dimension of the optimized variable is increased to thousands or even more than tens of thousands, the eigenvalue decomposition efficiency of the large covariance matrix is extremely low, and the generation efficiency of the candidate solution vector and the mask optimization performance are greatly reduced. In addition, the variable dimension in reverse lithography is high, which results in too low learning rate factor of the covariance matrix adaptive evolution strategy algorithm and too low adaptive adjustment speed of the covariance matrix and the search step length. Therefore, the covariance matrix adaptive evolution strategy is obviously not suitable for the inverse lithography technology with huge optimization variable dimension. The mask Optimization method based on the Social Learning Particle Swarm (SL-PSO) algorithm (prior art 3, z.zhang, s.li, x.wang, w.cheng, and y.qi, "Source mask Optimization for extreme-analysis based on a program mask model and a Social Learning Particle Swarm Optimization algorithm," operation.express 29(4),5448-5465(2021)) requires the construction of a population in which the number of individuals and the number of Optimization variables are linearly related, i.e., the Social Learning of the individuals is completed by the large population in reverse lithography, so that the number of calls of the evaluation function is greatly increased, and the mask Optimization efficiency is reduced.
In summary, the existing reverse lithography method has the defects of high gradient calculation cost, low convergence efficiency of the optimization algorithm due to overhigh variable dimension and the like.
Disclosure of Invention
The invention provides a curve type reverse photoetching method based on a rapid covariance matrix self-adaptive evolution strategy. The mask pattern is characterized by pixels, each pixel in the mask pattern representing the transmittance at that location. And (3) optimizing the mask pattern by adopting a rapid covariance matrix adaptive evolution strategy by taking weighted superposition of pattern errors between the photoresist pattern and the target pattern under different exposure dose deviations and defocus conditions as an evaluation function. The method approximates the covariance matrix representing the solution space distribution to a set of simple models only composed of two evolution paths, learns the main solution search direction and variable correlation by means of the low-rank approximation of the covariance matrix, adaptively adjusts the search step length, improves the convergence efficiency and the optimization capability, and effectively improves the photoetching imaging quality and the process robustness.
The technical solution of the invention is as follows:
the curve type reverse photoetching method based on the fast covariance matrix self-adaptive evolution strategy comprises the following specific steps:
1. initializing light source pattern J0Pupil function H0Photoresist sensitivity alpha and photoresist threshold trMask threshold tmDeveloping threshold tdevThe value of the exposure dose deviation and the corresponding weight, and the value of the defocus amount and the corresponding weight. (in the case where no additional description is given, the bold variables or numbers are vectors or matrices in this context)
Initializing T values of exposure dose deviation T, wherein the corresponding weight is ptInitializing H values of defocus H, and setting the corresponding weight as ph. Initializing a light source graph J according to the value of the defocusing amount h0And pupil function H0And (3) calculating TCC cores corresponding to the defocusing amount h in the Hopkins imaging model in advance, wherein TCC (Transmission Cross coefficient) represents a transmission Cross coefficient, and the first K TCC cores are reserved.
2. Initializing mask pattern M0A target pattern TP formed by initializing a mask pattern M0Obtaining a mask code xM。
Initializing mask pattern M0Is of size NV×NHWherein N isVAnd NHRespectively representing initialization mask patterns M0The number of elements contained in each column and each row is odd. Setting initialization mask pattern M0The transmittance of the upper light-transmitting pixel is 1, and the transmittance of the light-shielding pixel is 0. Initializing target pattern TP ═ M0。
The mask pattern coding mode is selected according to the symmetry of the mask pattern, and common mask patterns comprise an asymmetric mask pattern and an axisymmetric mask pattern.
When the mask pattern M is initialized0For asymmetric mask pattern, the initial mask pattern M is scanned column by column point0And carrying out mask coding by using all pixel values obtained by scanning:
xM=(M0(1,1),…,M0(NV,1),…,M0(i,j),…,M0(1,NH),…,M0(NV,NH)).
wherein M is0(i, j) represents the initialization mask pattern M0(ii) a mask pixel transmittance at the middle index position of (i, j),and i is more than or equal to 1 and less than or equal to NV,And j is more than or equal to 1 and less than or equal to NH,M0(i, j) is e {0,1}, and the variable dimension DM=NV×NH。
When the mask pattern M is initialized0When the horizontal axis symmetry and the vertical axis symmetry are satisfied simultaneously, the initialization mask pattern M is scanned column by column point0Middle row number range from 1 to NHVColumn number ranging from 1 to NHHThe sub-block of (2) is mask-encoded using the pixel values obtained by the scanning:
xM=(M0(1,1),…,M0(NHV,1),…,M0(i,j),…,M0(1,NHH),…,M0(NHV,NHH)).
wherein NHV=(1+NV)/2,NHH=(1+NH)/2,M0(i, j) represents the initialization mask pattern M0(ii) a mask pixel transmittance at the middle index position of (i, j),and i is more than or equal to 1 and less than or equal to NHV,And j is more than or equal to 1 and less than or equal to NHH,M0(i, j) is e {0,1}, and the variable dimension DM=NHV×NHH。
Mask patterns that satisfy only horizontal axis symmetry or only vertical axis symmetry may be encoded in a similar manner and will not be described in detail herein. 3. Coding x according to a maskMDecoding is carried out, and a binary mask M is obtained by mask filtering and binarization processingB。
The mask pattern decoding method is selected according to the symmetry of the mask pattern.
When the mask pattern M is initialized0When the mask pattern is asymmetric, the expression is usedCoding a mask xMIs arranged to be N in sizeV×NHThe matrix M of (a).
When the mask pattern M is initialized0When the horizontal axis symmetry and the vertical axis symmetry are simultaneously satisfied, the expression is utilizedCoding a mask xMIs finished into NHV×NHHSub-block M ofqUsing subblock MqFilling size of NV×NHThe line number range of the mask pattern M with the element values all being 0 is 1 to NHVColumn number ranging from 1 to NHHPart (c) of (a). According to sub-block MqNH th of mask patterns M, respectivelyVRow and NH thHAnd (4) listing as a symmetry axis, carrying out symmetric assignment on other elements in the mask pattern M, and dividing the value of the element on the corresponding symmetry axis by 2 after each symmetric assignment is finished to obtain the symmetric mask pattern M.
Whether the mask pattern is symmetrical or not, the complexity of the mask pattern can be reduced by a mask filtering method or a regularization method, thereby improving the manufacturability of the mask pattern. The invention adopts Gaussian filtering processing to the mask pattern to obtain the fuzzified mask pattern Mblur,
Wherein,representing the convolution symbol, r0Represents the center position, | | r-r0I represents point r to point r0Distance of (a)GFIs the standard deviation of the gaussian function and Ω represents the number of elements contained in the gaussian convolution kernel.
Using a mask threshold tmBlurred mask pattern MblurBinary processing is carried out to obtain a decoded binary mask MBI.e. MB=Γ(Mblur-tm)。Γ(x)={1|x≥0∪0|x<0} and the function Γ (x) will be MblurMiddle transmittance is greater than or equal to mask threshold tmAssigns M to 1blurMedium transmittance less than mask threshold tmThe pixel of (a) is assigned a value of 0.
4. Constructing an evaluation function of a reverse lithography problem
And taking weighted superposition of graphic errors between the photoresist graph and the target graph under different exposure dose deviations and defocus conditions as an evaluation function. The specific calculation process of the evaluation function is as follows:
4.1 decoding the mask xMBinary mask M obtained by decodingBSubstituting the space image into a Hopkins imaging model, calculating an aerial image AI when the defocusing amount is h,
wherein,is a binary mask MBThe mask diffraction spectrum calculated by fourier transform, (x, y) is the spatial coordinates of the mask pattern, and (f ', g') is the normalized spatial frequency coordinates of the mask diffraction spectrum. Phii(f ', g'; h) denotes the ith frequency domain TCC kernel, S, with defocus hiAnd the coefficients corresponding to the ith TCC core are shared by K TCC cores. IFFT { } denotes an inverse fourier transform.
4.2 calculating the photoresist image RI when the defocusing amount is h and the exposure dose deviation is t according to the space image AI and the sigmoid photoresist model,
where α is the photoresist sensitivity, trIs the photoresist threshold. Besides the sigmoid photoresist model used in the method, a constant threshold photoresist model, a variable threshold photoresist model and a three-dimensional photoresist model can be selected according to actual needsPhotoresist patterns, etc.
4.3 in the Positive developing process, if the RI of the photoresist image is greater than or equal to the developing threshold tdevThen the photoresist at that location is removed; conversely, if the photoresist image RI is less than the development threshold tdevThe photoresist at that location is retained. Thus, a developed resist pattern RC is obtained, that is, RC (x, y; h, t) ═ Γ (RI (x, y; h, t) -tdev)。
4.4 constructing an evaluation function f by utilizing the weighted superposition of the graphic errors between the photoresist graph and the target graph under the conditions of different exposure dose deviations t and defocus amounts h,
5. optimizing mask patterns using fast covariance matrix adaptive evolution strategy
5.1 initializing the evolution algebra g of the fast covariance matrix self-adaptive evolution strategy, the current minimum evaluation function value tmpBestF, the optimal mask code bestX, the population mean vector m, the search step sigma, the search step adjustment factor s, the evolution path P of the covariance matrix, periodically storing and updating the low-rank matrix P of the evolution path, the iteration termination condition of the optimization process and the like.
The variable dimension N of the optimization problem is an important parameter, and a plurality of parameters in the fast covariance matrix self-adaptive evolution strategy are obtained through calculation according to N. In a reverse lithography method, the optimization variable dimension N ═ DM. Setting the initial evolution algebra g to 0, setting the current minimum evaluation function value tmpBestF to a larger value, and coding x by using the mask corresponding to the target graph TPMInitializing best mask code bestX and population mean vector m(0)Initial search step size σ(0)Setting the length of the variable interval to be one third, and initializing a search step length adjustment factor to be s (0)0. The evolution path of the covariance matrix is initialized to p(0)The low rank matrix is initialized to P0.
In addition, the iteration termination condition of the reverse lithography includes: the minimum value of the evaluation function stopFitness, the maximum calling times of the evaluation function stopExval, and the variation range of the evaluation function values in the continuous iteration process is too small (the variation range of continuous nLimit generations is smaller than tolerance).
5.2 setting relevant parameters of the fast covariance matrix adaptive evolution strategy:
the weight corresponding to the ith individual in the recombination is:satisfy omega1≥…≥ωμIs not less than 0 and
cumulative time constant of covariance matrix evolution path: c is 2/(N +5).
cumulative time constant of search step: c. Cσ=0.3.
Target rate of search step adjustment: q. q.s*=0.27.
Searching for damping factor of step adjustment: dσ=1.
The number of search directions contained in the low rank matrix is: n ═ λ.
Algebraic interval of low rank matrix update: Δ g ═ 50.
5.3 Normal distribution according to the StandardCovariance matrix evolution path p of current generation (g generation)(g)Current low rank matrix P(g)Generating random mutation, combining with population mean vector m of current generation(g)Generating candidate solutions of the next generation (g +1 th generation), each candidate solution corresponding to a mask code, the steps are as follows:
5.3.1 random mutations were generated for the ith individual,wherein Is a low rank matrix P(g)Ith column in (1), corresponding to low rank matrix P(g)The ith search direction of (1).
5.3.2 population mean vector m in combination with the current generation(g)Random mutation with the i-th individual to generate the i-th individual of the next generation
5.4 updating the mean vector
After the evaluation function values of lambda individuals in the g +1 th generation population are arranged in ascending order, the individuals corresponding to the evaluation function values in the ith position are sorted, namelyf denotes the evaluation function constructed in step 4.4, which is to be called individually each timeDecoding as mask code to obtain binary mask MB. SelectingSelecting the first mu individuals with the minimum fitness value in the g +1 generation for recombination to generate a mean vector of the g +1 generationThe updated mean may be considered a weighted maximum likelihood estimate of the population distribution mean.
5.5 updating the evolution Path and Low rank matrix by cumulative learning
The evolution path cumulatively learns the continuous movement of the distribution mean in the iterative process, as shown in the following formula:
the evolutionary path cumulatively learns successive search directions in the iterative process, reducing oscillations between these search directions. The opposite search directions cancel out and the consistent direction is accumulated into the evolution path. Thus, the current evolutionary path represents one of the most potential search directions.
Every time a fixed algebra delta g is passed, the earliest searching direction in the low-rank matrix P is replaced by the current evolution path, and in other algebras, the low-rank matrix P of the previous generation is directly used, namely
if g%Δg=0,P(g+1)=P(g).
5.6 Using sort-based success rules for step size adjustment
Respectively extracting the minimum mu evaluation function values F of the g generation and the g +1 generation(g)And F(g+1)The union of the two is F ═ F(g)∪F(g+1). Then the union set F is arranged in ascending order to obtain Fmix. Calculating the difference of the two generations of populations by comparing the weighted rank sums of the two adjacent generations of populations: andthe ith-smallest evaluation function of the g-th generation and the g +1 th generation, respectively, is expressed in FmixThe order in (1). In an iterative process by means of a target rate q*Q is smoothed to eliminate randomness. Updating the search step adjustment factor to s(g+1)=(1-cσ)s(g)+cσ(q-q*) The search step is updated to σ(g+1)=σ(g)·exp(s(g+1)/dσ)。
5.7 judging the iteration termination condition
And if the minimum evaluation function value of the current population is less than the minimum evaluation function value stopFitness, the number of times of calling the evaluation function reaches the maximum number of times of calling stopExval, or the variation amplitude of the continuous nLimit generation of the evaluation function is less than tolerance, entering step 5.8.
Otherwise, recording the minimum evaluation function value of the current populationAnd best mask code bestX: if the minimum evaluation function value of the current populationIf the current minimum evaluation function value tmpBestF is less than the current minimum evaluation function value tmpBestF, the current minimum evaluation function value tmpBestF is updated to the minimum evaluation function value of the current populationUpdating the best mask code bestX to the best individual of the current populationOtherwise, the current minimum evaluation function value tmpBestF remains unchanged, the best mask code bestX remains unchanged, and the process returns to step 5.3.
5.8, terminating the optimization process, and outputting the optimal binary mask pattern M according to the optimal mask code bestX decodingB。
Compared with the prior art, the invention has the following advantages:
the method approximates the covariance matrix representing the solution space distribution to a set of a simple model only consisting of two evolution paths, learns the main solution search direction and variable correlation by means of low-rank approximation of the covariance matrix, adaptively adjusts the search step length, avoids time-consuming eigenvalue decomposition operation of a large covariance matrix by adopting an efficient solution vector generation mode, can realize optimization of high-dimensional variables in reverse photoetching without learning among large groups of individuals, improves the convergence efficiency and the optimization searching capability, and effectively improves the photoetching imaging quality and the process robustness.
Drawings
FIG. 1 is a schematic diagram of a target mask pattern used in the present invention
FIG. 2 is a schematic diagram of a photoresist pattern produced under different process conditions using an initial mask pattern according to the present invention
FIG. 3 is a schematic diagram of a mask pattern optimized by the method of the present invention
FIG. 4 is a schematic diagram of a mask pattern obtained by optimizing the SL-PSO algorithm
FIG. 5 is a schematic diagram of a photoresist pattern produced under different process conditions using an optimized mask pattern of the present invention
FIG. 6 is a schematic diagram of a photoresist pattern generated under different process conditions using a mask pattern optimized by the SL-PSO algorithm
FIG. 7 is a schematic diagram comparing the convergence curves of reverse photolithography using the method of the present invention and SL-PSO algorithm
FIG. 8 is a flow chart of reverse photolithography using the method of the present invention
Detailed Description
The present invention will be further described with reference to the following examples and drawings, but the present invention should not be limited by these examples. FIG. 1 is a diagram of a target mask pattern used in the present invention, the mask pattern size is 1215nm, which includes 405X 405 pixels, and the feature size is 45 nm. The mask pattern is a binary mask satisfying both horizontal axis symmetry and vertical axis symmetry, and has a white region transmittance of 1 and a black region transmittance of 0.
The invention provides a curve type reverse photoetching method based on a rapid covariance matrix self-adaptive evolution strategy, which comprises the following steps:
1. initializing light source pattern J0Pupil function H0Photoresist sensitivity alpha and photoresist threshold trMask threshold tmDeveloping threshold tdevThe value of the exposure dose deviation and the corresponding weight, and the value of the defocus amount and the corresponding weight.
In the present embodiment, the illumination wavelength of the lithography machine is 193.368nm, and the partial coherence factor sigma is adoptedin=0.7、σoutThe ring light source is 0.9, the polarization type of the light source is tPol, the numerical aperture NA of the projection objective is 1.35, the zoom magnification R is 4, and the refractive index of the immersion liquid is 1.44. T is 3, the exposure dose deviation T has 3 values { -10%, 0, 10% }, the corresponding weights are {1.5,1,1.5}, H is 2, the defocus amount H has values {0nm, 60nm }, and the corresponding weights are {1,1.1}, respectively. Initializing a light source graph J according to the value of the defocusing amount h0And pupil function H0The TCC kernel corresponding to the defocus amount h in the Hopkins imaging model is calculated in advance, and the first 10 TCC kernels are reserved, i.e., the number of TCC kernels is K10.
2. Initializing mask pattern M0A target pattern TP formed by initializing a mask pattern M0Obtaining a mask code xM。
Initializing mask pattern M0Has a size of 405X 405, i.e. NV=NH405. Setting initialization mask pattern M0The transmittance of the upper light-transmitting pixel is 1, and the transmittance of the light-shielding pixel is 0. Initializing target pattern TP ═ M0。
The mask pattern coding mode is selected according to the symmetry of the mask pattern, and common mask patterns comprise an asymmetric mask pattern and an axisymmetric mask pattern.
When the mask pattern M is initialized0When the mask pattern is asymmetric, it is formed by columnsPoint-by-point scanning initialization mask pattern M0And carrying out mask coding by using all pixel values obtained by scanning:
xM=(M0(1,1),…,M0(NV,1),…,M0(i,j),…,M0(1,NH),…,M0(NV,NH)).
wherein M is0(i, j) represents the initialization mask pattern M0(ii) a mask pixel transmittance at the middle index position of (i, j),and i is more than or equal to 1 and less than or equal to NV,And j is more than or equal to 1 and less than or equal to NH,M0(i, j) is e {0,1}, and the variable dimension DM=NV×NH。
When the mask pattern M is initialized0When the horizontal axis symmetry and the vertical axis symmetry are satisfied simultaneously, the initialization mask pattern M is scanned column by column point0Middle row number range from 1 to NHVColumn number ranging from 1 to NHHThe sub-block of (2) is mask-encoded using the pixel values obtained by the scanning:
xM=(M0(1,1),…,M0(NHV,1),…,M0(i,j),…,M0(1,NHH),…,M0(NHV,NHH)).
wherein NHV=(1+NV)/2,NHH=(1+NH)/2,M0(i, j) represents the initialization mask pattern M0(ii) a mask pixel transmittance at the middle index position of (i, j),and i is more than or equal to 1 and less than or equal to NHV,And j is more than or equal to 1 and less than or equal to NHH,M0(i, j) is e {0,1}, and the variable dimension DM=NHV×NHH。
Mask patterns that satisfy only horizontal axis symmetry or only vertical axis symmetry may be encoded in a similar manner and will not be described in detail herein. 3. Coding x according to a maskMDecoding is carried out, and a binary mask M is obtained by mask filtering and binarization processingB。
The mask pattern decoding method is selected according to the symmetry of the mask pattern.
When the mask pattern M is initialized0When the mask pattern is asymmetric, the expression is usedCoding a mask xMIs arranged to be N in sizeV×NHThe matrix M of (a).
When the mask pattern M is initialized0When the horizontal axis symmetry and the vertical axis symmetry are simultaneously satisfied, the expression is utilizedCoding a mask xMIs finished into NHV×NHHSub-block M ofqUsing subblock MqFilling size of NV×NHThe line number range of the mask pattern M with the element values all being 0 is 1 to NHVColumn number ranging from 1 to NHHPart (c) of (a). According to sub-block MqNH th of mask patterns M, respectivelyVRow and NH thHAnd (4) listing as a symmetry axis, carrying out symmetric assignment on other elements in the mask pattern M, and dividing the value of the element on the corresponding symmetry axis by 2 after each symmetric assignment is finished to obtain the symmetric mask pattern M.
Whether the mask pattern is symmetrical or not, the complexity of the mask pattern can be reduced by a mask filtering method or a regularization method, thereby improving the manufacturability of the mask pattern. The invention adopts Gaussian filtering processing to the mask pattern to obtain the fuzzified mask pattern Mblur,
Wherein,representing the convolution symbol, r0Represents the center position, | | r-r0I represents point r to point r0Distance of (a)GFIs the standard deviation of the gaussian function and Ω represents the number of elements contained in the gaussian convolution kernel. In this embodiment, the Gaussian convolution kernel is a 21 × 21 matrix, σGF=18nm。
Using a mask threshold tmBlurred mask pattern MblurBinary processing is carried out to obtain a decoded binary mask MBI.e. MB=Γ(Mblur-tm)。Γ(x)={1|x≥0∪0|x<0} and the function Γ (x) will be MblurMiddle transmittance is greater than or equal to mask threshold tmAssigns M to 1blurMedium transmittance less than mask threshold tmThe pixel of (a) is assigned a value of 0.
Mask patterns that satisfy only horizontal axis symmetry or vertical axis symmetry can be decoded in a similar manner and will not be described in detail here. 4. Constructing an evaluation function of a reverse lithography problem
And taking weighted superposition of graphic errors between the photoresist graph and the target graph under different exposure dose deviations and defocus conditions as an evaluation function. The specific calculation process of the evaluation function is as follows:
4.1 decoding the mask xMBinary mask M obtained by decodingBSubstituting the space image into a Hopkins imaging model, calculating an aerial image AI when the defocusing amount is h,
wherein,is a binary mask MBThe mask diffraction spectrum calculated by fourier transform, (x, y) is the spatial coordinates of the mask pattern, and (f ', g') is the normalized spatial frequency coordinates of the mask diffraction spectrum. Phii(f ', g'; h) representsIth frequency domain TCC kernel S when defocus is hiAnd the coefficient corresponding to the ith TCC core is shared by K-10 TCC cores. IFFT { } denotes an inverse fourier transform.
4.2 calculating the photoresist image RI when the defocusing amount is h and the exposure dose deviation is t according to the space image AI and the sigmoid photoresist model,
where α is the photoresist sensitivity, trIs the photoresist threshold. Besides the sigmoid photoresist model, a constant threshold photoresist model, a variable threshold photoresist model, a three-dimensional photoresist model and the like can be selected according to actual needs.
4.3 in the Positive developing process, if the RI of the photoresist image is greater than or equal to the developing threshold tdevThen the photoresist at that location is removed; conversely, if the photoresist image RI is less than the development threshold tdevThe photoresist at that location is retained. Thus, a developed resist pattern RC is obtained, that is, RC (x, y; h, t) ═ Γ (RI (x, y; h, t) -tdev)。
4.4 constructing an evaluation function f by utilizing the weighted superposition of the graphic errors between the photoresist graph and the target graph under the conditions of different exposure dose deviations t and defocus amounts h,
5. optimizing mask patterns using fast covariance matrix adaptive evolution strategy
5.1 initializing the evolution algebra g of the fast covariance matrix self-adaptive evolution strategy, the current minimum evaluation function value tmpBestF, the optimal mask code bestX, the population mean vector m, the search step sigma, the search step adjustment factor s, the evolution path P of the covariance matrix, periodically storing and updating the low-rank matrix P of the evolution path, the iteration termination condition of the optimization process and the like.
The variable dimension N of the optimization problem is an important parameterAnd calculating a plurality of parameters in the fast covariance matrix adaptive evolution strategy according to N. In a reverse lithography method, the optimization variable dimension N ═ DM. The initial evolution algebra g is 0 and the current minimum evaluation function value tmpBestF is set to a larger value, in this embodiment 106Using a mask code x corresponding to the target pattern TPMInitializing best mask code bestX and population mean vector m(0)Initial search step size σ(0)Set to one third of the variable interval length, taken as 0.33 in this example, the search step adjustment factor is initialized to s (0)0. The evolution path of the covariance matrix is initialized to p(0)The low rank matrix is initialized to P0.
In addition, the iteration termination condition of the reverse lithography includes: the minimum value of the evaluation function stopFitness, the maximum calling times of the evaluation function stopExval, and the variation range of the evaluation function values in the continuous iteration process is too small (the variation range of continuous nLimit generations is smaller than tolerance). In this embodiment, stopperiod is 200, stopinterval 15000, nLimit 100, and tolerance 10.
5.2 setting relevant parameters of the fast covariance matrix adaptive evolution strategy:
the weight corresponding to the ith individual in the recombination is:satisfy omega1≥…≥ωμIs not less than 0 and
cumulative time constant of covariance matrix evolution path: c is 2/(N +5).
cumulative time constant of search step: c. Cσ=0.3.
Target rate of search step adjustment: q. q.s*=0.27.
Searching for damping factor of step adjustment: dσ=1.
The number of search directions contained in the low rank matrix is: n ═ λ.
Algebraic interval of low rank matrix update: Δ g ═ 50.
5.3 Normal distribution according to the StandardCovariance matrix evolution path p of current generation (g generation)(g)Current low rank matrix P(g)Generating random mutation, combining with population mean vector m of current generation(g)Generating candidate solutions of the next generation (g +1 th generation), each candidate solution corresponding to a mask code, the steps are as follows:
5.3.1 random mutations were generated for the ith individual,wherein Is a low rank matrix P(g)Ith column in (1), corresponding to low rank matrix P(g)The ith search direction of (1).
5.3.2 population mean vector m in combination with the current generation(g)Random mutation with the i-th individual to generate the i-th individual of the next generation
5.4 updating the mean vector
After the evaluation function values of lambda individuals in the g +1 th generation population are arranged in ascending order, the individuals corresponding to the evaluation function values in the ith position are sorted, namelyf denotes the evaluation function constructed in step 4.4, which is to be called individually each timeDecoding as mask code to obtain binary mask MB. Selecting the first mu individuals with the minimum fitness value in the g +1 generation for recombination to generate a mean vector of the g +1 generationThe updated mean may be considered a weighted maximum likelihood estimate of the population distribution mean.
5.5 updating the evolution Path and Low rank matrix by cumulative learning
The evolution path cumulatively learns the continuous movement of the distribution mean in the iterative process, as shown in the following formula:
the evolutionary path cumulatively learns successive search directions in the iterative process, reducing oscillations between these search directions. The opposite search directions cancel out and the consistent direction is accumulated into the evolution path. Thus, the current evolutionary path represents one of the most potential search directions.
Every time a fixed algebra delta g is passed, the earliest searching direction in the low-rank matrix P is replaced by the current evolution path, and in other algebras, the low-rank matrix P of the previous generation is directly used, namely
if g%Δg=0,P(g+1)=P(g).
5.6 Using sort-based success rules for step size adjustment
Respectively extracting the minimum mu evaluation function values F of the g generation and the g +1 generation(g)And F(g+1)The union of the two is F ═ F(g)∪F(g+1). Then the union set F is arranged in ascending order to obtain Fmix. Calculating the difference of the two generations of populations by comparing the weighted rank sums of the two adjacent generations of populations: andthe ith-smallest evaluation function of the g-th generation and the g +1 th generation, respectively, is expressed in FmixThe order in (1). In an iterative process by means of a target rate q*Q is smoothed to eliminate randomness. Updating the search step adjustment factor to s(g+1)=(1-cσ)s(g)+cσ(q-q*) The search step is updated to σ(g+1)=σ(g)·exp(s(g+1)/dσ)。
5.7 judging the iteration termination condition
And if the minimum evaluation function value of the current population is less than the minimum evaluation function value stopFitness, the number of times of calling the evaluation function reaches the maximum number of times of calling stopExval, or the variation amplitude of the continuous nLimit generation of the evaluation function is less than tolerance, entering step 5.8.
Otherwise, recording the minimum evaluation function value of the current populationAnd best mask code bestX: if the minimum evaluation function value of the current populationIf the current minimum evaluation function value tmpBestF is less than the current minimum evaluation function value tmpBestF, the current minimum evaluation function value tmpBestF is updated to the minimum evaluation function value of the current populationUpdating the best mask code bestX to the best individual of the current populationOtherwise, the current minimum evaluation function value tmpBestF remains unchanged, the best mask code bestX remains unchanged, and the process returns to step 5.3.
5.8 terminate the optimization process and output the optimal binary mask pattern M according to the optimal mask code bestX decodingB。
FIG. 2 is a schematic diagram of a photoresist pattern generated under different process conditions by using an initial mask pattern, wherein when the mask is not optimized, the photoresist pattern under different process conditions has an obvious difference from a target pattern, and the pattern fidelity is poor. FIG. 3 is a schematic diagram of a mask pattern obtained by optimization according to the method of the present invention, in which an auxiliary pattern is generated in a pattern sparse region, the main pattern and the auxiliary pattern after optimization have smooth contours, and no excessively small pattern width or pattern interval exists. The SL-PSO algorithm shows better optimization performance in the mask optimization problem, so that the reverse photoetching method provided by the invention is compared with the reverse photoetching method based on the SL-PSO algorithm. The relevant parameters of the SL-PSO algorithm are set as follows: stopperiod ═ 200, stoperval ═ 60000, nLimit ═ 50, tolerance ═ 10, and population size nPop ═ 306. Apart from the differences in these parameters, the other conditions of both reverse lithographic methods are unchanged. FIG. 4 is a schematic diagram of a mask pattern obtained by optimization using the SL-PSO algorithm. Obviously, the reverse photoetching method based on the SL-PSO algorithm does not generate auxiliary patterns in sparse areas like the method of the invention, but adjusts the outline of the main pattern. FIGS. 5 and 6 are schematic diagrams of photoresist patterns generated under different process conditions by using the mask pattern optimized by the SL-PSO algorithm and the method of the present invention, respectively. Obviously, the result of reverse photoetching by adopting the method of the invention shows better process robustness. Comparing fig. 5(c) with fig. 6(c), it can be found that the reverse photolithography method based on the SL-PSO algorithm causes the soft bridging phenomenon at the line end when the exposure dose is large, but the method of the present invention does not have such a problem. Comparing fig. 5(d) with fig. 6(d), it can be found that the reverse photolithography method based on the SL-PSO algorithm can cause an obvious soft shrinkage phenomenon when the exposure dose is small and the defocus is out of focus, and there is a risk of pattern fracture. Fig. 7 is a schematic diagram comparing the convergence curves of the reverse photolithography by using the method of the present invention and the SL-PSO algorithm, and it can be seen that the method of the present invention reaches convergence after 12670 times of evaluation function calls, and terminates iteration, the final evaluation function value is 5307.31, and the whole process takes 547.92 s. In contrast, the reverse photolithography method based on the SL-PSO algorithm still does not converge after 60000 evaluation function calls, the final evaluation function value is 5965.61, and the whole process takes 2804.16 s. The reverse lithography method based on the SL-PSO algorithm has larger evaluation function values compared with the method of the invention, which is consistent with the comparison results of FIG. 5 and FIG. 6. The method has the advantages of less number of times of calling the evaluation function required by convergence, shorter running time and smaller final evaluation function value, which shows that the optimization performance of the method is better, the convergence speed is higher, and the photoetching imaging quality and the process robustness are effectively improved. FIG. 8 is a flow chart of reverse photolithography using the method of the present invention.
In addition, the method can be expanded to the computing lithography technologies such as Source Mask Optimization (SMO), Source Mask projection objective joint Optimization (SMPO) and the like, and the lithography imaging quality is further improved by increasing the Optimization degree of freedom.
The present embodiment and the accompanying drawings are only for describing the specific implementation method of the present invention, and are not to be construed as limiting the present invention, and the present invention may have other various embodiments. Various corresponding changes, substitutions and alterations can be made herein by those skilled in the art without departing from the spirit and scope of the invention, and it is intended that all such changes, substitutions and alterations be considered as within the scope of the appended claims.
Claims (2)
1. A curve type reverse photoetching method based on a rapid covariance matrix self-adaptive evolution strategy is characterized by comprising the following specific steps:
step 1, initializing light source graph J0Pupil function H0Photoresist sensitivity alpha and photoresist threshold trMask threshold tmDeveloping threshold tdevThe value of the exposure dose deviation and the corresponding weight, the value of the defocus amount and the corresponding weight;
initializing T values of exposure dose deviation T, wherein the corresponding weight is ptInitializing H values of defocus H, and setting the corresponding weight as ph(ii) a Initializing a light source graph J according to the value of the defocusing amount h0And pupil function H0Calculating TCC (TCC) cores corresponding to the defocusing amount h in the Hopkins imaging model in advance, wherein TCC (Transmission Cross coefficient) represents a transmission Cross coefficient, and reserving the first K TCC cores;
step 2. initialize mask pattern M0A target pattern TP formed by initializing a mask pattern M0Obtaining a mask code xM:
Setting initialization mask pattern M0Is NV×NHWherein N isVAnd NHRespectively representing initialization mask patterns M0The number of elements contained in each column and each row is odd; setting initialization mask pattern M0The transmittance of the upper light-transmitting pixel is 1, and the transmittance of the light-shielding pixel is 0; initializing target pattern TP ═ M0;
When the mask pattern M is initialized0For asymmetric mask pattern, the initial mask pattern M is scanned column by column point0And carrying out mask coding by using all pixel values obtained by scanning:
xM=(M0(1,1),…,M0(NV,1),…,M0(i,j),…,M0(1,NH),…,M0(NV,NH))
wherein M is0(i, j) represents the initialization mask pattern M0(ii) a mask pixel transmittance at the middle index position of (i, j),and i is more than or equal to 1 and less than or equal to NV,And j is more than or equal to 1 and less than or equal to NH,M0(i, j) is e {0,1}, and the variable dimension DM=NV×NH;
When the mask pattern M is initialized0When the horizontal axis symmetry and the vertical axis symmetry are satisfied simultaneously, the initialization mask pattern M is scanned column by column point0Middle row number range from 1 to NHVColumn number ranging from 1 to NHHThe sub-block of (2) is mask-encoded using the pixel values obtained by the scanning:
xM=(M0(1,1),…,M0(NHV,1),…,M0(i,j),…,M0(1,NHH),…,M0(NHV,NHH))
wherein NHV=(1+NV)/2,NHH=(1+NH)/2,M0(i, j) represents the initialization mask pattern M0(ii) a mask pixel transmittance at the middle index position of (i, j),and i is more than or equal to 1 and less than or equal to NHV,And j is more than or equal to 1 and less than or equal to NHH,M0(i, j) is e {0,1}, and the variable dimension DM=NHV×NHH;
Step 3. encode x according to the maskMDecoding is carried out by means of mask filtering and binarizationThen, a decoded binary mask M is obtainedB:
When the mask pattern M is initialized0When the mask pattern is asymmetric, the expression is usedCoding a mask xMIs arranged to be N in sizeV×NHA matrix M of (A);
when the mask pattern M is initialized0When the horizontal axis symmetry and the vertical axis symmetry are simultaneously satisfied, the expression is utilizedCoding a mask xMIs finished into NHV×NHHSub-block M ofqUsing subblock MqFilling size of NV×NHThe line number range of the mask pattern M with the element values all being 0 is 1 to NHVColumn number ranging from 1 to NHHA moiety of (a); according to sub-block MqNH th of mask patterns M, respectivelyVRow and NH thHArranging the mask pattern M as a symmetry axis, symmetrically assigning other elements in the mask pattern M, and dividing the value of the element on the corresponding symmetry axis by 2 after each symmetric assignment is finished to obtain a symmetric mask pattern M;
adopting Gaussian filtering processing to the mask pattern to obtain the fuzzified mask pattern MblurThe formula is as follows:
wherein,representing the convolution symbol, r0Represents the center position, | | r-r0I represents point r to point r0Distance of (a)GFIs the standard deviation of the gaussian function, Ω represents the number of elements contained in the gaussian convolution kernel;
using a mask threshold tmMatched mouldPasted mask pattern MblurBinary processing is carried out to obtain a decoded binary mask MBThe formula is as follows:
MB=Γ(Mblur-tm);
wherein the function Γ (x) means that M is represented byblurMiddle transmittance is greater than or equal to mask threshold tmAssigns M to 1blurMedium transmittance less than mask threshold tmIs assigned a value of 0, i.e. Γ (x) ═ 1| x ≧ 0| x<0};
And 4, constructing an evaluation function of the reverse photoetching problem by weighted superposition of graphic errors between the photoresist graphic and the target graphic under different exposure dose deviations and defocus conditions:
step 4.1 decode the mask xMBinary mask M obtained by decodingBSubstituting the space image into a Hopkins imaging model, calculating an aerial image AI when the defocusing amount is h,
wherein,is a binary mask MBThe mask diffraction spectrum obtained by Fourier transform calculation, (x, y) is the space coordinate of the mask pattern, and (f ', g') is the normalized space frequency coordinate of the mask diffraction spectrum; phii(f ', g'; h) denotes the ith frequency domain TCC kernel, S, with defocus hiThe coefficient corresponding to the ith TCC core is shared by K TCC cores; IFFT { } denotes inverse fourier transform;
step 4.2, calculating the photoresist image RI when the defocusing amount is h and the exposure dose deviation is t according to the space image AI and the sigmoid photoresist model,
where α is the photoresist sensitivity, trIs the photoresist threshold;
step 4.3 in the Positive tone development Process, if the resist image RI is greater than or equal to the development threshold tdevThen the photoresist at that location is removed; conversely, if the photoresist image RI is less than the development threshold tdevThen the photoresist at that location is retained; thus, a developed resist pattern RC is obtained, that is, RC (x, y; h, t) ═ Γ (RI (x, y; h, t) -tdev);
Step 4.4, an evaluation function f is constructed by utilizing the weighted superposition of the graphic errors between the photoresist graph and the target graph under the conditions of different exposure dose deviations t and defocus h,
and 5, optimizing a mask graph by adopting a rapid covariance matrix adaptive evolution strategy:
step 5.1, initializing an evolution algebra g of a fast covariance matrix self-adaptive evolution strategy, a current minimum evaluation function value tmpBestF, an optimal mask code bestX, a population mean vector m, a search step sigma, a search step adjustment factor s, an evolution path P of a covariance matrix, a low-rank matrix P for periodically storing and updating the evolution path, an iteration termination condition of an optimization process and the like;
in a reverse lithography method, the optimization variable dimension N ═ DMThe initial evolution algebra g is 0, the current minimum evaluation function value tmpBestF is set to a larger value, and the mask code x corresponding to the target pattern TP is usedMInitializing best mask code bestX and population mean vector m(0)Initial search step size σ(0)Setting the length of the variable interval to be one third, and initializing a search step length adjustment factor to be s(0)0; the evolution path of the covariance matrix is initialized to p(0)Initializing the low-rank matrix to be P-0;
setting a minimum value stopFittness of an evaluation function, a maximum calling time stoperval of the evaluation function, wherein the variation amplitude of the evaluation function value in the continuous nLimit generation is smaller than tolerance;
step 5.2, setting relevant parameters of the fast covariance matrix adaptive evolution strategy:
the weight corresponding to the ith individual in the recombination is:satisfy omega1≥…≥ωμIs not less than 0 and
cumulative time constant of covariance matrix evolution path: c 2/(N +5)
cumulative time constant of search step: c. Cσ=0.3
Target rate of search step adjustment: q. q.s*=0.27
Searching for damping factor of step adjustment: dσ=1
The number of search directions contained in the low rank matrix is: n ═ λ
Algebraic interval of low rank matrix update: Δ g-50
Step 5.3 Normal distribution according to the StandardCovariance matrix evolution path p of current generation (g generation)(g)Current low rank matrix P(g)Generating random mutation, combining with population mean vector m of current generation(g)Generating candidate solutions of the next generation (g +1 th generation), each candidate solution corresponding to a mask code, the steps are as follows:
step 5.3.1 random mutations were generated for the ith individual,wherein Is a low rank matrix P(g)Ith column in (1), corresponding to low rank matrix P(g)The ith search direction of (a);
step 5.3.2 combine the population mean vector m of the current generation(g)Random mutation with the i-th individual to generate the i-th individual of the next generation
Step 5.4 update the mean vector
After the evaluation function values of lambda individuals in the g +1 th generation population are arranged in ascending order, the individuals corresponding to the evaluation function values in the ith position are sorted, namelyf denotes the evaluation function constructed in step 4.4, which is to be called individually each timeDecoding as mask code to obtain binary mask MB(ii) a Selecting the g +1 th generationRecombining the first mu individuals with the minimum medium fitness value to generate a mean vector of the g +1 th generationThe updated mean value can be regarded as the weighted maximum likelihood estimation of the population distribution mean value;
step 5.5 update the evolution path and the low rank matrix by cumulative learning
The evolution path cumulatively learns the continuous movement of the distribution mean in the iterative process, as shown in the following formula:
every time a fixed algebra delta g is passed, the earliest searching direction in the low-rank matrix P is replaced by the current evolution path, and in other algebras, the low-rank matrix P of the previous generation is directly used, namely
Step 5.6 Using success rules based on ranking to make step size adjustments
Respectively extracting the minimum mu evaluation function values F of the g generation and the g +1 generation(g)And F(g+1)The union of the two is F ═ F(g)∪F(g+1)(ii) a Then the union set F is arranged in ascending order to obtain Fmix;
Calculating the difference of the two generations of populations by comparing the weighted rank sums of the two adjacent generations of populations: andthe ith-smallest evaluation function of the g-th generation and the g +1 th generation, respectively, is expressed in FmixThe ordering of (1); in an iterative process by means of a target rate q*Smoothing q, thereby eliminating randomness;
updating the search step adjustment factor to s(g+1)=(1-cσ)s(g)+cσ(q-q*) The search step is updated to σ(g+1)=σ(g)·exp(s(g+1)/dσ);
Step 5.7 judging iteration termination conditions
If the minimum evaluation function value of the current population is less than the minimum evaluation function value stopFitness, the number of times of calling the evaluation function reaches the maximum number of times of calling stopExval or the variation amplitude of the continuous nLimit generation of the evaluation function is less than tolerance, entering step 5.8;
otherwise, recording the minimum evaluation function value of the current populationAnd best mask code bestX: i.e. the minimum evaluation function value of the current populationIf the current minimum evaluation function value tmpBestF is less than the current minimum evaluation function value tmpBestF, the current minimum evaluation function value tmpBestF is updated to the minimum evaluation function value of the current populationUpdating the best mask code bestX to the best individual of the current populationOtherwise, keeping the current minimum evaluation function value tmpBestF unchanged, keeping the optimal mask code bestX unchanged, and returning to the step 5.3;
step 5.8 terminate the optimization process, outputting the optimal binary mask pattern M according to the optimal mask code bestX decodingB。
2. The curvilinear reverse photoetching method based on the fast covariance matrix adaptive evolution strategy according to claim 1, wherein a constant threshold photoresist model, a variable threshold photoresist model and a three-dimensional photoresist model are selected according to actual needs to replace the sigmoid photoresist model in step 4.2.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110761169.9A CN113568278B (en) | 2021-07-06 | 2021-07-06 | Curve type reverse photoetching method based on rapid covariance matrix self-adaptive evolution strategy |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110761169.9A CN113568278B (en) | 2021-07-06 | 2021-07-06 | Curve type reverse photoetching method based on rapid covariance matrix self-adaptive evolution strategy |
Publications (2)
Publication Number | Publication Date |
---|---|
CN113568278A true CN113568278A (en) | 2021-10-29 |
CN113568278B CN113568278B (en) | 2022-06-28 |
Family
ID=78163764
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202110761169.9A Active CN113568278B (en) | 2021-07-06 | 2021-07-06 | Curve type reverse photoetching method based on rapid covariance matrix self-adaptive evolution strategy |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN113568278B (en) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN114488719A (en) * | 2022-02-23 | 2022-05-13 | 武汉大学 | OPC method based on three-dimensional feature reinforcement |
CN116841135A (en) * | 2023-08-31 | 2023-10-03 | 光科芯图(北京)科技有限公司 | Mask pattern optimization method, mask pattern optimization device, exposure equipment and storage medium |
WO2023193428A1 (en) * | 2022-04-08 | 2023-10-12 | 中国科学院光电技术研究所 | Pixelation optical proximity correction method and system applied to super-resolution photolithography |
CN117350231A (en) * | 2023-12-05 | 2024-01-05 | 武汉宇微光学软件有限公司 | Method and system for adjusting optimal edge movement step length of reverse photomask |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104133348A (en) * | 2014-08-07 | 2014-11-05 | 北京理工大学 | Light source optimization method for adaptive photoetching system |
US20150227671A1 (en) * | 2014-02-13 | 2015-08-13 | Taiwan Semiconductor Manufacturing Company, Ltd. | Method For Integrated Circuit Mask Patterning |
CN105573066A (en) * | 2016-02-03 | 2016-05-11 | 中国科学院上海光学精密机械研究所 | Mask optimization method of photoetching machine |
CN109634068A (en) * | 2019-01-29 | 2019-04-16 | 北京理工大学 | Light source-mask batch optimization method that defocus low sensitivity, process window enhance |
CN110445951A (en) * | 2018-05-02 | 2019-11-12 | 腾讯科技(深圳)有限公司 | Filtering method and device, storage medium, the electronic device of video |
CN111781804A (en) * | 2020-07-16 | 2020-10-16 | 中国科学院上海光学精密机械研究所 | Light source mask optimization method based on covariance matrix adaptive evolution strategy algorithm |
-
2021
- 2021-07-06 CN CN202110761169.9A patent/CN113568278B/en active Active
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20150227671A1 (en) * | 2014-02-13 | 2015-08-13 | Taiwan Semiconductor Manufacturing Company, Ltd. | Method For Integrated Circuit Mask Patterning |
CN104133348A (en) * | 2014-08-07 | 2014-11-05 | 北京理工大学 | Light source optimization method for adaptive photoetching system |
CN105573066A (en) * | 2016-02-03 | 2016-05-11 | 中国科学院上海光学精密机械研究所 | Mask optimization method of photoetching machine |
CN110445951A (en) * | 2018-05-02 | 2019-11-12 | 腾讯科技(深圳)有限公司 | Filtering method and device, storage medium, the electronic device of video |
CN109634068A (en) * | 2019-01-29 | 2019-04-16 | 北京理工大学 | Light source-mask batch optimization method that defocus low sensitivity, process window enhance |
CN111781804A (en) * | 2020-07-16 | 2020-10-16 | 中国科学院上海光学精密机械研究所 | Light source mask optimization method based on covariance matrix adaptive evolution strategy algorithm |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN114488719A (en) * | 2022-02-23 | 2022-05-13 | 武汉大学 | OPC method based on three-dimensional feature reinforcement |
CN114488719B (en) * | 2022-02-23 | 2023-11-21 | 武汉大学 | OPC method based on three-dimensional feature reinforcement |
WO2023193428A1 (en) * | 2022-04-08 | 2023-10-12 | 中国科学院光电技术研究所 | Pixelation optical proximity correction method and system applied to super-resolution photolithography |
CN116841135A (en) * | 2023-08-31 | 2023-10-03 | 光科芯图(北京)科技有限公司 | Mask pattern optimization method, mask pattern optimization device, exposure equipment and storage medium |
CN116841135B (en) * | 2023-08-31 | 2023-10-31 | 光科芯图(北京)科技有限公司 | Mask pattern optimization method, mask pattern optimization device, exposure equipment and storage medium |
CN117350231A (en) * | 2023-12-05 | 2024-01-05 | 武汉宇微光学软件有限公司 | Method and system for adjusting optimal edge movement step length of reverse photomask |
CN117350231B (en) * | 2023-12-05 | 2024-02-20 | 武汉宇微光学软件有限公司 | Method and system for adjusting optimal edge movement step length of reverse photomask |
Also Published As
Publication number | Publication date |
---|---|
CN113568278B (en) | 2022-06-28 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN113568278B (en) | Curve type reverse photoetching method based on rapid covariance matrix self-adaptive evolution strategy | |
CN111781804B (en) | Light source mask optimization method based on covariance matrix adaptive evolution strategy algorithm | |
CN101297390B (en) | Systems, masks, and methods for photolithography | |
CN109634068B (en) | Light source-mask batch optimization method with defocusing low sensitivity and enhanced process window | |
US20070192756A1 (en) | Method for Time-Evolving Rectilinear Contours Representing Photo Masks | |
CN106796668A (en) | For the method and system that bit-depth in artificial neural network is reduced | |
CN117348356A (en) | Simulating near field images in optical lithography | |
CN106125511B (en) | Low error suseptibility multiple target source mask optimization method based on vector imaging model | |
CN113759657A (en) | Optical proximity correction method | |
CN110187609B (en) | Deep learning method for calculating photoetching | |
CN113589643B (en) | Curve type reverse photoetching method for synthesizing mask pattern based on superposition of modulation blocks | |
CN110554580A (en) | multi-parameter joint optimization method for photoetching machine | |
CN104133348B (en) | A kind of adaptive optical etching system light source optimization method | |
CN111310407A (en) | Method for designing optimal feature vector of reverse photoetching based on machine learning | |
CN110597023B (en) | Photoetching process resolution enhancement method and device based on multi-objective optimization | |
CN111627799A (en) | Method for manufacturing semiconductor element | |
US11853660B2 (en) | System and method for modeling a semiconductor fabrication process | |
CN114815496B (en) | Pixelated optical proximity effect correction method and system applied to super-resolution lithography | |
US11783110B2 (en) | Method for reticle enhancement technology of a design pattern to be manufactured on a substrate | |
Luo et al. | SVM based layout retargeting for fast and regularized inverse lithography | |
Pang et al. | Optimization from design rules, source and mask, to full chip with a single computational lithography framework: level-set-methods-based inverse lithography technology (ILT) | |
CN113589644A (en) | Curve type reverse photoetching method based on sub-resolution auxiliary graph seed insertion | |
JP2024526504A (en) | Method, apparatus, device and computer program for training a lithography mask generation model | |
KR20230091155A (en) | Methods and Systems for Determining Shapes for Semiconductor or Flat Panel Display Fabrication | |
CN117769681A (en) | Method for a reticle enhancement technique for a design pattern to be fabricated on a substrate |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |