The current application is related to co-pending U.S. patent application Ser. No. 12/021,527, filed on Jan. 29, 2008, which is hereby incorporated by reference.
1. Technical Field
The present disclosure relates generally to the field of computational algorithm used in lithography and optical proximity correction (OPC).
2. Background Art
To ensure that specific features of very large scale integrated circuits can be printed, mask shapes most often require manipulation to ensure manufacturability. Very often, this means that the original layout representing the designers' intent bears little or no relationship to mask shapes created to ensure target dimensions are achieved on wafer. These shapes are chosen during OPC to maximize pattern transfer to the wafer and a process window. Square contacts in layout design have a rich history in the semiconductor industry. In fact, they have been used almost exclusively to simplify the manufacturing process of the mask as well as to transfer contacts to a wafer. Due to increased technology demands and ever shrinking ground rules, the use of single sized contact structures has been relaxed to include several different geometries for contacts. In particular, current technology critical dimensions are challenging the resolution of current lithographic tooling resulting in severe pattern dependent instabilities and severely reduced process windows for single size contact configurations. As such, mask critical dimension (CD) tolerance specifications for contact levels that use square contacts need to be extremely tight (compared to line levels) to accommodate high two-dimensional mask error enhancement factor (MEEF). Even if single point contrast and depth of focus (DOF) were acceptable, much higher MEEF in combination with typical mask manufacturing CD errors are limiting across chip line variation (ACLV) and would require non-competitive mask specifications.
Since MEEF is to the first order driven by mask dimensions, mask error factors are compounded for square contacts since they are inherently two-dimensional features. There exist several options to overcome these difficulties—none of which provide complete solutions for shrinking contact configurations: 1) Avoid square or effectively square contact targets of minimum dimensions at minimum pitches. This approach is often not feasible due to circuit related contact requirements (see German patent DE10126130A1). 2) Tighten mask CD tolerance specifications. This approach is often not possible since mask making tool sets are typically operated at their limits. Additionally, mask costs will increase if tolerance specifications are tightened because more mask manufacturing resources will be required to create masks that meet more aggressive tolerance specifications. 3) Change illumination conditions. In a real world manufacturing environment, there is typically not much to gain with this approach without significantly sacrificing overall process window.
Overall, in a world with optical proximity effects, non-negligible corner rounding, and 1-dimensional MEEF values already significantly larger than 1.0, the advantages of using single contact geometries are significantly diminished by increased manufacturing costs and decreased process windows.
A method is disclosed that purposely relaxes OPC algorithm constraints to allow post OPC mask shapes to elongate along one direction (particularly lowering the 1-dimensional MEEF in a direction with the result of an effectively overall lowered MEEF) to produce a pattern on wafer that is circular to within an acceptable tolerance. This approach works best in combination with lithographic underexposure schemes. However, the teachings of the disclosure are not limited to underexposure schemes, but could also similarly be applied to overexposure schemes if a lithographic overexposure was beneficial to the overall process. There is an improvement in MEEF (that directly translates into decreased wafer CD tolerances if all considered process errors such as defocus, dose error, and mask CD error are kept constant) as a function of pitch if using rectangular mask shapes for contacts versus squares but approximately printing the same circular contact in resist on wafer.
A first aspect of the disclosure provides a method comprising: obtaining a target layout including at least one substantially square target shape having four edges; modifying the at least one substantially square target shape in the target layout to form a rectangular shape by at least one of: moving at least one edge of the substantially square target shape in the target layout or pre-defining at least one dimension of a final modified mask layout; and performing an optical proximity correction (OPC) on the target layout after the modifying to produce the final modified mask layout having a pattern that will form the rectangular shape circular to within a predefined tolerance when the final modified mask layout is transferred into a resist layer.
A second aspect of the disclosure provides a system comprising: at least one computing device; an obtainer for obtaining a target layout including at least one substantially square target shape having four edges; a modifier for modifying the at least one substantially square target shape in the target layout to form a rectangular shape by at least one of: moving at least one edge of the substantially square target shape in the target layout or pre-defining at least one dimension of a final modified mask layout; and an optical proximity correction (OPC) module for performing an optical proximity correction on the target layout after the modifying to produce the final modified mask layout having a pattern that will form the rectangular shape circular to within a predefined tolerance when the final modified mask layout is transferred into a resist layer.
A third aspect of the disclosure provides a program product for performing the above-identified method.
The illustrative aspects of the present disclosure are designed to solve the problems herein described and/or other problems not discussed.
These and other features of this disclosure will be more readily understood from the following detailed description of the various aspects of the disclosure taken in conjunction with the accompanying drawings that depict various embodiments of the disclosure, in which:
It will be appreciated that for simplicity and clarity of illustration, elements shown in the drawings have not necessarily been drawn to scale. For example, the dimensions of some of the elements may be exaggerated relative to other elements for clarity. The drawings are intended to depict only typical aspects of the disclosure, and therefore should not be considered as limiting the scope of the disclosure. In the drawings, like numbering represents like elements between the drawings.
This disclosure presents OPC target manipulation in conjunction with optimized OPC schemes to reliably print contact shapes. In addition, this scheme will enable more compact layouts and will avoid design rule restrictions that would ordinarily be forced by mask rule and process constraints.
As
Turning to
Although not shown in
Also, as shown in
Although
It is also understood that the modified OPC of this disclosure need not be implemented on every OPC target on a mask. Turning to
In another embodiment, the modified OPC of this disclosure is applied to all of the contacts on the mask, as shown in
As
As will be appreciated by one skilled in the art, the present disclosure may be embodied as a system, method or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, the present disclosure may take the form of a computer program product embodied in any tangible medium of expression having computer-usable program code embodied in the medium.
Any combination of one or more computer usable or computer readable medium(s) may be utilized. The computer-usable or computer-readable medium may be, for example but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, device, or propagation medium. More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a transmission media such as those supporting the Internet or an intranet, or a magnetic storage device. Note that the computer-usable or computer-readable medium could even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via, for instance, optical scanning of the paper or other medium, then compiled, interpreted, or otherwise processed in a suitable manner, if necessary, and then stored in a computer memory. In the context of this document, a computer-usable or computer-readable medium may be any medium that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. The computer-usable medium may include a propagated data signal with the computer-usable program code embodied therewith, either in baseband or as part of a carrier wave. The computer usable program code may be transmitted using any appropriate medium, including but not limited to wireless, wire line, optical fiber cable, RF, etc.
Computer program code for carrying out operations of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
The present disclosure is described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the disclosure. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable medium that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable medium produce an article of manufacture including instruction means which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
Computing device 104 is shown including a memory 112, a processor (PU) 114, an input/output (I/O) interface 116, and a bus 118. Further, computing device 104 is shown in communication with an external I/O device/resource 120 and a storage system 122. As is known in the art, in general, processor 114 executes computer program code, such as MEEF improvement system 106, that is stored in memory 112 and/or storage system 122. While executing computer program code, processor 114 can read and/or write data, such as an original OPC target layout 140, to/from memory 112, storage system 122, and/or I/O interface 116. Bus 118 provides a communications link between each of the components in computing device 104. I/O device 118 can comprise any device that enables a user to interact with computing device 104 or any device that enables computing device 104 to communicate with one or more other computing devices. Input/output devices (including but not limited to keyboards, displays, pointing devices, etc.) can be coupled to the system either directly or through intervening I/O controllers.
In any event, computing device 104 can comprise any general purpose computing article of manufacture capable of executing computer program code installed by a user (e.g., a personal computer, server, handheld device, etc.). However, it is understood that computing device 104 and MEEF improvement system 106 are only representative of various possible equivalent computing devices that may perform the various process steps of the disclosure. To this extent, in other embodiments, computing device 104 can comprise any specific purpose computing article of manufacture comprising hardware and/or computer program code for performing specific functions, any computing article of manufacture that comprises a combination of specific purpose and general purpose hardware/software, or the like. In each case, the program code and hardware can be created using standard programming and engineering techniques, respectively.
Similarly, computer infrastructure 102 is only illustrative of various types of computer infrastructures for implementing the disclosure. For example, in one embodiment, computer infrastructure 102 comprises two or more computing devices (e.g., a server cluster) that communicate over any type of wired and/or wireless communications link, such as a network, a shared memory, or the like, to perform the various process steps of the disclosure. When the communications link comprises a network, the network can comprise any combination of one or more types of networks (e.g., the Internet, a wide area network, a local area network, a virtual private network, etc.). Network adapters may also be coupled to the system to enable the data processing system to become coupled to other data processing systems or remote printers or storage devices through intervening private or public networks. Modems, cable modem and Ethernet cards are just a few of the currently available types of network adapters. Regardless, communications between the computing devices may utilize any combination of various types of transmission techniques.
MEEF improvement system 106 is shown including an obtainer 128, a modifier 130 and an OPC module 132. Operation of each of these systems is discussed further below. However, it is understood that some of the various systems shown in
The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
As discussed herein, various systems and components are described as “obtaining” data (e.g., mask layout 140, etc.). It is understood that the corresponding data can be obtained using any solution. For example, the corresponding system/component can generate and/or be used to generate the data, retrieve the data from one or more data stores (e.g., a database), receive the data from another system/component, and/or the like. When the data is not generated by the particular system/component, it is understood that another system/component can be implemented apart from the system/component shown, which generates the data and provides it to the system/component and/or stores the data for access by the system/component.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of the present disclosure has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the disclosure in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the disclosure. The embodiment was chosen and described in order to best explain the principles of the disclosure and the practical application, and to enable others of ordinary skill in the art to understand the disclosure for various embodiments with various modifications as are suited to the particular use contemplated.
Number | Name | Date | Kind |
---|---|---|---|
5821014 | Chen et al. | Oct 1998 | A |
5847419 | Imai et al. | Dec 1998 | A |
6194104 | Hsu | Feb 2001 | B1 |
6433620 | Mashiko et al. | Aug 2002 | B1 |
6451490 | Advocate et al. | Sep 2002 | B1 |
6453457 | Pierrat et al. | Sep 2002 | B1 |
6562719 | Kondo et al. | May 2003 | B2 |
6605816 | Sandstrom | Aug 2003 | B2 |
6625801 | Pierrat et al. | Sep 2003 | B1 |
6645677 | Sandstrom | Nov 2003 | B1 |
6656646 | Hotta et al. | Dec 2003 | B2 |
6764908 | Kadosh et al. | Jul 2004 | B1 |
6787271 | Cote et al. | Sep 2004 | B2 |
6792590 | Pierrat et al. | Sep 2004 | B1 |
6838216 | Griesinger et al. | Jan 2005 | B2 |
6839125 | Hansen | Jan 2005 | B2 |
6846595 | Smith | Jan 2005 | B2 |
6861183 | Barber | Mar 2005 | B2 |
6873720 | Cai et al. | Mar 2005 | B2 |
6907596 | Kobayashi et al. | Jun 2005 | B2 |
6918104 | Pierrat et al. | Jul 2005 | B2 |
6925202 | Karklin et al. | Aug 2005 | B2 |
6936506 | Buller et al. | Aug 2005 | B1 |
6942958 | Chen et al. | Sep 2005 | B2 |
6961186 | Pierrat et al. | Nov 2005 | B2 |
7003755 | Pang et al. | Feb 2006 | B2 |
7003757 | Pierrat et al. | Feb 2006 | B2 |
7014956 | Chen et al. | Mar 2006 | B2 |
7016017 | Hansen | Mar 2006 | B2 |
7030966 | Hansen | Apr 2006 | B2 |
7058923 | Tounai et al. | Jun 2006 | B2 |
7087476 | Metz et al. | Aug 2006 | B2 |
7093229 | Pang et al. | Aug 2006 | B2 |
7107573 | Yamazoe et al. | Sep 2006 | B2 |
7115343 | Gordon et al. | Oct 2006 | B2 |
7138649 | Currie et al. | Nov 2006 | B2 |
7153634 | Sandstrom | Dec 2006 | B2 |
7155689 | Pierrat et al. | Dec 2006 | B2 |
7180576 | Hansen | Feb 2007 | B2 |
7208357 | Sadaka et al. | Apr 2007 | B2 |
7245356 | Hansen | Jul 2007 | B2 |
7254251 | Cai et al. | Aug 2007 | B2 |
7266800 | Sezginer | Sep 2007 | B2 |
7305651 | Cao | Dec 2007 | B2 |
7323291 | Sandstrom | Jan 2008 | B2 |
7458059 | Stirniman et al. | Nov 2008 | B2 |
7655388 | Tan et al. | Feb 2010 | B2 |
20020050655 | Travis et al. | May 2002 | A1 |
20020125443 | Sandstrom | Sep 2002 | A1 |
20020164064 | Karklin et al. | Nov 2002 | A1 |
20020164065 | Cai et al. | Nov 2002 | A1 |
20020177050 | Tanaka | Nov 2002 | A1 |
20030129502 | Chen et al. | Jul 2003 | A1 |
20030188288 | Kobayashi et al. | Oct 2003 | A1 |
20030198872 | Yamazoe et al. | Oct 2003 | A1 |
20040156030 | Hansen | Aug 2004 | A1 |
20040158808 | Hansen | Aug 2004 | A1 |
20040170906 | Chen et al. | Sep 2004 | A1 |
20040172610 | Liebmann et al. | Sep 2004 | A1 |
20040229169 | Sandstrom | Nov 2004 | A1 |
20040248016 | Lucas et al. | Dec 2004 | A1 |
20050044513 | Robles et al. | Feb 2005 | A1 |
20050076316 | Pierrat et al. | Apr 2005 | A1 |
20050089768 | Tanaka et al. | Apr 2005 | A1 |
20050148195 | Koehle et al. | Jul 2005 | A1 |
20050190957 | Cai et al. | Sep 2005 | A1 |
20050280104 | Li | Dec 2005 | A1 |
20060078805 | Hansen | Apr 2006 | A1 |
20060126046 | Hansen | Jun 2006 | A1 |
20060146307 | Hansen et al. | Jul 2006 | A1 |
20060147813 | Tan et al. | Jul 2006 | A1 |
20060172204 | Peng et al. | Aug 2006 | A1 |
20060228851 | Sadaka et al. | Oct 2006 | A1 |
20060240342 | Tang | Oct 2006 | A1 |
20060266243 | Percin et al. | Nov 2006 | A1 |
20060269851 | Frisa et al. | Nov 2006 | A1 |
20060277520 | Gennari | Dec 2006 | A1 |
20060281016 | O'Brien | Dec 2006 | A1 |
20070009808 | Abrams et al. | Jan 2007 | A1 |
20070038973 | Li et al. | Feb 2007 | A1 |
20070050749 | Ye et al. | Mar 2007 | A1 |
20070101310 | Stirniman et al. | May 2007 | A1 |
20070105029 | Ausschnitt | May 2007 | A1 |
20070105058 | Sandstrom | May 2007 | A1 |
20070121090 | Chen et al. | May 2007 | A1 |
20070292017 | Cai et al. | Dec 2007 | A1 |
20080189673 | Ying | Aug 2008 | A1 |
20090031262 | Maeda et al. | Jan 2009 | A1 |
20100037195 | Becker et al. | Feb 2010 | A1 |
20100180253 | Ying | Jul 2010 | A1 |
20100196805 | Tan et al. | Aug 2010 | A1 |
Number | Date | Country |
---|---|---|
1357426 | Oct 2003 | EP |
1647862 | Apr 2006 | EP |
1793279 | Jun 2007 | EP |
2002116529 | Apr 2002 | JP |
Number | Date | Country | |
---|---|---|---|
20100042967 A1 | Feb 2010 | US |