Layout Compliance for Triple Patterning Lithography: An Iterative Approach

Similar documents
E-BLOW: E-Beam Lithography Overlapping aware Stencil Planning for MCC System

Self-aligned Double Patterning Layout Decomposition with Complementary E-Beam Lithography

Double Patterning Layout Decomposition for Simultaneous Conflict and Stitch Minimization

Stitch Aware Detailed Placement for Multiple E-Beam Lithography

Dynamic Algorithms Multiple Choice Test

A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks

Definitions Homework. Quine McCluskey Optimal solutions are possible for some large functions Espresso heuristic. Definitions Homework

Incremental Layer Assignment for Critical Path Timing

Double Patterning-Aware Detailed Routing with Mask Usage Balancing

Outline: Software Design

Interconnection Styles

arxiv: v1 [cs.oh] 2 Aug 2014

Detection and Recognition of Non-Occluded Objects using Signature Map

Path Sharing and Predicate Evaluation for High-Performance XML Filtering*

Facility Location: Distributed Approximation

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract

Parametric Abstract Domains for Shape Analysis

Outline. CS38 Introduction to Algorithms. Administrative Stuff. Administrative Stuff. Motivation/Overview. Administrative Stuff

A Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks

Incremental Mining of Partial Periodic Patterns in Time-series Databases

XML Data Streams. XML Stream Processing. XML Stream Processing. Yanlei Diao. University of Massachusetts Amherst

Compilation Lecture 11a. Register Allocation Noam Rinetzky. Text book: Modern compiler implementation in C Andrew A.

Algorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking

Plot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)

A Coarse-to-Fine Classification Scheme for Facial Expression Recognition

Sparse Certificates for 2-Connectivity in Directed Graphs

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2

A Novel Validity Index for Determination of the Optimal Number of Clusters

A {k, n}-secret Sharing Scheme for Color Images

Plumber: a method for a multi-scale decomposition of 3D shapes into tubular primitives and bodies

timestamp, if silhouette(x, y) 0 0 if silhouette(x, y) = 0, mhi(x, y) = and mhi(x, y) < timestamp - duration mhi(x, y), else

Evolutionary Feature Synthesis for Image Databases

1 Disjoint-set data structure.

Announcements. Lecture Caching Issues for Multi-core Processors. Shared Vs. Private Caches for Small-scale Multi-core

This fact makes it difficult to evaluate the cost function to be minimized

Algorithms, Mechanisms and Procedures for the Computer-aided Project Generation System

Multi-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality

Lecture 14. Recursion

726 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 34, NO. 5, MAY 2015

The Implementation of RRTs for a Remote-Controlled Mobile Robot

Video Data and Sonar Data: Real World Data Fusion Example

arxiv: v1 [cs.db] 13 Sep 2017

TRIPLE patterning lithography (TPL) is regarded as

WORKSHOP 20 CREATING PCL FUNCTIONS

A Support-Based Algorithm for the Bi-Objective Pareto Constraint

Systematic framework for evaluating standard cell middle-of-line robustness for multiple patterning lithography

A Support-Based Algorithm for the Bi-Objective Pareto Constraint

Torpedo Trajectory Visual Simulation Based on Nonlinear Backstepping Control

Abstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1.

A Comprehensive Review of Overlapping Community Detection Algorithms for Social Networks

Transition Detection Using Hilbert Transform and Texture Features

Triple/Quadruple Patterning Layout Decomposition via Novel Linear Programming and Iterative Rounding

Pipelined Multipliers for Reconfigurable Hardware

Improved flooding of broadcast messages using extended multipoint relaying

Dynamic Programming. Lecture #8 of Algorithms, Data structures and Complexity. Joost-Pieter Katoen Formal Methods and Tools Group

Unsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks

International Journal of Advancements in Research & Technology, Volume 3, Issue 3, March-2014 ISSN

1 The Knuth-Morris-Pratt Algorithm

M32: A Constructive Multilevel Logic Synthesis System*

Coprocessors, multi-scale modeling, fluid models and global warming. Chris Hill, MIT

Formal Verification by Model Checking

Routing Protocols for Wireless Ad Hoc Networks Hybrid routing protocols Theofanis Kilinkaridis

Sequential Incremental-Value Auctions

Performance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application

1. Introduction. 2. The Probable Stope Algorithm

ON CHARACTERIZING TERRAIN VISIBILITY GRAPHS

Cluster-Based Cumulative Ensembles

DECODING OF ARRAY LDPC CODES USING ON-THE FLY COMPUTATION Kiran Gunnam, Weihuang Wang, Euncheol Kim, Gwan Choi, Mark Yeary *

Efficient and scalable trie-based algorithms for computing set containment relations

A Compressed Breadth-First Search for Satisfiability

Graph-Based vs Depth-Based Data Representation for Multiview Images

A Fast Sub-pixel Motion Estimation Algorithm for. H.264/AVC Video Coding

Cluster Centric Fuzzy Modeling

Machine Vision. Laboratory Exercise Name: Student ID: S

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study

Accurate Partial Volume Estimation of MR Brain Tissues

A scheme for racquet sports video analysis with the combination of audio-visual information

4.1.1 Design quality. 4.Normalization: Quality of relational designs. Informal guidelines (2) Informal guidelines (1)

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating

WITH the need of industry for more and more smaller

Make your process world

HEXA: Compact Data Structures for Faster Packet Processing

A Novel Methodology for Triple/Multiple-Patterning Layout Decomposition

Extracting Partition Statistics from Semistructured Data

Constructing Transaction Serialization Order for Incremental. Data Warehouse Refresh. Ming-Ling Lo and Hui-I Hsiao. IBM T. J. Watson Research Center

Pulse sequence Real-time MRI

Face and Facial Feature Tracking for Natural Human-Computer Interface

Partial Character Decoding for Improved Regular Expression Matching in FPGAs

Optimizing Sparse Matrix Operations on GPUs using Merge Path

A Multistart Randomized Greedy Algorithm for Traffic Grooming on Mesh Logical Topologies

Abstract. We describe a parametric hybrid Bezier patch that, in addition. schemes are local in that changes to part of the data only aect portions of

From indoor GIS maps to path planning for autonomous wheelchairs

8 Instruction Selection

Verifying Interaction Protocol Compliance of Service Orchestrations

Scheduling Commercial Videotapes in Broadcast Television

Context-Aware Activity Modeling using Hierarchical Conditional Random Fields

Simulation of Crystallographic Texture and Anisotropie of Polycrystals during Metal Forming with Respect to Scaling Aspects

Optimizing Correlated Path Queries in XML Languages. Technical Report CS November 2002

Test Case Generation from UML State Machines

Transcription:

Layout Compliane for Triple Patterning Lithography: An Iterative Approah Bei Yu, Gilda Garreton, David Z. Pan ECE Dept. University of Texas at Austin, Austin, TX, USA Orale Las, Orale Corporation, Redwood Shores, CA, USA 09/16/2014 1 / 27

Outline Introdution New Challenges in Triple Patterning Lithography (TPL) Layout Compliane Algorithms Results and Conlusions 2 / 27

Outline Introdution New Challenges in Triple Patterning Lithography (TPL) Layout Compliane Algorithms Results and Conlusions 3 / 27

Lithography Status & Challenges 10 [Courtesy Intel] 1 um 0.1 X 1980 1990 2000 2010 2020 Advaned lithography to extend 193nm lithography Now and near future: doule/triple/quadruple patterning Long term future: other advaned lithography 4 / 27

From Doule Patterning to Triple Patterning Mask 1 ITRS roadmap 28nm Single Patterning 22nm Doule Patterning 14nm Triple Patterning 11nm Quadruple Patterning stith Mask 2 Layout deomposition Patterning friendly design Mask 1 Mask 2 Mask 3 5 / 27

Previous Works in TPL Layout Deomposition ILP or SAT [Cork+,SPIE 08][Yu+,ICCAD 11][Cork+,SPIE 13] Greedy or Heuristi [Ghaida+,SPIE 11][Fang+,DAC 12] [Kuang+,DAC 13][Yu+,DAC 14][Fang+,SPIE 14] SDP or Graph ased (trade-off) [Yu+, ICCAD 11][Chen+,ISQED 13][Yu+,ICCAD 13] Limitations: an NOT guarantee TPL friendly (a) () 6 / 27

Layout Compliane Prolem Formulation Input: Input layout patterns (may not e TPL friendly) Minimum oloring distane min s a a1 a1 d a2 d2 d1 a2 d2 d1 (a) () () Output: Apply layout deomposition and layout modifiation Remove all onflits 7 / 27

Layout Deomposition v.s. Layout Compliane a a a d d d (a) Input layout () Layout deomposition () Layout Modifiation Layout Compliane = Layout Deomposition + Layout Modifiation 8 / 27

Outline Introdution New Challenges in Triple Patterning Lithography (TPL) Layout Compliane Algorithms Results and Conlusions 9 / 27

Challenge 1: NO Shortut in TPL Complexity Optimizing onflit & stith simultaneously is NP-hard for DPL/TPL. Shortut in DPL: Step y step Eah step an e optimally solved Input Layout Step 1: Conflit Minimization Step 2: Stith Minimization (a) () () TPL: NO suh shortut, as onflit minimization is NP-hard Door losed? 10 / 27

Challenge 2: Where do the onflits ome from? DPL: Detet odd-yle Long pattern hains (a) () TPL: NP-hard to detet But mostly loal 4-lique (a) () () 11 / 27

Challenge 3: Deomposer Cluthing at Straws Conflit # Greedy or heuristi: Fast ut ad quality SDP or graph searh: Tradeoff, still not good in performane Performane target ILP: Good performane ut expensive CPU runtime Gap Our performane target 12 / 27

Outline Introdution New Challenges in Triple Patterning Lithography (TPL) Layout Compliane Algorithms Step 1: Initial Layout Deomposition Step 2: Layout Modifiation Step 3: Inremental Layout Deomposition Results and Conlusions 13 / 27

Overall Flow Input Layout Deomposition Graph Constrution 1. Fast Initial Layout Deomposition 2. Layout Modifiation 3. Inremental Layout Deomposition Output Masks 14 / 27

Overall Flow Input Layout Deomposition Graph Constrution 1. Fast Initial Layout Deomposition 2. Layout Modifiation 3. Inremental Layout Deomposition Output Masks a d 14 / 27

Overall Flow Input Layout Deomposition Graph Constrution 1. Fast Initial Layout Deomposition a1 2. Layout Modifiation 3. Inremental Layout Deomposition a2 d1 Output Masks d2 14 / 27

Overall Flow Input Layout Deomposition Graph Constrution 1. Fast Initial Layout Deomposition native struture ehind onflit a1 2. Layout Modifiation 3. Inremental Layout Deomposition a2 d1 Output Masks d2 14 / 27

Overall Flow Input Layout Deomposition Graph Constrution 1. Fast Initial Layout Deomposition a1 2. Layout Modifiation 3. Inremental Layout Deomposition a2 d1 Output Masks d2 14 / 27

Overall Flow Input Layout Deomposition Graph Constrution 1. Fast Initial Layout Deomposition olor re-assignment region a1 2. Layout Modifiation 3. Inremental Layout Deomposition a2 d1 Output Masks d2 14 / 27

Overall Flow Input Layout Deomposition Graph Constrution 1. Fast Initial Layout Deomposition 2. Layout Modifiation 3. Inremental Layout Deomposition Output Masks a d 14 / 27

Step 1: Initial Layout Deomposition Our method: linear olor assignment Linear runtime omplexity [Yu+,DAC 14] a1 native struture ehind onflit a1 May leave some onflits to Step 2 & 3 Muh faster than ILP or SDP a2 d1 a2 d1 d2 d2 Runtime omparisions: 15 / 27

Step 1: Fast Layout Deomposition (ont.) But, Any oloring order results in Loal Optimality Example: order a---d a a d (a) () d Half Pith a a d d () (d) Color-Friendly Rules: a- tend to e with the same olor 16 / 27

Step 1: Fast Layout Deomposition (ont.) Peer Seletion: Three orders would e proessed simultaneously Best solution would e seleted Still Linear runtime omplexity Degree-Coloring 3Round-Coloring Sequene-Coloring 17 / 27

Step 1: Fast Layout Deomposition (ont.) Peer Seletion: Whole prolem a set of omponents Different omponents have different dominant orders Overall etter results than any single order 18 / 27

Fast Layout Deomposition Result Example Row y row Resolved in 0.1 seond 19 / 27

Step 2: Layout Modifiation Initial layout deomposition output: native onflit is laeled: (a) () Layout modifiation to reak down eah four-lique: (a) () 20 / 27

Step 3: Inremental Layout Deomposition Input: One layout region & stith# ound Output: olor re-assignment in the region a1 olor re-assignment region a1 Method: ranh-and-ound Early return if satisfy stith# ound a2 d1 a2 d1 d2 d2 Runtiem & stith# ound trade-off: 21 / 27

Step 3: Inremental Layout Deomposition Example (a) () () (d) a Deomposed result after initial layout deomposition. All layout patterns to e re-assigned olors are laeled. The onstruted loal deomposition graph. d The result of inremental layout deomposition. 22 / 27

Outline Introdution New Challenges in Triple Patterning Lithography (TPL) Layout Compliane Algorithms Results and Conlusions 23 / 27

Interfaed with open soure tool Eletri 24 / 27

Layout Compliane Results 25 / 27

Conlusions First attempt for TPL layout ompliane Failiating the advanement of patterning tehnique Conflit # Greedy or heuristi: Fast ut ad quality SDP or graph searh: Tradeoff, still not good in performane Performane target ILP: Good performane ut expensive CPU runtime Future works Timing issue Smarter automatially layout modifiation 26 / 27

27 / 27 Thank You!