Abstract

AbstractTriple patterning lithography (TPL) is one of the major techniques for 14 nm technology node and beyond. This paper discusses TPL layout decomposition which maximizes objective value representing decomposition quality. We introduce a maximization problem of the weighted sum of resolved conflicts and unused stitch candidates. We propose a polynomial time (7/9)-approximation algorithm based on positive semidefinite relaxation and randomized rounding procedure.Our algorithm returns a decomposition such that the expectation of the corresponding objective value is at least \((7/9)\) times the optimal value even in the worst case problem instance. To our knowledge, the result is the first approximation algorithm with a constant approximation ratio for TPL.KeywordsTriple patterningPositive semidefinite relaxationApproximation algorithm

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.