Polynomial time optimal algorithm for stencil row planning in e-beam lithography

E-beam;Stencil Planning;1D Character Placement

Guo, Daifeng ; Wong ; Martin D.F.

关键词: E-beam;    Stencil Planning;    1D Character Placement;   

Others  :  https://www.ideals.illinois.edu/bitstream/handle/2142/50492/Daifeng_Guo.pdf?sequence=1&isAllowed=y

美国|英语

来源: The Illinois Digital Environment for Access to Learning and Scholarship

【 摘 要 】

Electron beam lithography (EBL) is a very promising candidate for integrated circuit (IC) fabrication beyond the 10 nm technology node. To address its throughput issue, the Character Projection (CP) technique has been proposed, and its stencil planning can be optimized with awareness of overlapping characters. However, the top-level 2D stencil planning problem has been proven to be an NP-hard problem. As its most essential step, the 1D row ordering is believed hard as well, and no polynomial time optimal solution has been provided so far. Previous research formulates the problem as the travelling salesman problem, which is NP-hard and solves it by heuristics. In this thesis, we formulate the problem as a matching problem and propose a polynomial time optimal algorithm, which serves as the major subroutine for the entire stencil planning problem. The optimality of the algorithm is proved, and experimental results are also provided to show that our work makes a great improvement in efficiency and correctness to solve the row ordering problem.