Fixed-parameter tractable algorithms for optimal layout decomposition and beyond

This paper studies the application of fixed-parameter tractable (FPT) algorithms to solve computer-aided design (CAD) problems. Specifically, we focus on layout decomposition problems for three lithography technologies: double patterning lithography (DPL), DPL with E-beam lithography (DPL+EBL), and...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	2017 54th ACM/EDAC/IEEE Design Automation Conference (DAC) s. 1 - 6
Hlavní autori:	Jian Kuang, Young, Evangeline F. Y.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.06.2017
Predmet:	Algorithm design and analysis Approximation algorithms Heuristic algorithms Layout Lithography NP-hard problem Throughput
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	This paper studies the application of fixed-parameter tractable (FPT) algorithms to solve computer-aided design (CAD) problems. Specifically, we focus on layout decomposition problems for three lithography technologies: double patterning lithography (DPL), DPL with E-beam lithography (DPL+EBL), and DPL+DSA+EBL. Layout decomposition for the first two technologies are long-standing open problems without efficient optimal solutions, and the third technology is very promising in the future. The proposed approaches use ideas drastically different from all the previous works and can get optimal solutions in a short time. We show the great potential of applying FPT algorithms to solve more NP-hard problems efficiently in CAD.
DOI:	10.1145/3061639.3062250