In advanced integrated circuit manufacturing processes, the quality of chemical mechanical flattening is a key factor affecting chip performance and yield. Therefore, it has become increasingly important to develop an accurate predictive model for the chip surface topography after chemical mechanical flattening. In the modeling process, the noise problem of atomic force microscopy measurement data is relatively serious. To solve this problem, the noise characteristics of atomic force microscope measurement data for chip surface topography in this field are studied and discussed in this paper. It is found that the noise present in such problems is mainly triggered by the vibration and tilt of the probe. Two types of noise, low-frequency and high-frequency, are presented in the time domain. In order to solve the noise problem in this modeling data, this paper analyzes the spectral characteristics of the measurement data using Fourier transform, and a wavelet-Fourier transform composite noise reduction process is proposed. The algorithm is applied to the noise reduction of the chip surface data of 32 nm copper interconnect process. The noise reduction results were compared with scanning electron microscope photographs to verify the effectiveness of the noise reduction.
26 February 2024 in IEEE Transactions on Semiconductor Manufacturing
Chemical mechanical polishing/planarization (CMP) combines physical grinding and chemical reactions to planarize the wafer surface. The complex mechanism of CMP brings great challenges to the mechanism-based modeling process. The data-driven CMP modeling process is limited by insufficient datasets. At the same time, these two types of models generally have high computational complexity. In this paper, we introduce the group method of data handling (GMDH)-type polynomial network to build the CMP model to address the above challenges. We designed and manufactured the test chip using a 28nm process. The measurement data from the test chip shows that compared with the mechanism-based CMP model, the trained CMP model based on GMDH-type polynomial network has higher accuracy and lower computational complexity, with the average simulation speed being 115x faster. Experiments based on silicon data show that this modeling method has a small demand for data, and 20 randomly selected sets of data can meet the needs for modeling the current CMP process.
Polygon reconstruction is widely used across various fields. Although the current polygon reconstruction algorithms have achieved near-linear time complexity, they still fail to meet the speed demands imposed by the exponential growth in polygon numbers. The development of GPU technology provides a promising solution to this issue. This paper proposes a GPU-based algorithm that leverages hash tables and memory pools to transform the polygon reconstruction problem into an efficiently parallelizable task. Experimental results on Nvidia RTX 2080Ti demonstrate that the new algorithm achieves 17× and 46× speedups on Manhattan and non-Manhattan polygon test sets, respectively. Compared to traditional CPU algorithms, the new algorithm significantly improves processing speeds, especially when handling layouts with complex polygons. It demonstrates strong scalability and performance advantages, providing crucial support for enhancing the overall efficiency of CAD tools.
Polygon Boolean operations are widely used in integrated circuit (IC) layout processing tasks such as design rule checking (DRC) and optical proximity correction (OPC). Single-threaded Boolean algorithms cannot meet the efficiency demand of modern IC layouts, necessitating parallel algorithms for acceleration. However, existing parallel algorithms exhibit unsatisfactory parallel speedups and limited scalability, which typically stem from an inefficient merging phase that uses generic Boolean OR operations and redundantly reprocesses all edges of polygons on grid boundaries. To solve these problems, we proposed Polygon Tailor, a novel parallel algorithm for polygon Boolean operations that employs a data-parallel strategy and a new merging approach performing incremental XOR operations solely on edges along grid boundaries, eliminating redundant computations in previous methods. This innovation drastically reduces the grid-merging time by 1–2 orders of magnitude. Compared with the parallel implementation from a commercial layout processing tool, PolygonTailor is on average 5.08× faster and up to 14.36× faster for OR operations that generate highly complex polygons.