Overlapping-aware throughput-driven stencil planning for E-beam lithography

E-Beam Lithography (EBL) is a maskless nano-lithography technology that creates features on a wafer by directly shooting a beam of electrons onto the wafer. Different from the current mainstream optical lithography technology, i.e. 193nm ArF immersion lithography, EBL overcomes the limit of light diffraction. As one of the most promising next generation lithography (NGL) technologies, it can achieve very high resolution even for sub-10nm technology node. However, before EBL can be used for High Volume Manufacturing (HVM), its problem of low throughput has to be solved. Character Projection (CP) with a set of pre-defined characters is thought to be an essential technology for throughput improvement. With CP, a key problem is stencil planning, which is to select and place the best characters onto the stencil such that the throughput of the system can be maximized. If the overlapping between characters are awared, the throughput can be further optimized. In this paper, we investigate this 2D overlapping-aware stencil planning problem. Experiments show that our approach can achieve significant throughput improvement and remarkable speed-up comparing with previous works.

[1]  Chris C. N. Chu,et al.  Optimal slack-driven block shaping algorithm in fixed-outline floorplanning , 2012, ISPD '12.

[2]  Kun Yuan,et al.  E-Beam Lithography Stencil Planning and Optimization With Overlapped Characters , 2012, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  Kun Yuan,et al.  Layout Decomposition for Triple Patterning Lithography , 2015, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Igor L. Markov,et al.  Fixed-outline floorplanning: enabling hierarchical design , 2003, IEEE Trans. Very Large Scale Integr. Syst..

[5]  Kun Yuan,et al.  E-BLOW: E-beam lithography overlapping aware stencil planning for MCC system , 2013, 2013 50th ACM/EDAC/IEEE Design Automation Conference (DAC).

[6]  C. Wagner,et al.  EUV lithography: Lithography gets extreme , 2010 .

[7]  Graham Kendall,et al.  A New Placement Heuristic for the Orthogonal Stock-Cutting Problem , 2004, Oper. Res..

[8]  Mutsunori Yagiura,et al.  The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio , 2010, Comput. Oper. Res..

[9]  Ramón Alvarez-Valdés,et al.  Reactive GRASP for the strip-packing problem , 2008, Comput. Oper. Res..

[10]  Andrew B. Kahng,et al.  Layout decomposition for double patterning lithography , 2008, 2008 IEEE/ACM International Conference on Computer-Aided Design.

[11]  Andrew B. Kahng,et al.  Layout Decomposition Approaches for Double Patterning Lithography , 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  D.M. Mount,et al.  An Efficient k-Means Clustering Algorithm: Analysis and Implementation , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Deeparnab Chakrabarty,et al.  Knapsack Problems , 2008 .

[14]  Evangeline F. Y. Young,et al.  A highly-efficient row-structure stencil planning approach for e-beam lithography with overlapped characters , 2014, ISPD '14.

[15]  Chris C. N. Chu,et al.  Flexible packed stencil design with multiple shaping apertures for e-beam lithography , 2014, 2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC).