US20230298154A1 - Wafer map analyzer, method for analyzing wafer map using the same and method for manufacturing semiconductor device - Google Patents
Wafer map analyzer, method for analyzing wafer map using the same and method for manufacturing semiconductor device Download PDFInfo
- Publication number
- US20230298154A1 US20230298154A1 US18/201,841 US202318201841A US2023298154A1 US 20230298154 A1 US20230298154 A1 US 20230298154A1 US 202318201841 A US202318201841 A US 202318201841A US 2023298154 A1 US2023298154 A1 US 2023298154A1
- Authority
- US
- United States
- Prior art keywords
- wafer
- feature
- wafer map
- features
- code
- 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.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H01—ELECTRIC ELEMENTS
- H01L—SEMICONDUCTOR DEVICES NOT COVERED BY CLASS H10
- H01L22/00—Testing or measuring during manufacture or treatment; Reliability measurements, i.e. testing of parts without further processing to modify the parts as such; Structural arrangements therefor
- H01L22/10—Measuring as part of the manufacturing process
- H01L22/12—Measuring as part of the manufacturing process for structural parameters, e.g. thickness, line width, refractive index, temperature, warp, bond strength, defects, optical inspection, electrical measurement of structural dimensions, metallurgic measurement of diffusions
-
- H—ELECTRICITY
- H01—ELECTRIC ELEMENTS
- H01L—SEMICONDUCTOR DEVICES NOT COVERED BY CLASS H10
- H01L22/00—Testing or measuring during manufacture or treatment; Reliability measurements, i.e. testing of parts without further processing to modify the parts as such; Structural arrangements therefor
- H01L22/30—Structural arrangements specially adapted for testing or measuring during manufacture or treatment, or specially adapted for reliability measurements
- H01L22/32—Additional lead-in metallisation on a device or substrate, e.g. additional pads or pad portions, lines in the scribe line, sacrificed conductors
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/0002—Inspection of images, e.g. flaw detection
- G06T7/0004—Industrial image inspection
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/21—Design or setup of recognition systems or techniques; Extraction of features in feature space; Blind source separation
- G06F18/214—Generating training patterns; Bootstrap methods, e.g. bagging or boosting
- G06F18/2155—Generating training patterns; Bootstrap methods, e.g. bagging or boosting characterised by the incorporation of unlabelled data, e.g. multiple instance learning [MIL], semi-supervised techniques using expectation-maximisation [EM] or naïve labelling
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/23—Clustering techniques
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/24—Classification techniques
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/24—Classification techniques
- G06F18/241—Classification techniques relating to the classification model, e.g. parametric or non-parametric approaches
- G06F18/2413—Classification techniques relating to the classification model, e.g. parametric or non-parametric approaches based on distances to training or reference patterns
- G06F18/24133—Distances to prototypes
- G06F18/24137—Distances to cluster centroïds
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/0002—Inspection of images, e.g. flaw detection
- G06T7/0004—Industrial image inspection
- G06T7/001—Industrial image inspection using an image reference approach
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06V10/00—Arrangements for image or video recognition or understanding
- G06V10/70—Arrangements for image or video recognition or understanding using pattern recognition or machine learning
- G06V10/762—Arrangements for image or video recognition or understanding using pattern recognition or machine learning using clustering, e.g. of similar faces in social networks
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06V10/00—Arrangements for image or video recognition or understanding
- G06V10/70—Arrangements for image or video recognition or understanding using pattern recognition or machine learning
- G06V10/764—Arrangements for image or video recognition or understanding using pattern recognition or machine learning using classification, e.g. of video objects
-
- H—ELECTRICITY
- H01—ELECTRIC ELEMENTS
- H01L—SEMICONDUCTOR DEVICES NOT COVERED BY CLASS H10
- H01L22/00—Testing or measuring during manufacture or treatment; Reliability measurements, i.e. testing of parts without further processing to modify the parts as such; Structural arrangements therefor
- H01L22/10—Measuring as part of the manufacturing process
-
- H—ELECTRICITY
- H01—ELECTRIC ELEMENTS
- H01L—SEMICONDUCTOR DEVICES NOT COVERED BY CLASS H10
- H01L22/00—Testing or measuring during manufacture or treatment; Reliability measurements, i.e. testing of parts without further processing to modify the parts as such; Structural arrangements therefor
- H01L22/20—Sequence of activities consisting of a plurality of measurements, corrections, marking or sorting steps
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2207/00—Indexing scheme for image analysis or image enhancement
- G06T2207/20—Special algorithmic details
- G06T2207/20081—Training; Learning
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2207/00—Indexing scheme for image analysis or image enhancement
- G06T2207/20—Special algorithmic details
- G06T2207/20084—Artificial neural networks [ANN]
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2207/00—Indexing scheme for image analysis or image enhancement
- G06T2207/30—Subject of image; Context of image processing
- G06T2207/30108—Industrial image inspection
- G06T2207/30148—Semiconductor; IC; Wafer
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06V2201/00—Indexing scheme relating to image or video recognition or understanding
- G06V2201/06—Recognition of objects for industrial automation
Definitions
- the present disclosure relates to a wafer map analyzer, a method for analyzing the wafer map using the same, and a method for manufacturing a semiconductor device.
- data of all wafers may be collected in the form of a map of the wafer (a wafer map) because of its nature. Since the patterns of the wafer maps relate to (are connected with) a specific process and a specific facility, various types of analysis may be performed. The reason is that it is possible to detect defects of a specific process or specific facility through characteristics of the wafer map. Therefore, recently, pattern analysis of such a wafer map has been recognized as a method capable of reducing defects and improving the yield in the manufacturing process of the semiconductor device.
- the cost of the semiconductor manufacturing process can be greatly reduced and the yield can be greatly improved with increased accuracy.
- An aspect of the present disclosure provides a method for analyzing a wafer map which reduces cost and increases accuracy.
- Another aspect of the present disclosure provides a wafer map analyzer which reduces cost and increases accuracy.
- Still another aspect of the present disclosure provides a method for manufacturing a semiconductor device which reduces cost and increases accuracy.
- a method for analyzing a wafer map includes generating a first wafer map displaying characteristics of a first wafer for each of multiple channels. The method also includes auto-encoding the first wafer maps of the multiple channels together to extract a first feature, determining whether the first feature is a valid pattern, classifying a type of the first feature based on unsupervised learning when the first feature is a valid pattern, and extracting a representative image of features classified into the same type as the first feature.
- a method for analyzing a wafer map includes generating a first wafer map of a first channel of a first wafer, and a second wafer map of a second channel of the first wafer. The method also includes generating a third wafer map of a first channel of a second wafer, and a fourth wafer map of a second channel of the second wafer.
- the method further includes auto-encoding the first wafer map and second wafer map together to extract a first feature of the first wafer, auto-encoding the third wafer map and fourth wafer map together to extract a second feature of the second wafer, generating a feature group including the first feature and the second feature, excluding invalid features among the features of the feature group from the feature group, clustering the feature group into multiple types based on unsupervised learning, and extracting representative images of the multiple types, respectively.
- a method for analyzing a wafer map includes forming multiple wafer maps for multiple wafers, respectively. The method also includes auto-encoding the multiple wafer maps to extract multiple features corresponding to the multiple wafers, excluding invalid features among the multiple features, classifying valid features among the multiple features into multiple types using unsupervised learning, generating multiple center features corresponding to respective centers of the multiple types, and reconstructing the multiple center features to output a representative image.
- a wafer map analyzer includes a storage device and a processor.
- the storage device stores a wafer map.
- the processor is connected to the storage device and executes instructions to perform a process.
- the processor extracts features from the wafer map, determines validity of the features, clusters the features to classify the features into multiple types, generates a feature having a center value for each of multiple classified types, and reconstructs the feature into a wafer map to generate a representative image of the type.
- the storage device stores the representative image for each type.
- a method for manufacturing a semiconductor device includes manufacturing a first wafer, and forming each of multiple first wafer maps for multiple first wafers.
- the method also includes auto-encoding the multiple first wafer maps to extract multiple features corresponding to the multiple first wafers, classifying the multiple features into multiple types, using unsupervised learning, generating multiple center features corresponding to each center of the multiple types, reconstructing the multiple center features to output a representative image, assigning a code to the representative image and storing the code in the storage device, manufacturing a second wafer in a semiconductor manufacturing facility, generating a second wafer map of the second wafer, and comparing the representative image with the second wafer map to detect defects of the semiconductor manufacturing facility.
- a wafer map analyzer includes a non-volatile memory, a volatile memory, a processor, and a bus.
- the non-volatile memory stores a wafer map and program.
- the program is loaded to the volatile memory.
- the processor executes the program.
- the bus connects the processor, the non-volatile memory and the volatile memory.
- the program includes different executable modules including an auto-encoder, a feature filter, a clustering machine, and a code allocator.
- the auto encoder automatically encodes a wafer map to extract a feature.
- the feature filter determines validity of the feature and excludes the feature when the feature is not valid.
- the clustering machine performs clustering of the feature and generates a center feature of the group according to the clustering.
- the code allocator allocates a code to a representative image corresponding to the center feature and stores the code in the non-volatile memory.
- FIG. 1 is a flowchart illustrating a method for analyzing a wafer map according to some embodiments of the present disclosure
- FIG. 2 is an exemplary view illustrating a wafer map for the method for analyzing the wafer map according to some embodiments of the present disclosure
- FIG. 3 is an exemplary view illustrating using multiple channels for analyzing the wafer map according to some embodiments of the present disclosure
- FIG. 4 is an exemplary conceptual diagram illustrating feature extraction and reconstruction of the wafer map using the multiple channels in the method for analyzing the wafer map according to some embodiments of the present disclosure
- FIG. 5 is an exemplary graph illustrating validity determination of the method for analyzing the wafer map according to some embodiments of the present disclosure
- FIG. 6 is an exemplary graph illustrating validity determination of the method for analyzing the wafer map according to some embodiments of the present disclosure
- FIG. 7 is an exemplary view illustrating clustering for analyzing the wafer map according to some embodiments of the present disclosure
- FIG. 8 is an exemplary conceptual diagram illustrating creation of a representative image for analyzing the wafer map according to some embodiments of the present disclosure
- FIG. 9 is an exemplary conceptual diagram illustrating coding of a representative image for analyzing the wafer map according to some embodiments of the present disclosure.
- FIG. 10 is a flowchart illustrating another method for analyzing the wafer map according to some embodiments of the present disclosure.
- FIG. 11 is a block diagram illustrating a wafer map analyzer according to some embodiments of the present disclosure.
- FIG. 12 is a block diagram illustrating the operation of the wafer map analyzer according to some embodiments of the present disclosure in detail
- FIG. 13 is a flowchart illustrating a method for manufacturing a semiconductor device according to some embodiments of the present disclosure.
- FIG. 14 is a block diagram illustrating a method for manufacturing the semiconductor device according to some embodiments of the present disclosure.
- FIG. 1 is a flowchart illustrating a method for analyzing a wafer map according to some embodiments of the present disclosure.
- FIG. 2 is an exemplary view illustrating a wafer map for the method for analyzing the wafer map according to some embodiments of the present disclosure.
- FIG. 3 is an exemplary view illustrating using multiple channels for analyzing the wafer map according to some embodiments of the present disclosure.
- FIG. 4 is an exemplary conceptual diagram illustrating feature extraction and reconstruction of the wafer map using the multiple channels in the method for analyzing the wafer map according to some embodiments of the present disclosure.
- FIG. 5 is an exemplary graph illustrating validity determination of the method for analyzing the wafer map according to some embodiments of the present disclosure.
- FIG. 1 is a flowchart illustrating a method for analyzing a wafer map according to some embodiments of the present disclosure.
- FIG. 2 is an exemplary view illustrating a wafer map for the method for analyzing the wafer map according to some embodiments of the present disclosure.
- FIG. 6 is an exemplary graph illustrating validity determination of the method for analyzing the wafer map according to some embodiments of the present disclosure.
- FIG. 7 is an exemplary view illustrating clustering for analyzing the wafer map according to some embodiments of the present disclosure.
- FIG. 8 is an exemplary conceptual diagram illustrating creation of a representative image for analyzing the wafer map according to some embodiments of the present disclosure.
- FIG. 9 is an exemplary conceptual diagram illustrating coding of a representative image for analyzing the wafer map according to some embodiments of the present disclosure
- a wafer map is provided (S 100 ).
- the wafer W means a silicon substrate used in the process of manufacturing a semiconductor device.
- a semiconductor device such as a transistor is formed on the surface of the wafer W, and may be separated by the wafer W being diced into multiple chips later.
- FIG. 2 illustrates a configuration in which a single wafer W is diced into units C 1 and C 2 like multiple chips. In a region in which one unit is formed, the characteristics of each unit may be displayed as an image.
- the units C 1 and C 2 may be made up of individual chips, or multiple chips such as blocks of chips in sizes of 2, 4, 8, 16, 32, 64, 128, and so on.
- the sizes of the units C 1 and C 2 and the number of units C 1 and C 2 in the wafer W may change, depending on how many chips and the sizes of the chips used to determine the units C 1 and C 2 .
- the size and number of chips by which the units C 1 and C 2 are determined may vary depending on how finely the characteristics in the wafer W are measured.
- the wafer map may be an image mapped by displaying the characteristics for each of the units C 1 and C 2 in the plan view of the wafer W.
- the units C 1 and C 2 may include a good unit C 1 and a bad unit C 2 .
- the good unit C 1 may mean a unit with good characteristics
- the bad unit C 2 may mean a unit with poor characteristics.
- the good unit C 1 and the bad unit C 2 may be expressed by different brightness, chroma, or color.
- the characteristics of the units C 1 and C 2 may have three or more separate grades.
- each of the units C 1 and C 2 when each of the units C 1 and C 2 is expressed by the first grade to fifth grade, they may be expressed by different brightness, chroma or color. Alternatively, in some embodiments of the present disclosure, they may be expressed in another way other than brightness, chroma or color.
- continuous values rather than discrete values may be expressed in the units C 1 and C 2 of the wafer map.
- the expression of brightness, chroma, color or another characteristic may also be expressed continuously for each of the units C 1 and C 2 of the wafer map.
- multiple wafer maps X may be captured or generated in or for a single wafer. That is, different wafer maps X may be generated according to the respective channels, i.e., of Channel 1 to Channel 4.
- a channel is typically considered a single band of frequencies used in transmissions, but as used herein may refer to processing characteristics of a single continuous space, signals used to capture the characteristics of a single continuous space, or as another reference of a mechanism to capture characteristics of an isolated and continuous portion of a single wafer W.
- reference to multiple different channels herein refers to mechanisms for capturing or generating multiple different wafer maps X for different, non-overlapping portions of the wafer W.
- the wafer maps X different from each other may be generated.
- a first wafer map M 1 may be captured or generated in, for or using the Channel 1
- a second wafer map M 2 may be captured or generated in, for or using the Channel 2.
- a third wafer map M 3 may be captured or generated in, for or using the Channel 3
- a fourth wafer map M 4 may be captured or generated in, for or using the Channel 4.
- the channels i.e., Channel 1 to Channel 4 may also or alternatively be determined by different parameters from each other, and may therefore may be for the same, overlapping portions of the wafer W.
- the above parameters may include performance parameters of circuitry and chip, such as conductivity, current, operating delay, and threshold voltage. Therefore, as an example, the first wafer map M 1 having the conductive characteristic may be generated in, for or using the Channel 1, and the second wafer map M 2 having the threshold voltage characteristic may be generated in, for or using the Channel 2. Since the respective parameters correspond to different channels, the first wafer map M 1 and the second wafer map M 2 correspond to the same wafer, but they may have different patterns.
- channels of the method for analyzing the wafer map according to some embodiments of the present disclosure may be three or less, and may be five or more.
- the features of the wafer map are extracted (S 200 ).
- the wafer map X may be converted into one feature F by an auto encoder.
- the auto encoder is a neural network model learned so that the desired output and input become equal to each other.
- the auto encoder may have a neural network structure in which the input value is converted first by the encoder and the output value of the encoder is received as input by the decoder later to output the same or similar output value as the input value of the encoder.
- the feature F may be obtained by compressing the information of the wafer map X and expressing the information as smaller capacity information.
- the feature F may be, for example, a vector format, and may be a pattern image format as illustrated in FIG. 4 .
- the feature F in the pattern image format will be described below.
- multiple wafer maps X provided by multiple channels may be simultaneously auto-encoded, e.g., by a processor, in order to extract one feature F.
- the “auto” in the auto-encoding described herein may be taken to mean that the encoding is initiated automatically, ended automatically, performed by one or more machine components such as a processor, or other characteristics of an automated process.
- the first wafer map M 1 to fourth wafer map M 4 of the first channel (Channel 1) to fourth channel (Channel 4) may be auto-encoded to extract a single first feature F 1 . Therefore, one feature F corresponding to one wafer may be extracted from multiple wafer maps. Accordingly, extracting a feature F from one or more wafer maps may be described as extracting the one or more wafer maps in order determine, identify, generate and/or select the feature F, and the terminology of extraction may be used in this way herein.
- the wafer maps may be extracted as a first feature F 1 having pixels 4*4*3 in the form of a total of 48 blocks.
- the first feature F 1 may be in three-dimensional block form or may include third-order color information in two-dimensional block form.
- the first wafer map M 1 to fourth wafer map M 4 corresponding to different channels are not auto-encoded to extract another feature F.
- all the wafer maps X corresponding to one wafer that is, the first wafer map M 1 to fourth wafer map M 4 , may be simultaneously auto-encoded, e.g., by a processor, to extract a single first feature F 1 .
- the first wafer map M 1 to fourth wafer map M 4 formed in different patterns by different channels, i.e., of Channel 1 to Channel 4, are encoded to extract one first feature F 1 , the first feature F 1 may be highly representative (accurately representative) of the wafer.
- each wafer map X is encoded to extract different features F, the characteristics of the wafer may not be accurately reflected even when each wafer map is clustered later into one or more clustered groups. As described later, features may be excluded from classified feature groups based on similarity, such that the feature groups are clustered into a clustered group during analysis. Accordingly, multi-channel auto-encoding of this example may acquire a single first feature F 1 that is highly representative of the wafer.
- a second feature F 2 , a third feature F 3 and a fourth feature F 4 may be extracted from different wafers, respectively.
- the second feature F 2 to fourth feature F 4 may also be extracted one by one from the multiple wafer maps X according to the different first channel (Channel 1) to fourth channel (Channel 4).
- These multiple features F may constitute a feature group.
- the first feature F 1 may be reconstructed into a reconstructed wafer map X′ by the decoder.
- the reconstructed wafer map X′ is almost the same as the wafer map X, but since information may be lost during the encoding process and reconstruction process, partial differences from the wafer map X may occur.
- the first feature F 1 may be reconstructed into the first reconstructed wafer map R 1 in the Channel 1, and the first feature F 1 may be reconstructed into the second reconstructed wafer map R 2 in the Channel 2.
- the first feature F 1 may be reconstructed into the third reconstructed wafer map R 3 in the Channel 3, and the first feature F 1 may be reconstructed into the fourth reconstructed wafer map R 4 in the Channel 4.
- first wafer map M 1 to fourth wafer map M 4 since the reconstructed first wafer map R 1 to reconstructed fourth wafer map R 4 each have 1024 units, information about the total of 4096 units may be reconstructed.
- a difference between the reconstructed wafer map X′ and the wafer map X may be defined as a reconstruction error.
- the reconstruction error may also be expressed as “Abs (X-X′)”, where “Abs” stands for the absolute value of the difference.
- a feature group is a group in which features such as first feature to fourth feature (F 1 to F 4 ) are gathered.
- the wafer map pattern is random in the feature group, the value of clustering performed later may be reduced. That is, the method for analyzing the wafer map according to the present embodiment visualizes characteristic portions of multiple wafer maps and utilizes the characteristic portions to analyze the characteristics of wafers later, but in the case of random patterns, it may not be helpful for such a work at all.
- the method for analyzing the wafer map according to the present embodiment removes a feature with strong random characteristics (that is, a tendency to be formed in a pattern dissimilar to other patterns), and may leave a feature with strong pattern characteristics (that is, a tendency to be formed in a pattern similar to other patterns) in the feature group.
- the reconstruction error may mean the aforementioned Abs (X-X′), that is, the difference between the reconstructed wafer map X′ and the wafer map X.
- Abs X-X′
- the aforementioned reconstruction error may be a cumulative value of a single wafer or a representative value of other methods (e.g., an average value and a median value).
- the number of bad units means the number of bad units C 2 based on the wafer map X or the reconstructed wafer map X′. As explained in FIG. 2 , when the units C 1 and C 2 of the wafer map are defined binarily as either of two values, i.e., as good or bad, the number of bad units C 2 may be simply counted and totalled.
- a step of newly defining a good unit C 1 and a bad unit C 2 based on a specific reference value may be further included.
- the bad unit C 2 may be defined through a step of newly defining the good unit C 1 and the bad unit C 2 based on a specific reference value.
- the number of the bad units C 2 may be a cumulative value of one wafer or a representative value of other methods (e.g., an average value and a median value).
- a first straight line 51 connecting the origin of this graph is defined in contact with the upper contour side of the displayed numerical value.
- the portion with which the first straight line 51 is in contact does not necessarily need to be accurate, and the portion may have the form of a trend line.
- a third straight line S 3 connecting the origin of this graph is defined in contact with the lower contour side of the displayed numerical value.
- the portion with which the first straight line S 3 is in contact does not necessarily need to be accurate, and the portion may have the form of a trend line.
- the third straight line S 3 may be defined as the trend line connecting the representative values.
- first straight line 51 and the third straight line S 3 do not necessarily need to be connected to the origin, but the straight lines may include one of the points close to the origin as illustrated in FIG. 5 . That is, if the inclinations of the first straight line 51 and the third straight line S 3 are positive, the position of the point on which the first straight line 51 and the third straight line S 3 converge may not be limited.
- a second straight line S 2 which has the inclination between the first straight line 51 and the third straight line S 3 and is connected to the point at which the first straight line 51 and the third straight line S 3 converge, is defined.
- the inclination of the second straight line S 2 may be closer to the inclination of the first straight line 51 than the inclination of the third straight line S 3 .
- the inclination of the second straight line S 2 may be adjusted.
- the inclination of the second straight line S 2 may approach the inclination of the third straight line S 3
- the inclination of the second straight line S 2 may approach the inclination of the first straight line 51 .
- a region between the first straight line 51 and the second straight line S 2 may be defined as a first region A 1 .
- the first region A 1 is a region in which the reconstruction error is higher than the number of bad units, and in such a case, random characteristics of the feature F may be large. Therefore, in order that the accuracy of clustering can be maintained high, there is a need to exclude the first region in the clustering later. Therefore, the features F located in the first region A 1 may be determined to be invalid.
- the second region A 2 adjacent to the third straight line S 3 is a region in which the reconstruction error is lower than the number of bad units, and the pattern characteristics of the feature F may be large. Therefore, the second region may be subject to clustering later, and the meaning stored in a storage device may be significant.
- the fourth feature F 4 belonging to the first region A 1 is excluded in the clustering later, and the first feature F 1 , the second feature F 2 and the third feature F 3 not belonging to the first region A 1 are left and may be subject to clustering later. Therefore, the features F located in the second region A 2 may be determined to be valid.
- the method for analyzing the wafer map according to some embodiments of the present disclosure may also determine the validity, using a method different from FIG. 5 .
- the validity may be determined, using a distribution chart illustrating the reconstruction error and the number of features.
- the distribution chart as in FIG. 6 may be illustrated.
- the above distribution chart may have a Gaussian distribution as illustrated in FIG. 6 , but it may have another form of distribution chart.
- the reconstruction error may mean the aforementioned Abs (X-X′), that is, the difference between the reconstructed wafer map X′ and the wafer map X.
- Abs X-X′
- the reconstruction error may be a cumulative value of a single wafer or a representative value of other methods (e.g., an average value and a median value).
- the number of features may mean the number of features F in which the numeral values of reconstruction errors are the same or similar. Therefore, it may mean a feature having a larger reconstruction error toward the right side of the horizontal axis of FIG. 6 .
- the reference line C 1 may be a reference for defining the degree of reconstruction error of feature F to be excluded from clustering later.
- the distribution chart of FIG. 6 may be divided into a maintenance region E 1 and an exclusion region E 2 .
- the pattern characteristics may be strong.
- the features belonging to the exclusion region E 2 have a relatively high reconstruction error, random characteristics may be strong.
- a feature F may therefore be determined valid or invalid using reconstruction errors of features.
- the auto-encoding is learned by the neural network to improve accuracy. As the pattern is similar, the learning amount of the neural network increases, and the reconstruction error decreases. Conversely, if there is a dissimilar pattern with the strong random characteristic, since the learning amount of the neural network is small, the reconstruction errors may increase.
- the features F located in the maintenance region E 1 may be determined to be valid, and the features F located in the exclusion region E 2 may be determined to be invalid.
- the wafer map may be analyzed later, using data with no noise.
- clustering is performed based on unsupervised learning (S 400 ).
- the clustering means a method for classifying data into multiple groups based on concepts such as similarity.
- the clustering means a method for classifying feature groups from which some features are excluded for each type based on similarity via the validity determination (S 300 ).
- the clustering may be performed in dimensions formed in accordance with the number of channels. That is, in the case of two channels, the clustering may be performed in consideration of a two-dimensional distance. If there are four channels as mentioned above, the clustering may be performed in a Z space having the four dimensions. For the sake of convenience, this procedure will be described below assuming that there are two channels.
- the clustering may be performed in a two-dimensional space.
- the feature group includes the first feature to third feature F 1 to F 3 , and each feature may be defined as each group based on the distance therebetween or the like.
- the unsupervised learning-based clustering method may vary.
- the clustering algorithm of this embodiment may include at least one of KNN (K-Nearest Neighbor), K-Means, Kohenen, VQ (learning vector quantization), C-Means and t-SNE (t-Distributed Stochastic Neighbor Embedding).
- KNN K-Nearest Neighbor
- K-Means K-Means
- Kohenen Kohenen
- VQ learning vector quantization
- C-Means t-SNE (t-Distributed Stochastic Neighbor Embedding).
- the present disclosure is not limited thereto.
- all the first feature F 1 to third feature F 3 may belong to the first group G 1 .
- Other features may also belong to the second group G 2 and the third group G 3 close to each other.
- Each of the groups G 1 to G 3 may each have a cluster center. While the concept of a center can be visualized for a two-dimensional or n-dimensional space, the center may itself correspond to a central value or a range of central values along an axis that defines any dimension in the n-dimensional space.
- the cluster center of the first group G 1 may be calculated by a distance between the first feature F 1 to third feature F 3 , that is, the first distance D 1 , the second distance D 2 and the third distance D 3 . If there are features other than the first feature F 1 to third feature F 3 in the first group G 1 , the cluster center may be calculated in consideration of the distance to the feature.
- the “distance” including the first distance D 1 to third distance D 3 means a distance in two-dimensions when there are two channels, and the distance may mean a distance in n-dimensions when there are n-channels.
- the first center feature CF 1 may be a feature corresponding to the cluster center. That is, there is a high possibility that the first center feature CF 1 is a virtual value. That is to say, as long as there is no feature at the position of the cluster center by accident, the cluster center is a calculated value that did not exist, and thus, the first center feature CF 1 may also be a virtual feature that is generated by the calculated center.
- a representative image for each type, that is, for each group, is generated (S 500 ).
- the first center feature CF 1 may be reconstructed into the first representative image RI 1 .
- a method for reconstruction it is possible to use a method using a decoder of the above-described auto encoder.
- the first center feature CF 1 may naturally have multiple first representative images RI 1 in accordance with the multiple channels.
- the first center feature CF 1 is a virtual value as described above, there is a high possibility that the first representative image RI 1 is also a virtual image.
- the possibility of formation of noise in the first representative image RI 1 may be minimized.
- the representative image may lose the representativeness of the first group G 1 , while the noises formed in the decoding process over three times re superimposed. As a result, the accuracy of analysis of the wafer map according to the representative images may be lowered later.
- the method for analyzing the wafer map according to the present embodiment may minimize noise, using a method for extracting a representative image by the use of a virtual center value, and may obtain cluster data close to actual data.
- code is assigned to each representative image and stored therein (S 600 ).
- the first representative image RI 1 is specified as a first code (Code 1).
- the second representative image (RI 2 ) may be specified as a second code (Code 2).
- the third representative image RI 3 may be specified as a third code (Code 3).
- the code may allow a representative image to be searched by calling a representative image in the storage device and using an indexing function later.
- characteristics of each representative image may be stored together depending on the code, and problems of process and facility can be easily traced in the case of being similar to a specific code.
- the code can be used to isolate a source for manufactured semiconductors later, such as when a defect is detected or being investigated.
- the method for analyzing the wafer map by, e.g., a processor, simultaneously auto-encoding multiple wafer maps to extract one feature, it is possible to obtain a feature that is highly representative based on the correlation between the respective parameters.
- the method for analyzing the wafer map reconstructs the central features corresponding to the cluster center, and derives them as representative images to minimize noise due to reconstruction.
- the method results in generating representative images that are highly representative of clustering.
- FIG. 10 another method for analyzing a wafer map according to some embodiments of the present disclosure will be described.
- the repeated part of the above explanation will be omitted or simplified.
- FIG. 10 is a flowchart illustrating another method for analyzing the wafer map according to some embodiments of the present disclosure.
- the method for analyzing the wafer map according to the present embodiment may further include a step (S 700 ) of anomaly pattern determination, and a step (S 800 ) of anomaly pattern encoding and storing as compared with the embodiment of FIG. 1 . Therefore, the steps of S 700 and S 800 will be mainly described below.
- the validity is determined (S 300 ), and it is determined whether the feature determined to be invalid is an anomaly pattern (S 700 ).
- the anomaly pattern may mean an anomaly pattern that is rare or that does not exist in existing learning data. That is, the anomaly pattern may mean a pattern with very little similarity with an anomaly pattern sample stored in advance. Since the anomaly pattern is likely to be caused by serious defects in the manufacturing facility of the semiconductor device, it is necessary to separately detect and store the anomaly pattern.
- the anomaly pattern may mean a pattern that has strong random characteristics but can intuitively and clearly reflects the cause. For example, if a half of the wafer is a bad unit or the peripheral portions of the wafer are all bad units, the user may intuitively trace the problems of the facility or the process.
- the method for determining the anomaly pattern may include comparison of the pre-stored pattern with the current feature.
- the pattern By comparing the pre-stored pattern sample with the current feature, in a case where the numerical value of the similarity is low, the pattern may be determined as the anomaly pattern. If the numerical value of similarity is high, it is possible to determine that the current feature is not an anomaly pattern.
- a code may be assigned to the anomaly pattern and stored therein (S 800 ).
- the code may be assigned and stored in the feature itself.
- the code may be assigned thereto and stored.
- the code may allow the anomaly pattern images to be searched, by calling the representative image in the storage device, and using an indexing function later. Further, by storing the characteristics of each anomaly pattern image together depending on the code, it is possible to easily trace the problems of process and facility when they are similar to a specific code.
- FIGS. 4 to 9 , 11 , and 12 a wafer map analyzer according to some embodiments of the present disclosure will be described with reference to FIGS. 4 to 9 , 11 , and 12 .
- the repeated parts of the above description will be omitted or simplified.
- FIG. 11 is a block diagram illustrating a wafer map analyzer according to some embodiments of the present disclosure
- FIG. 12 is a block diagram illustrating the operation of the wafer map analyzer according to some embodiments of the present disclosure in detail.
- a wafer map analyzer 100 includes a processor 10 , a non-volatile memory 20 , a volatile memory 40 , and a bus 50 .
- the processor 10 may be a processor of a neural network.
- the neural network means a network provided by modelling the structure of the human brain, which is made up of a number of artificial neurons, and in which the respective neurons are connected to one another by connection strength and weight. Therefore, the neural network processor should have excellent ability in the parallel distributed processing, computing ability, and learning.
- the neural network processor may also be suitable for controlling complicated nonlinear systems, and may provide an output to the unsupervised learning.
- the non-volatile memory 20 may receive the transmission of the wafer map X and store the wafer map X therein.
- the wafer map X may be processed to other data by the processors 10 later.
- the non-volatile memory 20 may store the program 45 therein.
- the volatile memory 40 may be utilized as a temporary memory for the operation of the processor 10 .
- Program 45 may be loaded into the volatile memory 40 .
- the program 45 may be loaded into the volatile memory 40 by the instruction of the processor 10 in the state of being stored in the non-volatile memory 20 .
- the bus 50 may mutually connect the processor 10 , the non-volatile memory 20 , and the volatile memory 40 . That is, all the movement of data and request may be performed through the bus 50 .
- the processor 10 may perform the program 45 loaded to the volatile memory 40 .
- the program 45 includes sequential operations.
- the program 45 includes an auto encoder 101 , a feature filter 102 , an anomaly pattern detector 210 , a clustering machine 103 , and a code allocator 104 .
- the program 45 is performed by the processor 10 , and each of the auto encoder 101 , the feature filter 102 , the anomaly pattern detector 210 , the clustering machine 103 and the code allocator 104 may process data by the processor 10 .
- the auto encoder 101 may receive the input of the wafer map X to extract the feature F.
- the auto encoder 101 may perform auto-encoding of multiple wafer maps X using multiple channels, i.e., Channel 1 to Channel 4, at the same time to extract them as a single feature F.
- the first feature F 1 may be reconstructed as the reconstructed wafer map X′ by the auto encoder 101 .
- the auto encoder 101 may derive a reconstruction error (Abs (X-X′)) which is a difference between the reconstructed wafer map X′ and the wafer map X.
- the feature filter 102 may determine the validity of the feature F to exclude invalid features F from the overall feature group, while leaving only the valid feature F.
- the feature filter 102 may perform filtering, using the reconstruction error and the bad unit number, ( FIG. 5 ), or may perform filtering, using distribution of features due to reconstruction error ( FIG. 6 ).
- the present disclosure is not limited thereto.
- the anomaly pattern detector 210 may determine whether the feature F determined to be an invalid feature F by the feature filter 102 is an anomaly pattern.
- the anomaly pattern may mean a pattern that is rare or that does not exist in the existing learning data. That is, the anomaly pattern may mean a pattern with very little similarity with a pre-stored pattern. Since the anomaly pattern is likely to be caused by serious defects in the manufacturing facility of the semiconductor device, it is necessary to separately detect and store the anomaly pattern. Therefore, the anomaly pattern detector 210 may detect the anomaly pattern and may transmit it to the auto encoder 101 .
- the clustering machine 103 may cluster the valid feature F passing through the feature filter 102 .
- the clustering machine 103 may perform clustering in a Z space having a dimension corresponding to the number of channels.
- the clustering machine 103 may generate a center feature CF corresponding to the center of each group.
- the clustering machine 103 may transmit the center feature CF to the auto encoder 101 .
- the auto encoder 101 may reconstruct the center feature CF via the decoding function to generate a representative image (R.I.).
- the auto encoder 101 may transmit the representative image (R.I.) to the code allocator 104 .
- the auto encoder 101 may reconstruct an anomaly pattern via the decode function to generate a reconstructed wafer map anomaly pattern X′.
- the auto encoder 101 may transmit the reconstructed wafer map anomaly pattern X′ to the code allocator 104 .
- the code allocator 104 may assign each code to the representative image (R.I.). The code allocator 104 may also allocate a code to the reconstructed wafer map anomaly pattern X′.
- the code means the name of the representative image (R.I.) or the anomaly pattern stored in the non-volatile memory 20 , and allows retrieval of the representative image (R.I.) and the anomaly pattern, using an indexing function later. Further, by storing characteristics of each representative image or the anomaly patterns together depending on the code, when a wafer map similar to the representative image (R.I.) or the anomaly pattern corresponding to a specific code is detected, it is possible to easily trace the problems of the process and the facility.
- the code allocator 104 may store the anomaly pattern and the code in the non-volatile memory 20 .
- FIGS. 2 , 3 , 9 , 13 , and 14 a method for manufacturing a semiconductor device according to some embodiments of the present disclosure will be described with reference to FIGS. 2 , 3 , 9 , 13 , and 14 .
- the repeated parts of the above explanation will be omitted or simplified.
- FIG. 13 is a flow chart illustrating a method for manufacturing a semiconductor device according to some embodiments of the present disclosure
- FIG. 14 is a block diagram illustrating a method for manufacturing the semiconductor device according to some embodiments of the present disclosure.
- a wafer is manufactured (S 1100 ).
- Wafer W means a silicon substrate used in the process of manufacturing the semiconductor device.
- a semiconductor device such as a transistor is formed on the surface of the wafer W, and may be diced and separated into multiple chips later.
- the semiconductor manufacturing process may include various processes such as a vapor deposition process, an etching process, a plasma process, and an implant process.
- the semiconductor manufacturing facility 30 may manufacture a semiconductor device, that is, a wafer therein.
- the semiconductor manufacturing facility 30 is a semiconductor fabrication facility, in which the wafer is fabricated.
- the wafer map X may be an image mapped by displaying the goodness and badness for each of the units C 1 and C 2 in a plan view of the wafer W.
- Multiple wafer maps X may be captured or generated in a single wafer. That is, different wafer maps X may be captured or generated in accordance with the respective channels, i.e., of Channel 1 to Channel 4.
- a first wafer map M 1 may be captured or generated in the Channel 1
- a second wafer map M 2 may be captured or generated in the Channel 2.
- a third wafer map M 3 may be captured or generated in the Channel 3
- a fourth wafer map M 4 may be captured or generated in the Channel 4.
- the semiconductor manufacturing facility 30 may transmit the wafer map acquired through the wafer to the wafer map analyzer 100 .
- the wafer map X is compared with the representative image (S 1300 ).
- the wafer map X may be compared with the first representative image (RI 1 ) to third representative image (RI 3 ) stored in advance. Since the first representative image (RI 1 ) to third representative image (RI 3 ) stored in advance are the wafer maps reconstructed in the auto-encoded feature, the first representative image (RI 1 ) to third representative image (RI 3 ) may be immediately compared with the wafer map X. Also, since there are multiple representative images, i.e., first representative image (RI 1 ) to third representative image (RI 3 ), in accordance with each channel, it is possible to compare the wafer map X of the same channel with the first representative image (RI 1 ) to third representative image (RI 3 ).
- the wafer map analyzer 100 may compare the wafer map X with the representative image.
- the first representative image (RI 1 ) to third representative image (RI 3 ) may have previously assigned codes. Therefore, the wafer map X may be compared with a code having the representative image most similar to the wafer map X among multiple codes.
- the characteristics of the code and the representative image to which the code is assigned are stored together, and it is possible to easily trace how a part of the facility or process acts accordingly.
- the wafer map analyzer 100 may detect the defects in the semiconductor manufacturing facility 30 .
- the wafer map analyzer 100 may detect the defects in the semiconductor manufacturing process.
- the method for manufacturing a semiconductor device according to some embodiments of the present disclosure can precisely complement the problems in the process and facility.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Evolutionary Computation (AREA)
- Artificial Intelligence (AREA)
- Manufacturing & Machinery (AREA)
- Bioinformatics & Computational Biology (AREA)
- General Engineering & Computer Science (AREA)
- Life Sciences & Earth Sciences (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Evolutionary Biology (AREA)
- Power Engineering (AREA)
- Microelectronics & Electronic Packaging (AREA)
- Computer Hardware Design (AREA)
- Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- Databases & Information Systems (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Software Systems (AREA)
- Multimedia (AREA)
- Quality & Reliability (AREA)
- Testing Or Measuring Of Semiconductors Or The Like (AREA)
- Investigating Materials By The Use Of Optical Means Adapted For Particular Applications (AREA)
- Analysing Materials By The Use Of Radiation (AREA)
Abstract
A method for analyzing a wafer map using a wafer map analyzer includes generating first wafer maps each displaying characteristics of a first wafer for a corresponding channel of a plurality of channels. The first wafer maps are auto-encoded together to extract a first feature. The method also includes determining whether the first feature is a valid pattern, classifying the type of the first feature based on unsupervised learning when the first feature is a valid pattern and extracting a representative image of features classified into the same type as the first feature.
Description
- This is a Continuation of U.S. application Ser. No. 15/960,701, filed Apr. 24, 2018, which claims priority under 35 U.S.C. 119 to Korean Patent Application No. 10-2017-0102035, filed on Aug. 11, 2017 in the Korean Intellectual Property Office, the disclosure of which is incorporated herein by reference in its entirety.
- The present disclosure relates to a wafer map analyzer, a method for analyzing the wafer map using the same, and a method for manufacturing a semiconductor device.
- In a manufacturing process of a semiconductor device, data of all wafers may be collected in the form of a map of the wafer (a wafer map) because of its nature. Since the patterns of the wafer maps relate to (are connected with) a specific process and a specific facility, various types of analysis may be performed. The reason is that it is possible to detect defects of a specific process or specific facility through characteristics of the wafer map. Therefore, recently, pattern analysis of such a wafer map has been recognized as a method capable of reducing defects and improving the yield in the manufacturing process of the semiconductor device.
- However, at present, analysis of the wafer map depends on manual analysis of engineers in the field of visual recognition, and a percentage of manpower input is very high. Thus, there is a tendency that personnel expenses are high and accuracy is low.
- Therefore, through the method for analyzing the wafer map by machine learning, the cost of the semiconductor manufacturing process can be greatly reduced and the yield can be greatly improved with increased accuracy.
- An aspect of the present disclosure provides a method for analyzing a wafer map which reduces cost and increases accuracy.
- Another aspect of the present disclosure provides a wafer map analyzer which reduces cost and increases accuracy.
- Still another aspect of the present disclosure provides a method for manufacturing a semiconductor device which reduces cost and increases accuracy.
- The aspects of the present invention are not limited to those mentioned above and another aspect which has not been mentioned can be clearly understood by those skilled in the art from the description below.
- According to an aspect of the present disclosure, a method for analyzing a wafer map includes generating a first wafer map displaying characteristics of a first wafer for each of multiple channels. The method also includes auto-encoding the first wafer maps of the multiple channels together to extract a first feature, determining whether the first feature is a valid pattern, classifying a type of the first feature based on unsupervised learning when the first feature is a valid pattern, and extracting a representative image of features classified into the same type as the first feature.
- According to another aspect of the present disclosure, a method for analyzing a wafer map includes generating a first wafer map of a first channel of a first wafer, and a second wafer map of a second channel of the first wafer. The method also includes generating a third wafer map of a first channel of a second wafer, and a fourth wafer map of a second channel of the second wafer. The method further includes auto-encoding the first wafer map and second wafer map together to extract a first feature of the first wafer, auto-encoding the third wafer map and fourth wafer map together to extract a second feature of the second wafer, generating a feature group including the first feature and the second feature, excluding invalid features among the features of the feature group from the feature group, clustering the feature group into multiple types based on unsupervised learning, and extracting representative images of the multiple types, respectively.
- According to still another aspect of the present disclosure, a method for analyzing a wafer map includes forming multiple wafer maps for multiple wafers, respectively. The method also includes auto-encoding the multiple wafer maps to extract multiple features corresponding to the multiple wafers, excluding invalid features among the multiple features, classifying valid features among the multiple features into multiple types using unsupervised learning, generating multiple center features corresponding to respective centers of the multiple types, and reconstructing the multiple center features to output a representative image.
- According to an aspect of the present disclosure, a wafer map analyzer includes a storage device and a processor. The storage device stores a wafer map. The processor is connected to the storage device and executes instructions to perform a process. The processor extracts features from the wafer map, determines validity of the features, clusters the features to classify the features into multiple types, generates a feature having a center value for each of multiple classified types, and reconstructs the feature into a wafer map to generate a representative image of the type. The storage device stores the representative image for each type.
- According to still another aspect of the present disclosure, a method for manufacturing a semiconductor device includes manufacturing a first wafer, and forming each of multiple first wafer maps for multiple first wafers. The method also includes auto-encoding the multiple first wafer maps to extract multiple features corresponding to the multiple first wafers, classifying the multiple features into multiple types, using unsupervised learning, generating multiple center features corresponding to each center of the multiple types, reconstructing the multiple center features to output a representative image, assigning a code to the representative image and storing the code in the storage device, manufacturing a second wafer in a semiconductor manufacturing facility, generating a second wafer map of the second wafer, and comparing the representative image with the second wafer map to detect defects of the semiconductor manufacturing facility.
- According to another aspect of the present disclosure, a wafer map analyzer includes a non-volatile memory, a volatile memory, a processor, and a bus. The non-volatile memory stores a wafer map and program. The program is loaded to the volatile memory. The processor executes the program. The bus connects the processor, the non-volatile memory and the volatile memory. The program includes different executable modules including an auto-encoder, a feature filter, a clustering machine, and a code allocator. The auto encoder automatically encodes a wafer map to extract a feature. The feature filter determines validity of the feature and excludes the feature when the feature is not valid. The clustering machine performs clustering of the feature and generates a center feature of the group according to the clustering. The code allocator allocates a code to a representative image corresponding to the center feature and stores the code in the non-volatile memory.
- The above and other aspects and features of the present disclosure will become more apparent by describing in detail exemplary embodiments thereof with reference to the attached drawings, in which:
-
FIG. 1 is a flowchart illustrating a method for analyzing a wafer map according to some embodiments of the present disclosure; -
FIG. 2 is an exemplary view illustrating a wafer map for the method for analyzing the wafer map according to some embodiments of the present disclosure; -
FIG. 3 is an exemplary view illustrating using multiple channels for analyzing the wafer map according to some embodiments of the present disclosure; -
FIG. 4 is an exemplary conceptual diagram illustrating feature extraction and reconstruction of the wafer map using the multiple channels in the method for analyzing the wafer map according to some embodiments of the present disclosure; -
FIG. 5 is an exemplary graph illustrating validity determination of the method for analyzing the wafer map according to some embodiments of the present disclosure; -
FIG. 6 is an exemplary graph illustrating validity determination of the method for analyzing the wafer map according to some embodiments of the present disclosure; -
FIG. 7 is an exemplary view illustrating clustering for analyzing the wafer map according to some embodiments of the present disclosure; -
FIG. 8 is an exemplary conceptual diagram illustrating creation of a representative image for analyzing the wafer map according to some embodiments of the present disclosure; -
FIG. 9 is an exemplary conceptual diagram illustrating coding of a representative image for analyzing the wafer map according to some embodiments of the present disclosure; -
FIG. 10 is a flowchart illustrating another method for analyzing the wafer map according to some embodiments of the present disclosure; -
FIG. 11 is a block diagram illustrating a wafer map analyzer according to some embodiments of the present disclosure; -
FIG. 12 is a block diagram illustrating the operation of the wafer map analyzer according to some embodiments of the present disclosure in detail; -
FIG. 13 is a flowchart illustrating a method for manufacturing a semiconductor device according to some embodiments of the present disclosure; and -
FIG. 14 is a block diagram illustrating a method for manufacturing the semiconductor device according to some embodiments of the present disclosure. -
FIG. 1 is a flowchart illustrating a method for analyzing a wafer map according to some embodiments of the present disclosure.FIG. 2 is an exemplary view illustrating a wafer map for the method for analyzing the wafer map according to some embodiments of the present disclosure.FIG. 3 is an exemplary view illustrating using multiple channels for analyzing the wafer map according to some embodiments of the present disclosure.FIG. 4 is an exemplary conceptual diagram illustrating feature extraction and reconstruction of the wafer map using the multiple channels in the method for analyzing the wafer map according to some embodiments of the present disclosure.FIG. 5 is an exemplary graph illustrating validity determination of the method for analyzing the wafer map according to some embodiments of the present disclosure.FIG. 6 is an exemplary graph illustrating validity determination of the method for analyzing the wafer map according to some embodiments of the present disclosure.FIG. 7 is an exemplary view illustrating clustering for analyzing the wafer map according to some embodiments of the present disclosure.FIG. 8 is an exemplary conceptual diagram illustrating creation of a representative image for analyzing the wafer map according to some embodiments of the present disclosure.FIG. 9 is an exemplary conceptual diagram illustrating coding of a representative image for analyzing the wafer map according to some embodiments of the present disclosure - First, referring to
FIG. 1 , a wafer map is provided (S100). - Specifically, the wafer map will be described referring to
FIG. 2 . The wafer W means a silicon substrate used in the process of manufacturing a semiconductor device. A semiconductor device such as a transistor is formed on the surface of the wafer W, and may be separated by the wafer W being diced into multiple chips later. -
FIG. 2 illustrates a configuration in which a single wafer W is diced into units C1 and C2 like multiple chips. In a region in which one unit is formed, the characteristics of each unit may be displayed as an image. - The units C1 and C2 may be made up of individual chips, or multiple chips such as blocks of chips in sizes of 2, 4, 8, 16, 32, 64, 128, and so on. The sizes of the units C1 and C2 and the number of units C1 and C2 in the wafer W may change, depending on how many chips and the sizes of the chips used to determine the units C1 and C2. The size and number of chips by which the units C1 and C2 are determined may vary depending on how finely the characteristics in the wafer W are measured.
- The wafer map may be an image mapped by displaying the characteristics for each of the units C1 and C2 in the plan view of the wafer W. The units C1 and C2 may include a good unit C1 and a bad unit C2. The good unit C1 may mean a unit with good characteristics, and the bad unit C2 may mean a unit with poor characteristics. The good unit C1 and the bad unit C2 may be expressed by different brightness, chroma, or color.
- In
FIG. 2 , only binary values, that is good values and bad values, are expressed in the units C1 and C2, but the embodiment is not limited thereto. That is, the characteristics of the units C1 and C2 may have three or more separate grades. For example, when each of the units C1 and C2 is expressed by the first grade to fifth grade, they may be expressed by different brightness, chroma or color. Alternatively, in some embodiments of the present disclosure, they may be expressed in another way other than brightness, chroma or color. - Alternatively, in some embodiments of the present disclosure, continuous values rather than discrete values may be expressed in the units C1 and C2 of the wafer map. In such a case, the expression of brightness, chroma, color or another characteristic may also be expressed continuously for each of the units C1 and C2 of the wafer map.
- Referring to
FIG. 3 , multiple wafer maps X may be captured or generated in or for a single wafer. That is, different wafer maps X may be generated according to the respective channels, i.e., ofChannel 1 toChannel 4. A channel is typically considered a single band of frequencies used in transmissions, but as used herein may refer to processing characteristics of a single continuous space, signals used to capture the characteristics of a single continuous space, or as another reference of a mechanism to capture characteristics of an isolated and continuous portion of a single wafer W. Thus, reference to multiple different channels herein refers to mechanisms for capturing or generating multiple different wafer maps X for different, non-overlapping portions of the wafer W. Thus, the wafer maps X different from each other may be generated. Specifically, a first wafer map M1 may be captured or generated in, for or using theChannel 1, and a second wafer map M2 may be captured or generated in, for or using theChannel 2. A third wafer map M3 may be captured or generated in, for or using theChannel 3, and a fourth wafer map M4 may be captured or generated in, for or using theChannel 4. - The channels, i.e.,
Channel 1 toChannel 4, may also or alternatively be determined by different parameters from each other, and may therefore may be for the same, overlapping portions of the wafer W. For example, the above parameters may include performance parameters of circuitry and chip, such as conductivity, current, operating delay, and threshold voltage. Therefore, as an example, the first wafer map M1 having the conductive characteristic may be generated in, for or using theChannel 1, and the second wafer map M2 having the threshold voltage characteristic may be generated in, for or using theChannel 2. Since the respective parameters correspond to different channels, the first wafer map M1 and the second wafer map M2 correspond to the same wafer, but they may have different patterns. - Although only four channels are illustrated in
FIG. 3 , the present disclosure is not limited thereto. That is, channels of the method for analyzing the wafer map according to some embodiments of the present disclosure may be three or less, and may be five or more. - Referring again to
FIG. 1 , the features of the wafer map are extracted (S200). - Specifically, referring to
FIG. 4 , the wafer map X may be converted into one feature F by an auto encoder. The auto encoder is a neural network model learned so that the desired output and input become equal to each other. The auto encoder may have a neural network structure in which the input value is converted first by the encoder and the output value of the encoder is received as input by the decoder later to output the same or similar output value as the input value of the encoder. - The feature F may be obtained by compressing the information of the wafer map X and expressing the information as smaller capacity information. The feature F may be, for example, a vector format, and may be a pattern image format as illustrated in
FIG. 4 . For the sake of convenience, the feature F in the pattern image format will be described below. - In the method for analyzing the wafer map according to some embodiments of the present disclosure, multiple wafer maps X provided by multiple channels, i.e.,
Channel 1 toChannel 4, may be simultaneously auto-encoded, e.g., by a processor, in order to extract one feature F. The “auto” in the auto-encoding described herein may be taken to mean that the encoding is initiated automatically, ended automatically, performed by one or more machine components such as a processor, or other characteristics of an automated process. - That is, for example, the first wafer map M1 to fourth wafer map M4 of the first channel (Channel 1) to fourth channel (Channel 4) may be auto-encoded to extract a single first feature F1. Therefore, one feature F corresponding to one wafer may be extracted from multiple wafer maps. Accordingly, extracting a feature F from one or more wafer maps may be described as extracting the one or more wafer maps in order determine, identify, generate and/or select the feature F, and the terminology of extraction may be used in this way herein.
- If the first wafer map M1 to fourth wafer map M4 each have 1024 units, information on a total of 4096 units may exist in the first wafer map M1 to fourth wafer map M4. When the wafer maps are auto-encoded, the wafer maps may be extracted as a first feature
F1 having pixels 4*4*3 in the form of a total of 48 blocks. As an example, the first feature F1 may be in three-dimensional block form or may include third-order color information in two-dimensional block form. - In the method for analyzing the wafer map according to the present embodiment, the first wafer map M1 to fourth wafer map M4 corresponding to different channels, i.e.,
Channel 1 toChannel 4, are not auto-encoded to extract another feature F. Instead, all the wafer maps X corresponding to one wafer, that is, the first wafer map M1 to fourth wafer map M4, may be simultaneously auto-encoded, e.g., by a processor, to extract a single first feature F1. As a result, since the first wafer map M1 to fourth wafer map M4 formed in different patterns by different channels, i.e., ofChannel 1 toChannel 4, are encoded to extract one first feature F1, the first feature F1 may be highly representative (accurately representative) of the wafer. - If each wafer map X is encoded to extract different features F, the characteristics of the wafer may not be accurately reflected even when each wafer map is clustered later into one or more clustered groups. As described later, features may be excluded from classified feature groups based on similarity, such that the feature groups are clustered into a clustered group during analysis. Accordingly, multi-channel auto-encoding of this example may acquire a single first feature F1 that is highly representative of the wafer.
- In this way, a second feature F2, a third feature F3 and a fourth feature F4 may be extracted from different wafers, respectively. The second feature F2 to fourth feature F4 may also be extracted one by one from the multiple wafer maps X according to the different first channel (Channel 1) to fourth channel (Channel 4). These multiple features F may constitute a feature group.
- The first feature F1 may be reconstructed into a reconstructed wafer map X′ by the decoder. The reconstructed wafer map X′ is almost the same as the wafer map X, but since information may be lost during the encoding process and reconstruction process, partial differences from the wafer map X may occur.
- Specifically, the first feature F1 may be reconstructed into the first reconstructed wafer map R1 in the
Channel 1, and the first feature F1 may be reconstructed into the second reconstructed wafer map R2 in theChannel 2. The first feature F1 may be reconstructed into the third reconstructed wafer map R3 in theChannel 3, and the first feature F1 may be reconstructed into the fourth reconstructed wafer map R4 in theChannel 4. - Like the first wafer map M1 to fourth wafer map M4, since the reconstructed first wafer map R1 to reconstructed fourth wafer map R4 each have 1024 units, information about the total of 4096 units may be reconstructed.
- A difference between the reconstructed wafer map X′ and the wafer map X may be defined as a reconstruction error. The reconstruction error may also be expressed as “Abs (X-X′)”, where “Abs” stands for the absolute value of the difference.
- Referring again to
FIG. 1 , the validity is determined (S300). - As mentioned above, a feature group is a group in which features such as first feature to fourth feature (F1 to F4) are gathered. When the wafer map pattern is random in the feature group, the value of clustering performed later may be reduced. That is, the method for analyzing the wafer map according to the present embodiment visualizes characteristic portions of multiple wafer maps and utilizes the characteristic portions to analyze the characteristics of wafers later, but in the case of random patterns, it may not be helpful for such a work at all.
- Therefore, the method for analyzing the wafer map according to the present embodiment removes a feature with strong random characteristics (that is, a tendency to be formed in a pattern dissimilar to other patterns), and may leave a feature with strong pattern characteristics (that is, a tendency to be formed in a pattern similar to other patterns) in the feature group.
- Specifically, referring to
FIGS. 2, 4 and 5 , it is possible to determine the validity, using a graph according to the reconstruction error and the number of bad units. - Here, the reconstruction error may mean the aforementioned Abs (X-X′), that is, the difference between the reconstructed wafer map X′ and the wafer map X. Although there is only one feature F corresponding to one wafer, since multiple wafer maps X and multiple reconstructed wafer maps X′ correspond to one wafer, the aforementioned reconstruction error may be a cumulative value of a single wafer or a representative value of other methods (e.g., an average value and a median value).
- Here, the number of bad units means the number of bad units C2 based on the wafer map X or the reconstructed wafer map X′. As explained in
FIG. 2 , when the units C1 and C2 of the wafer map are defined binarily as either of two values, i.e., as good or bad, the number of bad units C2 may be simply counted and totalled. - If the units C1 and C2 of the wafer map have several grades, a step of newly defining a good unit C1 and a bad unit C2 based on a specific reference value may be further included. Further, even when the units C1 and C2 of the wafer map have continuous values, similarly, the bad unit C2 may be defined through a step of newly defining the good unit C1 and the bad unit C2 based on a specific reference value.
- Although there is only one feature F corresponding to one wafer, since multiple wafer maps X and multiple reconstructed wafer maps X′ correspond to one wafer, the number of the bad units C2 may be a cumulative value of one wafer or a representative value of other methods (e.g., an average value and a median value).
- In
FIG. 5 , when looking at the graph of the number of bad units and the reconstruction error, it is possible to empirically find a portion with strong random characteristics and a portion with strong pattern characteristics. First, a first straight line 51 connecting the origin of this graph is defined in contact with the upper contour side of the displayed numerical value. The portion with which the first straight line 51 is in contact does not necessarily need to be accurate, and the portion may have the form of a trend line. - In the same way, a third straight line S3 connecting the origin of this graph is defined in contact with the lower contour side of the displayed numerical value. The portion with which the first straight line S3 is in contact does not necessarily need to be accurate, and the portion may have the form of a trend line. When several numerical values are not entirely linearly arranged in
FIG. 5 , the third straight line S3 may be defined as the trend line connecting the representative values. - In addition, the first straight line 51 and the third straight line S3 do not necessarily need to be connected to the origin, but the straight lines may include one of the points close to the origin as illustrated in
FIG. 5 . That is, if the inclinations of the first straight line 51 and the third straight line S3 are positive, the position of the point on which the first straight line 51 and the third straight line S3 converge may not be limited. - Subsequently, a second straight line S2, which has the inclination between the first straight line 51 and the third straight line S3 and is connected to the point at which the first straight line 51 and the third straight line S3 converge, is defined. The inclination of the second straight line S2 may be closer to the inclination of the first straight line 51 than the inclination of the third straight line S3. Depending on the size of the feature to be excluded, the inclination of the second straight line S2 may be adjusted. That is, as the scale of the feature to be excluded is large, the inclination of the second straight line S2 may approach the inclination of the third straight line S3, and as the scale of the feature to be excluded is small, the inclination of the second straight line S2 may approach the inclination of the first straight line 51.
- A region between the first straight line 51 and the second straight line S2 may be defined as a first region A1. The first region A1 is a region in which the reconstruction error is higher than the number of bad units, and in such a case, random characteristics of the feature F may be large. Therefore, in order that the accuracy of clustering can be maintained high, there is a need to exclude the first region in the clustering later. Therefore, the features F located in the first region A1 may be determined to be invalid.
- In contrast, the second region A2 adjacent to the third straight line S3 is a region in which the reconstruction error is lower than the number of bad units, and the pattern characteristics of the feature F may be large. Therefore, the second region may be subject to clustering later, and the meaning stored in a storage device may be significant.
- That is, the fourth feature F4 belonging to the first region A1 is excluded in the clustering later, and the first feature F1, the second feature F2 and the third feature F3 not belonging to the first region A1 are left and may be subject to clustering later. Therefore, the features F located in the second region A2 may be determined to be valid.
- The method for analyzing the wafer map according to some embodiments of the present disclosure may also determine the validity, using a method different from
FIG. 5 . - Specifically, referring to
FIGS. 4 and 6 , the validity may be determined, using a distribution chart illustrating the reconstruction error and the number of features. - When a horizontal axis is defined as a reconstruction error and a vertical axis is defined as the number of axis features, the distribution chart as in
FIG. 6 may be illustrated. Of course, the above distribution chart may have a Gaussian distribution as illustrated inFIG. 6 , but it may have another form of distribution chart. - Here, the reconstruction error may mean the aforementioned Abs (X-X′), that is, the difference between the reconstructed wafer map X′ and the wafer map X. Although there is only one feature F corresponding to one wafer, since multiple wafer maps X and multiple reconstructed wafer map X′ correspond to one wafer, the reconstruction error may be a cumulative value of a single wafer or a representative value of other methods (e.g., an average value and a median value).
- The number of features may mean the number of features F in which the numeral values of reconstruction errors are the same or similar. Therefore, it may mean a feature having a larger reconstruction error toward the right side of the horizontal axis of
FIG. 6 . - The reference line C1 may be a reference for defining the degree of reconstruction error of feature F to be excluded from clustering later. Depending on the reference line C1, the distribution chart of
FIG. 6 may be divided into a maintenance region E1 and an exclusion region E2. - Since the feature F belonging to the maintenance region E1 has a relatively low reconstruction error, the pattern characteristics may be strong. Conversely, the features belonging to the exclusion region E2 have a relatively high reconstruction error, random characteristics may be strong. A feature F may therefore be determined valid or invalid using reconstruction errors of features.
- This may be attributed to the learning method for auto-encoding. The auto-encoding is learned by the neural network to improve accuracy. As the pattern is similar, the learning amount of the neural network increases, and the reconstruction error decreases. Conversely, if there is a dissimilar pattern with the strong random characteristic, since the learning amount of the neural network is small, the reconstruction errors may increase.
- Therefore, the features F located in the maintenance region E1 may be determined to be valid, and the features F located in the exclusion region E2 may be determined to be invalid.
- In the method for analyzing the wafer map according to some embodiments of the present disclosure, since it is possible to exclude features with strong random characteristics through the above-described validity determination process, more accurate clustering may be performed, and as a result, the wafer map may be analyzed later, using data with no noise.
- Referring again to
FIG. 1 , clustering is performed based on unsupervised learning (S400). - The clustering means a method for classifying data into multiple groups based on concepts such as similarity. In other words, the clustering means a method for classifying feature groups from which some features are excluded for each type based on similarity via the validity determination (S300).
- Specifically, referring to
FIG. 7 , the clustering may be performed in dimensions formed in accordance with the number of channels. That is, in the case of two channels, the clustering may be performed in consideration of a two-dimensional distance. If there are four channels as mentioned above, the clustering may be performed in a Z space having the four dimensions. For the sake of convenience, this procedure will be described below assuming that there are two channels. - When there are two channels, namely, a first channel Ch1 and a second channel Ch2, the clustering may be performed in a two-dimensional space. The feature group includes the first feature to third feature F1 to F3, and each feature may be defined as each group based on the distance therebetween or the like.
- The unsupervised learning-based clustering method may vary. As an example, the clustering algorithm of this embodiment may include at least one of KNN (K-Nearest Neighbor), K-Means, Kohenen, VQ (learning vector quantization), C-Means and t-SNE (t-Distributed Stochastic Neighbor Embedding). However, the present disclosure is not limited thereto.
- Specifically, referring to
FIG. 7 , all the first feature F1 to third feature F3 may belong to the first group G1. Other features may also belong to the second group G2 and the third group G3 close to each other. Each of the groups G1 to G3 may each have a cluster center. While the concept of a center can be visualized for a two-dimensional or n-dimensional space, the center may itself correspond to a central value or a range of central values along an axis that defines any dimension in the n-dimensional space. - The cluster center of the first group G1 may be calculated by a distance between the first feature F1 to third feature F3, that is, the first distance D1, the second distance D2 and the third distance D3. If there are features other than the first feature F1 to third feature F3 in the first group G1, the cluster center may be calculated in consideration of the distance to the feature.
- Here, the “distance” including the first distance D1 to third distance D3 means a distance in two-dimensions when there are two channels, and the distance may mean a distance in n-dimensions when there are n-channels.
- The first center feature CF1 may be a feature corresponding to the cluster center. That is, there is a high possibility that the first center feature CF1 is a virtual value. That is to say, as long as there is no feature at the position of the cluster center by accident, the cluster center is a calculated value that did not exist, and thus, the first center feature CF1 may also be a virtual feature that is generated by the calculated center.
- Referring again to
FIG. 1 , a representative image for each type, that is, for each group, is generated (S500). - Specifically, referring to
FIG. 8 , the first center feature CF1 may be reconstructed into the first representative image RI1. As a method for reconstruction, it is possible to use a method using a decoder of the above-described auto encoder. - Although it is not illustrated in
FIG. 8 , as described above, since each feature has multiple channels, the first center feature CF1 may naturally have multiple first representative images RI1 in accordance with the multiple channels. - Since there is a high possibility that the first center feature CF1 is a virtual value as described above, there is a high possibility that the first representative image RI1 is also a virtual image. However, in the case of the first center feature CF1, since the first group G1 is highly (accurately) represented and the error occurring when the first center feature CF1 is decoded is small, the possibility of formation of noise in the first representative image RI1 may be minimized.
- If both the first feature F1 to third feature F3 are reconstructed and the first wafer map R1 to third reconstructed wafer map R3 are captured or generated in order to form a representative image of the first group G1, and the reconstructed first wafer map R1 to reconstructed third reconstructed wafer map R3 are combined by any method, the representative image may lose the representativeness of the first group G1, while the noises formed in the decoding process over three times re superimposed. As a result, the accuracy of analysis of the wafer map according to the representative images may be lowered later.
- Therefore, the method for analyzing the wafer map according to the present embodiment may minimize noise, using a method for extracting a representative image by the use of a virtual center value, and may obtain cluster data close to actual data.
- Referring again to
FIG. 1 , code is assigned to each representative image and stored therein (S600). - Specifically, referring to
FIG. 9 , the first representative image RI1 is specified as a first code (Code 1). The second representative image (RI2) may be specified as a second code (Code 2). The third representative image RI3 may be specified as a third code (Code 3). - The code may allow a representative image to be searched by calling a representative image in the storage device and using an indexing function later. In addition, characteristics of each representative image may be stored together depending on the code, and problems of process and facility can be easily traced in the case of being similar to a specific code. Thus, the code can be used to isolate a source for manufactured semiconductors later, such as when a defect is detected or being investigated.
- In addition, when the representative image to be generated later is similar to the coded representative image, it is possible to easily perform clustering of the representative images by assigning similar or identical codes.
- In the method for analyzing the wafer map according to some embodiments of the present disclosure, by, e.g., a processor, simultaneously auto-encoding multiple wafer maps to extract one feature, it is possible to obtain a feature that is highly representative based on the correlation between the respective parameters.
- Also, a precise work can be executed based on one feature in the validity determination or clustering later.
- Through the work of validity determination, by excluding features with low pattern characteristics, that is, features with high random characteristics, clustering efficiency may be improved, and the significance of data may be improved.
- Furthermore, the method for analyzing the wafer map according to the present embodiment reconstructs the central features corresponding to the cluster center, and derives them as representative images to minimize noise due to reconstruction. The method results in generating representative images that are highly representative of clustering.
- Hereinafter, referring to
FIG. 10 , another method for analyzing a wafer map according to some embodiments of the present disclosure will be described. The repeated part of the above explanation will be omitted or simplified. -
FIG. 10 is a flowchart illustrating another method for analyzing the wafer map according to some embodiments of the present disclosure. - Referring to
FIG. 10 , the method for analyzing the wafer map according to the present embodiment may further include a step (S700) of anomaly pattern determination, and a step (S800) of anomaly pattern encoding and storing as compared with the embodiment ofFIG. 1 . Therefore, the steps of S700 and S800 will be mainly described below. - The validity is determined (S300), and it is determined whether the feature determined to be invalid is an anomaly pattern (S700).
- The anomaly pattern may mean an anomaly pattern that is rare or that does not exist in existing learning data. That is, the anomaly pattern may mean a pattern with very little similarity with an anomaly pattern sample stored in advance. Since the anomaly pattern is likely to be caused by serious defects in the manufacturing facility of the semiconductor device, it is necessary to separately detect and store the anomaly pattern. The anomaly pattern may mean a pattern that has strong random characteristics but can intuitively and clearly reflects the cause. For example, if a half of the wafer is a bad unit or the peripheral portions of the wafer are all bad units, the user may intuitively trace the problems of the facility or the process.
- There may be various ways to determine the anomaly pattern. For example, the method for determining the anomaly pattern may include comparison of the pre-stored pattern with the current feature.
- By comparing the pre-stored pattern sample with the current feature, in a case where the numerical value of the similarity is low, the pattern may be determined as the anomaly pattern. If the numerical value of similarity is high, it is possible to determine that the current feature is not an anomaly pattern.
- If the current feature is an anomaly pattern, a code may be assigned to the anomaly pattern and stored therein (S800).
- In the case of the anomaly pattern, the code may be assigned and stored in the feature itself. Alternatively, after the features are decoded by the auto encoder and visualized by the reconstructed wafer map, the code may be assigned thereto and stored.
- The code may allow the anomaly pattern images to be searched, by calling the representative image in the storage device, and using an indexing function later. Further, by storing the characteristics of each anomaly pattern image together depending on the code, it is possible to easily trace the problems of process and facility when they are similar to a specific code.
- Hereinafter, a wafer map analyzer according to some embodiments of the present disclosure will be described with reference to
FIGS. 4 to 9, 11, and 12 . The repeated parts of the above description will be omitted or simplified. -
FIG. 11 is a block diagram illustrating a wafer map analyzer according to some embodiments of the present disclosure, andFIG. 12 is a block diagram illustrating the operation of the wafer map analyzer according to some embodiments of the present disclosure in detail. - Referring to
FIGS. 4 to 9, 11 and 12 , awafer map analyzer 100 according to some embodiments of the present disclosure includes aprocessor 10, anon-volatile memory 20, avolatile memory 40, and abus 50. - The
processor 10 may be a processor of a neural network. The neural network means a network provided by modelling the structure of the human brain, which is made up of a number of artificial neurons, and in which the respective neurons are connected to one another by connection strength and weight. Therefore, the neural network processor should have excellent ability in the parallel distributed processing, computing ability, and learning. The neural network processor may also be suitable for controlling complicated nonlinear systems, and may provide an output to the unsupervised learning. - The
non-volatile memory 20 may receive the transmission of the wafer map X and store the wafer map X therein. The wafer map X may be processed to other data by theprocessors 10 later. Thenon-volatile memory 20 may store theprogram 45 therein. - The
volatile memory 40 may be utilized as a temporary memory for the operation of theprocessor 10.Program 45 may be loaded into thevolatile memory 40. Theprogram 45 may be loaded into thevolatile memory 40 by the instruction of theprocessor 10 in the state of being stored in thenon-volatile memory 20. - The
bus 50 may mutually connect theprocessor 10, thenon-volatile memory 20, and thevolatile memory 40. That is, all the movement of data and request may be performed through thebus 50. - The
processor 10 may perform theprogram 45 loaded to thevolatile memory 40. Theprogram 45 includes sequential operations. - Referring to
FIGS. 4 to 9 and 12 , theprogram 45 includes anauto encoder 101, afeature filter 102, ananomaly pattern detector 210, aclustering machine 103, and acode allocator 104. - The
program 45 is performed by theprocessor 10, and each of theauto encoder 101, thefeature filter 102, theanomaly pattern detector 210, theclustering machine 103 and thecode allocator 104 may process data by theprocessor 10. - The
auto encoder 101 may receive the input of the wafer map X to extract the feature F. Theauto encoder 101 may perform auto-encoding of multiple wafer maps X using multiple channels, i.e.,Channel 1 toChannel 4, at the same time to extract them as a single feature F. The first feature F1 may be reconstructed as the reconstructed wafer map X′ by theauto encoder 101. Theauto encoder 101 may derive a reconstruction error (Abs (X-X′)) which is a difference between the reconstructed wafer map X′ and the wafer map X. - The
feature filter 102 may determine the validity of the feature F to exclude invalid features F from the overall feature group, while leaving only the valid feature F. Thefeature filter 102 may perform filtering, using the reconstruction error and the bad unit number, (FIG. 5 ), or may perform filtering, using distribution of features due to reconstruction error (FIG. 6 ). However, the present disclosure is not limited thereto. - The
anomaly pattern detector 210 may determine whether the feature F determined to be an invalid feature F by thefeature filter 102 is an anomaly pattern. - The anomaly pattern may mean a pattern that is rare or that does not exist in the existing learning data. That is, the anomaly pattern may mean a pattern with very little similarity with a pre-stored pattern. Since the anomaly pattern is likely to be caused by serious defects in the manufacturing facility of the semiconductor device, it is necessary to separately detect and store the anomaly pattern. Therefore, the
anomaly pattern detector 210 may detect the anomaly pattern and may transmit it to theauto encoder 101. - The
clustering machine 103 may cluster the valid feature F passing through thefeature filter 102. Theclustering machine 103 may perform clustering in a Z space having a dimension corresponding to the number of channels. - When multiple groups (G1 to G3) is determined in accordance with the clustering, the
clustering machine 103 may generate a center feature CF corresponding to the center of each group. Theclustering machine 103 may transmit the center feature CF to theauto encoder 101. - The
auto encoder 101 may reconstruct the center feature CF via the decoding function to generate a representative image (R.I.). Theauto encoder 101 may transmit the representative image (R.I.) to thecode allocator 104. - Further, the
auto encoder 101 may reconstruct an anomaly pattern via the decode function to generate a reconstructed wafer map anomaly pattern X′. Theauto encoder 101 may transmit the reconstructed wafer map anomaly pattern X′ to thecode allocator 104. - The
code allocator 104 may assign each code to the representative image (R.I.). Thecode allocator 104 may also allocate a code to the reconstructed wafer map anomaly pattern X′. - The code means the name of the representative image (R.I.) or the anomaly pattern stored in the
non-volatile memory 20, and allows retrieval of the representative image (R.I.) and the anomaly pattern, using an indexing function later. Further, by storing characteristics of each representative image or the anomaly patterns together depending on the code, when a wafer map similar to the representative image (R.I.) or the anomaly pattern corresponding to a specific code is detected, it is possible to easily trace the problems of the process and the facility. - The
code allocator 104 may store the anomaly pattern and the code in thenon-volatile memory 20. - Hereinafter, a method for manufacturing a semiconductor device according to some embodiments of the present disclosure will be described with reference to
FIGS. 2, 3, 9, 13 , and 14. The repeated parts of the above explanation will be omitted or simplified. -
FIG. 13 is a flow chart illustrating a method for manufacturing a semiconductor device according to some embodiments of the present disclosure, andFIG. 14 is a block diagram illustrating a method for manufacturing the semiconductor device according to some embodiments of the present disclosure. - Referring to
FIG. 13 , a wafer is manufactured (S1100). - Wafer W means a silicon substrate used in the process of manufacturing the semiconductor device. A semiconductor device such as a transistor is formed on the surface of the wafer W, and may be diced and separated into multiple chips later.
- Several patterns such as transistors and diodes may be formed on the surface of the wafer, through multiple semiconductor manufacturing processes. The semiconductor manufacturing process may include various processes such as a vapor deposition process, an etching process, a plasma process, and an implant process.
- Specifically, referring to
FIG. 13 , thesemiconductor manufacturing facility 30 may manufacture a semiconductor device, that is, a wafer therein. Thesemiconductor manufacturing facility 30 is a semiconductor fabrication facility, in which the wafer is fabricated. - Subsequently, a wafer map is formed (S1200).
- Specifically, referring to
FIGS. 2 and 3 , the wafer map X may be an image mapped by displaying the goodness and badness for each of the units C1 and C2 in a plan view of the wafer W. Multiple wafer maps X may be captured or generated in a single wafer. That is, different wafer maps X may be captured or generated in accordance with the respective channels, i.e., ofChannel 1 toChannel 4. Specifically, a first wafer map M1 may be captured or generated in theChannel 1, and a second wafer map M2 may be captured or generated in theChannel 2. A third wafer map M3 may be captured or generated in theChannel 3, and a fourth wafer map M4 may be captured or generated in theChannel 4. - Referring to
FIG. 14 , thesemiconductor manufacturing facility 30 may transmit the wafer map acquired through the wafer to thewafer map analyzer 100. - Referring again to
FIG. 13 , the wafer map X is compared with the representative image (S1300). - Referring to
FIG. 9 , the wafer map X may be compared with the first representative image (RI1) to third representative image (RI3) stored in advance. Since the first representative image (RI1) to third representative image (RI3) stored in advance are the wafer maps reconstructed in the auto-encoded feature, the first representative image (RI1) to third representative image (RI3) may be immediately compared with the wafer map X. Also, since there are multiple representative images, i.e., first representative image (RI1) to third representative image (RI3), in accordance with each channel, it is possible to compare the wafer map X of the same channel with the first representative image (RI1) to third representative image (RI3). - Referring to
FIG. 14 , thewafer map analyzer 100 may compare the wafer map X with the representative image. The first representative image (RI1) to third representative image (RI3) may have previously assigned codes. Therefore, the wafer map X may be compared with a code having the representative image most similar to the wafer map X among multiple codes. - The characteristics of the code and the representative image to which the code is assigned are stored together, and it is possible to easily trace how a part of the facility or process acts accordingly.
- Subsequently, the defects of the manufacturing facility are detected (S1400).
- Specifically, referring to
FIG. 14 , thewafer map analyzer 100 may detect the defects in thesemiconductor manufacturing facility 30. Alternatively, thewafer map analyzer 100 may detect the defects in the semiconductor manufacturing process. - In other words, in the representative image assigned with the code, it is possible to investigate which type of process defect exists in the wafer formed as such a representative image, and when there is a problem in some parts of the manufacturing facility, whether the representative image is formed.
- As a result, in the case of a wafer having a wafer map X similar to the representative image, it is possible to easily trace defects on the previously investigated process or facility. Thus, the method for manufacturing a semiconductor device according to some embodiments of the present disclosure can precisely complement the problems in the process and facility.
- While the present disclosure has been particularly illustrated and described with reference to exemplary embodiments thereof, it will be understood by those of ordinary skill in the art that various changes in form and detail may be made therein without departing from the spirit and scope of the present disclosure as defined by the following claims. The exemplary embodiments should be considered in a descriptive sense only and not for purposes of limitation.
Claims (20)
1. A wafer map analyzer, comprising:
a storage device which stores a wafer map of a semiconductor wafer; and
a processor connected to the storage device,
wherein the processor extracts features from the wafer map, determines validity of the features, clusters the features to classify the features into multiple classified types, generates a feature having a center value for each of the classified types, and reconstructs the feature into a wafer map to generate a representative image of the type, and
the storage device stores the representative image for each type.
2. The wafer map analyzer of claim 1 , wherein a plurality of wafer maps having different characteristics corresponds to a single wafer map.
3. The wafer map analyzer of claim 2 , wherein the processor simultaneously auto-encodes all the plurality of wafer maps corresponding to the single wafer to extract one feature for each wafer.
4. The wafer map analyzer of claim 1 , wherein the processor determines the validity, using a reconstruction error of the feature.
5. The wafer map analyzer of claim 4 , wherein the wafer map comprises a plurality of units having good values or bad values, and
wherein the processor determines the validity considering the reconstruction error and a number of units having the bad values.
6. The wafer map analyzer of claim 1 , wherein the storage device assigns a code to the representative image for each type and stores the code.
7. The wafer map analyzer of claim 1 , wherein the processor clusters the features to classify the features into multiple classified types based on unsupervised learning.
8. A wafer map analyzer, comprising:
a non-volatile memory which stores a program and a wafer map of a semiconductor wafer;
a volatile memory to which the program is loaded;
a processor which executes the program; and
a bus which connects the processor, the non-volatile memory and the volatile memory,
wherein the program includes:
an auto encoder which automatically encodes a wafer map to extract a feature,
a feature filter which determines validity of the feature for clustering and excludes the feature when the feature is not valid,
a clustering machine which performs clustering of the feature into a group and generates a center feature of the group according to the clustering;
a code allocator which allocates a code to a representative image corresponding to the center feature and stores the code in the non-volatile memory.
9. The wafer map analyzer of claim 8 , wherein the auto encoder reconstructs the center feature to generate the representative image, and the code is searchable to identify the semiconductor wafer mapped by the wafer map.
10. The wafer map analyzer of claim 8 , further comprising:
an anomaly pattern detector which determines whether an invalid feature is an anomaly pattern.
11. The wafer map analyzer of claim 10 , wherein the auto encoder reconstructs the anomaly pattern to generate a reconstructed wafer map anomaly pattern.
12. The wafer map analyzer of claim 11 , wherein the code allocator allocates a code to the reconstructed wafer map anomaly pattern, and stores the code in the non-volatile memory.
13. A method for analyzing wafer maps of semiconductor wafers, the method comprising:
forming a plurality of wafer maps for a plurality of wafers, respectively;
auto-encoding the plurality of wafer maps to extract a plurality of features corresponding to the plurality of wafers;
excluding invalid features not valid for classification among the plurality of features;
classifying valid features among the plurality of features into a plurality of types using unsupervised learning;
generating a plurality of center features corresponding to respective centers of the plurality of types; and
reconstructing the plurality of center features to output a representative image.
14. The method of claim 13 , wherein a plurality of wafer maps having different characteristics corresponds to a single wafer map.
15. The method of claim 14 , wherein extracting the plurality of features comprises:
simultaneously auto-encoding all the plurality of wafer maps corresponding to the single wafer to extract one feature for each wafer.
16. The method of claim 13 , wherein excluding the invalid features among the plurality of features comprises:
determining validity, using a reconstruction error of each feature.
17. The method of claim 13 , wherein the wafer map comprises a plurality of units having good values or bad values, and
determining wherein excluding the invalid features among the plurality of features includes considering the reconstruction error and a number of units having the bad values.
18. The method of claim 13 , further comprising:
determining whether the invalid feature among the plurality of features is an anomaly pattern and storing the invalid feature in a storage device.
19. The method of claim 18 , wherein determining whether the invalid feature is the anomaly pattern comprises:
comparing an anomaly pattern sample stored in advance with an invalid feature among the plurality of features.
20. The method of claim 13 , further comprising:
specifying a code of the representative image and storing the code in a storage device.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US18/201,841 US20230298154A1 (en) | 2017-08-11 | 2023-05-25 | Wafer map analyzer, method for analyzing wafer map using the same and method for manufacturing semiconductor device |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10-2017-0102035 | 2017-08-11 | ||
KR1020170102035A KR102440695B1 (en) | 2017-08-11 | 2017-08-11 | Wafer map analyzer, Method for analyzing wafer map using the same and Method for manufacturing semiconductor device |
US15/960,701 US11688050B2 (en) | 2017-08-11 | 2018-04-24 | Wafer map analyzer, method for analyzing wafer map using the same and method for manufacturing semiconductor device |
US18/201,841 US20230298154A1 (en) | 2017-08-11 | 2023-05-25 | Wafer map analyzer, method for analyzing wafer map using the same and method for manufacturing semiconductor device |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/960,701 Continuation US11688050B2 (en) | 2017-08-11 | 2018-04-24 | Wafer map analyzer, method for analyzing wafer map using the same and method for manufacturing semiconductor device |
Publications (1)
Publication Number | Publication Date |
---|---|
US20230298154A1 true US20230298154A1 (en) | 2023-09-21 |
Family
ID=65275410
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/960,701 Active 2038-12-09 US11688050B2 (en) | 2017-08-11 | 2018-04-24 | Wafer map analyzer, method for analyzing wafer map using the same and method for manufacturing semiconductor device |
US18/201,841 Pending US20230298154A1 (en) | 2017-08-11 | 2023-05-25 | Wafer map analyzer, method for analyzing wafer map using the same and method for manufacturing semiconductor device |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/960,701 Active 2038-12-09 US11688050B2 (en) | 2017-08-11 | 2018-04-24 | Wafer map analyzer, method for analyzing wafer map using the same and method for manufacturing semiconductor device |
Country Status (4)
Country | Link |
---|---|
US (2) | US11688050B2 (en) |
KR (1) | KR102440695B1 (en) |
CN (1) | CN109390245B (en) |
TW (1) | TWI811218B (en) |
Families Citing this family (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111742274B (en) * | 2018-02-28 | 2024-04-30 | 罗伯特·博世有限公司 | Intelligent audio analysis device (IAAA) and method for spatial systems |
US11029359B2 (en) * | 2018-03-09 | 2021-06-08 | Pdf Solutions, Inc. | Failure detection and classsification using sensor data and/or measurement data |
JP7273556B2 (en) * | 2019-03-15 | 2023-05-15 | 株式会社東芝 | Analysis system, analysis method, program, and storage medium |
KR102805684B1 (en) | 2019-05-29 | 2025-05-09 | 삼성에스디에스 주식회사 | Method and apparatus for wafer defect pattern detection based on unsupervised learning |
CN112446887B (en) * | 2019-09-05 | 2022-04-08 | 长鑫存储技术有限公司 | Wafer cutting wafer number calculating method and calculating equipment |
US11775840B2 (en) | 2019-11-26 | 2023-10-03 | Samsung Electronics Co., Ltd. | Non-transitory computer-readable medium storing program code generating wafer map based on generative adversarial networks and computing device including the same |
EP3862927A1 (en) * | 2020-02-05 | 2021-08-11 | Another Brain | Anomaly detector, method of anomaly detection and method of training an anomaly detector |
TWI754911B (en) * | 2020-03-31 | 2022-02-11 | 世界先進積體電路股份有限公司 | System and method for determining cause of abnormality in semiconductor manufacturing processes |
US11404331B2 (en) | 2020-06-29 | 2022-08-02 | Vanguard International Semiconductor Corporation | System and method for determining cause of abnormality in semiconductor manufacturing processes |
JP7527902B2 (en) | 2020-09-04 | 2024-08-05 | キオクシア株式会社 | Information processing device |
JP7046150B1 (en) * | 2020-12-03 | 2022-04-01 | Ckd株式会社 | Substrate foreign matter inspection device and substrate foreign matter inspection method |
CN112397410B (en) * | 2020-12-08 | 2021-05-14 | 晶芯成(北京)科技有限公司 | Wafer failure analysis method and system |
JP2023050857A (en) * | 2021-09-30 | 2023-04-11 | オムロン株式会社 | Image inspection method and image inspection apparatus |
CN117173074A (en) * | 2022-05-24 | 2023-12-05 | 鸿海精密工业股份有限公司 | Defect detection methods, electronic equipment and storage media |
TWI810945B (en) * | 2022-05-24 | 2023-08-01 | 鴻海精密工業股份有限公司 | Method for detecting defects, computer device and storage medium |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20200356011A1 (en) * | 2017-09-08 | 2020-11-12 | Asml Netherlands B.V. | Training methods for machine learning assisted optical proximity error correction |
US20210334946A1 (en) * | 2020-04-24 | 2021-10-28 | Camtek Ltd. | Method and system for classifying defects in wafer using wafer-defect images, based on deep learning |
US20230298137A1 (en) * | 2020-09-29 | 2023-09-21 | Hitachi High-Tech Corporation | Image restoration system and image restoration method |
Family Cites Families (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5787190A (en) * | 1995-06-07 | 1998-07-28 | Advanced Micro Devices, Inc. | Method and apparatus for pattern recognition of wafer test bins |
US6091846A (en) * | 1996-05-31 | 2000-07-18 | Texas Instruments Incorporated | Method and system for anomaly detection |
US6622135B1 (en) * | 1998-12-29 | 2003-09-16 | International Business Machines Corporation | Method for detecting and classifying anomalies using artificial neural networks |
JP4310090B2 (en) * | 2002-09-27 | 2009-08-05 | 株式会社日立製作所 | Defect data analysis method and apparatus, and review system |
KR100574648B1 (en) * | 2003-09-25 | 2006-04-27 | 동부일렉트로닉스 주식회사 | Defect Type Classification Method and System |
KR20070018880A (en) * | 2004-02-06 | 2007-02-14 | 테스트 어드밴티지 인코포레이티드 | Method and apparatus for data analysis |
KR101195226B1 (en) | 2005-12-29 | 2012-10-29 | 삼성전자주식회사 | Semiconductor wafer analysis system |
TW200849436A (en) * | 2007-06-01 | 2008-12-16 | King Yuan Electronics Co Ltd | Method for wafer analysis with artificial neural network and system thereof |
KR20090070235A (en) | 2007-12-27 | 2009-07-01 | 주식회사 동부하이텍 | How to classify same wafer type as wafer map |
US7937234B2 (en) | 2008-08-29 | 2011-05-03 | Intel Corporation | Classification of spatial patterns on wafer maps |
KR101808819B1 (en) * | 2011-08-16 | 2017-12-13 | 삼성전자주식회사 | Test map classification method and fabrication process condition setting method using the same |
US20140303912A1 (en) | 2013-04-07 | 2014-10-09 | Kla-Tencor Corporation | System and method for the automatic determination of critical parametric electrical test parameters for inline yield monitoring |
US9098891B2 (en) * | 2013-04-08 | 2015-08-04 | Kla-Tencor Corp. | Adaptive sampling for semiconductor inspection recipe creation, defect review, and metrology |
KR101542558B1 (en) | 2014-01-08 | 2015-08-06 | 주식회사 비스텔 | Method for analyzing wafer yield map and recording medium |
US9401016B2 (en) * | 2014-05-12 | 2016-07-26 | Kla-Tencor Corp. | Using high resolution full die image data for inspection |
US10365639B2 (en) * | 2016-01-06 | 2019-07-30 | Kla-Tencor Corporation | Feature selection and automated process window monitoring through outlier detection |
-
2017
- 2017-08-11 KR KR1020170102035A patent/KR102440695B1/en active Active
-
2018
- 2018-04-24 US US15/960,701 patent/US11688050B2/en active Active
- 2018-05-14 TW TW107116244A patent/TWI811218B/en active
- 2018-08-09 CN CN201810902836.9A patent/CN109390245B/en active Active
-
2023
- 2023-05-25 US US18/201,841 patent/US20230298154A1/en active Pending
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20200356011A1 (en) * | 2017-09-08 | 2020-11-12 | Asml Netherlands B.V. | Training methods for machine learning assisted optical proximity error correction |
US20210334946A1 (en) * | 2020-04-24 | 2021-10-28 | Camtek Ltd. | Method and system for classifying defects in wafer using wafer-defect images, based on deep learning |
US20230298137A1 (en) * | 2020-09-29 | 2023-09-21 | Hitachi High-Tech Corporation | Image restoration system and image restoration method |
Also Published As
Publication number | Publication date |
---|---|
US20190050979A1 (en) | 2019-02-14 |
KR102440695B1 (en) | 2022-09-05 |
CN109390245A (en) | 2019-02-26 |
US11688050B2 (en) | 2023-06-27 |
KR20190017344A (en) | 2019-02-20 |
TW201910795A (en) | 2019-03-16 |
TWI811218B (en) | 2023-08-11 |
CN109390245B (en) | 2024-03-12 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20230298154A1 (en) | Wafer map analyzer, method for analyzing wafer map using the same and method for manufacturing semiconductor device | |
US12387318B2 (en) | Hot spot defect detecting method and hot spot defect detecting system | |
Tao et al. | Deep learning for unsupervised anomaly localization in industrial images: A survey | |
US20230386021A1 (en) | Pattern grouping method based on machine learning | |
Liu et al. | Automated visual inspection system for bogie block key under complex freight train environment | |
US6104835A (en) | Automatic knowledge database generation for classifying objects and systems therefor | |
CN113808138B (en) | Artificial intelligence-based wire and cable surface defect detection method | |
CN113129257A (en) | Apparatus and method for determining wafer defects | |
CN112805719B (en) | Classifying defects in semiconductor samples | |
US9189841B2 (en) | Method of checking the appearance of the surface of a tyre | |
CN114170184A (en) | Product image anomaly detection method and device based on embedded feature vector | |
CN101718528A (en) | Digital image based rapid solving method of circle parameters | |
JP2017173098A (en) | Image processing apparatus and image processing method | |
CN114139618A (en) | Signal dependent noise parameter estimation method based on improved density peak clustering | |
CN116678418A (en) | Improved laser SLAM quick loop-back detection method | |
CN117291843A (en) | Efficient management method for image database | |
CN117786565A (en) | Method and device for determining semiconductor abnormal chip and electronic equipment | |
CN116342422A (en) | Defect identification method based on wafer map denoising | |
CN115063385B (en) | A machine vision method for wafer inspection | |
KR20220027674A (en) | Apparatus and Method for Classifying States of Semiconductor Device based on Deep Learning | |
CN116757713A (en) | Work estimation method, device, equipment and storage medium based on image recognition | |
Mishne et al. | Multi-channel wafer defect detection using diffusion maps | |
García et al. | A configuration approach for convolutional neural networks used for defect detection on surfaces | |
CN118196730B (en) | Method, device, equipment and storage medium for processing vehicle image data | |
KR20230123220A (en) | Semiconductor wafer analysis apparatus and operating method semiconductor wafer analysis apparatus |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STPP | Information on status: patent application and granting procedure in general |
Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION |