Recently, a set of gradient-based optical proximity correction (OPC) and phase-shifting mask (PSM) optimization methods has been developed to solve for the inverse lithography problem under scalar imaging models, which are only accurate for numerical apertures (NAs) of less than approximately 0.4. However, as lithography technology enters the 45 nm realm, immersion lithography systems with hyper-NA () are now extensively used in the semiconductor industry. For the hyper-NA lithography systems, the vector nature of the electromagnetic field must be taken into account, leading to the vector imaging models. Thus, the OPC and PSM optimization approaches developed under the scalar imaging models are inadequate to enhance the resolution in immersion lithography systems. This paper focuses on developing pixelated gradient-based OPC and PSM optimization algorithms under a vector imaging model. We first formulate the mask optimization framework, in which the imaging process of the optical lithography system is represented by an integrative and analytic vector imaging model. A gradient-based algorithm is then used to optimize the mask iteratively. Subsequently, a generalized wavelet penalty is proposed to keep a balance between the mask complexity and convergence errors. Finally, a set of methods is exploited to speed up the proposed algorithms.
Optical proximity correction (OPC) methods are resolution enhancement techniques (RET) used extensively in the semiconductor industry to improve the resolution and pattern fidelity of optical lithography. In pixel-based OPC (PBOPC), the mask is divided into small pixels, each of which is modified during the optimization process. Two critical issues in PBOPC are the required computational complexity of the optimization process, and the manufacturability of the optimized mask. Most current OPC optimization methods apply the steepest descent (SD) algorithm to improve image fidelity augmented by regularization penalties to reduce the complexity of the mask. Although simple to implement, the SD algorithm converges slowly. The existing regularization penalties, however, fall short in meeting the mask rule check (MRC) requirements often used in semiconductor manufacturing. This paper focuses on developing OPC optimization algorithms based on the conjugate gradient (CG) method which exhibits much faster convergence than the SD algorithm. The imaging formation process is represented by the Fourier series expansion model which approximates the partially coherent system as a sum of coherent systems. In order to obtain more desirable manufacturability properties of the mask pattern, a MRC penalty is proposed to enlarge the linear size of the sub-resolution assistant features (SRAFs), as well as the distances between the SRAFs and the main body of the mask. Finally, a projection method is developed to further reduce the complexity of the optimized mask pattern.
Liquid crystal tunable filters (LCTF) are extensively used in hyperspectral imaging systems to successively acquire different spectral components of scenes by adjusting the center wavelength of the filter. However, the spectral and spatial resolutions of the imager are limited by the bandwidth of LCTF, and the pitch dimension of the detector, respectively. This paper applies compressive sensing principles to improve both of the spatial and spectral resolutions of the LCTF-based hyperspectral imaging system. An accurate transmission model of the LCTF is used to represent its bandpass filtering effects on the spectra. In addition, a random coded aperture placed behind the LCTF is used to modulate the spectral images in the spatial domain. Then, the three-dimensional encoded spectral images are projected onto a two-dimensional detector. Benefiting from the spectral-dependent transmission property of the LCTF, information of the entire spectrum is collected by a few snapshots using different center wavelengths of the LCTF. Super-resolution hyperspectral images can be reconstructed from a small set of compressive measurements by solving a convex optimization problem. Simulations and experiments show that the proposed method can effectively improve the spectral and spatial resolutions of traditional LCTF-based spectral imager without changing the structures of the LCTF and detector. Finally, a multi-channel spectral coding method is proposed to further increase the compression capacity of the system.
Optical proximity correction (OPC) is an extensively used resolution enhancement technique (RET) in optical lithography. To date, the computational efficiency has become a big issue for pixelated OPC techniques due to the increasing complexity of lithographic masks in modern integrated circuits. This paper is the first to apply nonlinear compressive sensing (CS) theory to break through the computational efficiency of gradient-based pixelated OPC methods. The proposed method reduces the dimensionality of the OPC problem by downsampling the layout pattern. Then, a nonlinear cost function is established to guarantee the lithography imaging performance on the downsampled layout. Under the sparsity assumption of the mask, the OPC problem is formulated as an inverse nonlinear CS reconstruction problem. The iterative hard thresholding (IHT) algorithm is then used to solve for the OPC problem. The proposed method proves to improve the computational efficiency of traditional gradient-based OPC methods, while improving the process windows of the lithography systems. Benefiting from the sparse property of the mask patterns, the mask manufacturability can also be improved compared to traditional methods.
This paper proposes to use the a-priori knowledge of the target layout patterns to design data-adaptive compressive sensing (CS) methods for efficient source optimization (SO) in lithography systems. A set of monitoring pixels are selected from the target layout based on blue noise random patterns. The SO is then formulated as an under-determined linear problem to improve image fidelity according to the monitoring pixels. Adaptive projections are then designed, based on the a-priori knowledge of the target layout, in order to further reduce the dimension of the optimization problem, while trying to retain the SO performance. Different from traditional CS methods, adaptive projections are constructed directly from the target layout data via a nonlinear thresholding operation. Adaptive projections are proved to achieve superior SO performance over the random projections. This paper also studies and compares the impact of different sparse representation bases on the SO performance. It is shown that the discrete cosine transform (DCT), spatial and Haar wavelet bases are good choices for source representation.