Self-aligned Double Patterning Layout Decomposition with - - PowerPoint PPT Presentation

self aligned double patterning layout decomposition with
SMART_READER_LITE
LIVE PREVIEW

Self-aligned Double Patterning Layout Decomposition with - - PowerPoint PPT Presentation

Self-aligned Double Patterning Layout Decomposition with Complementary E-Beam Lithography Jhih-Rong Gao, Bei Yu and David Z. Pan Dept. of Electrical and Computer Engineering The University of Texas at Austin Supported in part by NSF, SRC, NSFC,


slide-1
SLIDE 1

1

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

Jhih-Rong Gao, Bei Yu and David Z. Pan

  • Dept. of Electrical and Computer Engineering

The University of Texas at Austin Supported in part by NSF, SRC, NSFC, IBM and Intel

slide-2
SLIDE 2

Outline

t Motivation & Problem Formulation t Proposed Algorithms

› Post Processing Based Layout Decomposition › Simultaneous SADP+EBL Optimization

t Experimental Results t Conclusion

2

slide-3
SLIDE 3

Self-Aligned Double Patterning (SADP)

t Promising double patterning technique for sub-22nm nodes t Trim mask can be used to generate cuts t Issue: Overlay problem caused on some trimming boundaries

3

Target layout Mandrel mask Spacer deposition Trimming

Assist

Trim mask Possible overlay error

slide-4
SLIDE 4

E-Beam Lithography (EBL)

t Maskless lithography

› High Resolution (sub-10nm)

t Issue: Low throughput t Constraint: Variable-shaped (rectangular) beam

system

› Each e-beam cut is a rectangular

4

Electrical Gun Shaping Aperture 2nd Aperture Wafer

slide-5
SLIDE 5

SADP & E-beam Hybrid?

t SADP with multiple cut masks or e-beam cuts

5

[Y. Borodovsky, Maskless Lito and Multibeam Mask Workshop, 2010 ]

193nm immersion Complementary Lithography 1 base mask + 4 cut masks 1 base mask + E-beam

11nm node

slide-6
SLIDE 6

Complementary/Hybrid Lithography

t Different lithography techniques work together

› Base features: Optical lithography or SADP

» Low cost, low resolution

› Cutting technique: high-resolution MPL/EUVL/EBL/DSA

» High cost, high resolution

› Tradeoff b/t Printing Quality and Manufacturing Cost

t This work: SADP + EBL

6

+ = Base features Cutting patterns Final patterns

slide-7
SLIDE 7

Related Works

t Complementary lithography

› [Y. Borodovsky, Maskless Lithography and Multibeam Mask Writer Workshop, 2010]

t SADP with line cutting for 1D layout

› [K. Oyama et al., SPIE 2010]

t SADP with EBL line cutting for 1D layout

› [D. Lam et al., SPIE 2011], [Y. Du et al., ASPDAC 2012]

t SADP layout decompositions for 2D layouts

› [Ban+, DAC’11], [H. Zhang+, DAC’11 ], [Xiao+, TCAD 13]

7

slide-8
SLIDE 8

Problem Formulation

t Given

› General 2D layouts › Minimum pattern spacing on a single mask

t Objective: Perform layout decomposition with

SADP+EBL

› No min-spacing conflict for mandrel/trim mask › Minimize overlay error caused by trim mask › Minimize e-beam shots

8

slide-9
SLIDE 9

Outline

t Motivation & Problem Formulation t Proposed Algorithms

› Post Processing Based Layout Decomposition › Simultaneous SADP+EBL Optimization

t Experimental Results t Conclusion

9

slide-10
SLIDE 10

Dealing with SADP Conflicts

t Merge&Cut (M&C) technique

› Step1: Merge conflicting patterns › Step2: Cut unwanted parts by trim mask or e-beams conflicts Non-SADP- decomposable Cut

+

Trim mask

  • r E-beam

10

Merge SADP- decomposable

slide-11
SLIDE 11

Merge & Cut (M&C) Technique

t May have multiple solution candidates t Cut cost

› Cost of trim mask cut = α * Length of cutting boundary

» Penalty to minimize overlay error

› Cost of e-beam cut = β * Number of shots required

» Set β much larger than α to minimize e-beam shot counts

11

cut3 cut1 cut2

assist

conflicts

Mandrel mask Formed by aligning to spacers Solution 1 Solution 2 Trim mask

slide-12
SLIDE 12

t Objective: solve all conflicts with minimum cost t Matching-based algorithm

› Step1: Conflict Graph construction › Step2: Dual Face Graph construction

» Conflict node: an odd face on the conflict graph » M&C node: a M&C candidate to solve a conflict » Edge: b/t a conflict node and its M&C solution candidates

Finding M&C Solutions

12

Face graph Conflict graph

Conflict Odd cycle = Conflict Merge&cut candidate

slide-13
SLIDE 13

t Matching-based algorithm

› Step 3: Apply min-cost matching algorithm on face graph

» Edge = conflict solved by a M&C candidate » Each conflict node only needs to be covered once

è èMatching solution = Selection of M&C candidates

that can solve conflicts with the minimum cost

Finding M&C Solutions (cont)

13 cut3 cut1 cut2

assist

Matching 1 Matching 2

slide-14
SLIDE 14

Method 1: Post Processing Based Layout Decomposition

14

  • Min-Cost Matching Algorithm
  • Assign all M&C candidates with the

cost of trim mask cuts

SADP Mask + EBL Assignment

cut5 cut6

Cuts obtained may conflict each

  • ther

New Conflict

slide-15
SLIDE 15

Method 1: Post Processing Based Layout Decomposition (cont)

15

  • Construct conflict graph for cuts
  • Find trim cuts by Maximal

Independent Set algorithm

  • Assign the rest of cuts as e-beams

E-beam only considered at the last stage (Greedy) SADP Mask + EBL Assignment E-beam cuts Trim cuts

slide-16
SLIDE 16

Method 2: Simultaneous SADP+EBL Optimization

16

SADP Mask + EBL Assignment

Min-Cost Matching Algorithm

Start From Restricted Solution Space

  • Assign all M&C candidates with

the cost of trim mask cuts Gradually Increase Solution Space

  • Replace conflicting trim mask cuts

as e-beam cuts

slide-17
SLIDE 17

Method 2: Simultaneous SADP+EBL Optimization (cont)

17

SADP Mask + EBL Assignment

Min-Cost Matching Algorithm

  • Similar to the previous

iteration, but now we have two types of cuts

  • E-beam Cut Cost >> Trim Cut

Cost

Simultaneously selecting trim mask cuts and e-beam cuts

slide-18
SLIDE 18

Example of SADP+EBL Optimization

18

1 1 1 1 1 2 1

  • Iter. 1 Matching solution

cut cut Conflict Check trim cuts

t Initialize cost of all cuts based on trim mask cutting length

slide-19
SLIDE 19

Example of SADP+EBL Optimization

19

1 1 1 1 β 2 1

  • Iter. 2 Matching solution

cut Conflict Check trim cuts cut

t Update one conflicting cut as EBL cut (cost = β)

slide-20
SLIDE 20

Example of SADP+EBL Optimization

20

β 1 1 1 β 2 1

  • Iter. 3 Matching solution

cut Conflict Check trim cuts cut

t Update cost

slide-21
SLIDE 21

Example of SADP+EBL Optimization

21

β β 1 1 β 2 1 β

Keep going…

slide-22
SLIDE 22

Example of SADP+EBL Optimization

22

β β 1 1 β β 1

Final matching solution Final cut assignment

EBL cut

Trim cut t Continue iterations until no conflict in cuts

slide-23
SLIDE 23

Experiment Settings

t Benchmarks

› OpenSPARC T1 designs › Scaled down to 22nm

t Comparison methods

› SADP w/o merge&cut › SADP w/ merge&cut › Hybrid-post: post-processing based decomposition › Hybrid-sim: simultaneous SADP+EBL decomposition

23

slide-24
SLIDE 24

Comparison of Remaining Conflicts

24

All conflicts are solved with hybrid lithography #Conflict

Design

slide-25
SLIDE 25

Comparison of E-beam Utilization

25

#E-beams

Design

Hybrid-sim tends to use more trim mask cutting and less e- beams

slide-26
SLIDE 26

Comparison of Overlay Error

26

Overlay Error (um)

Design

Overlay increase by Hybrid-sim < 3%

slide-27
SLIDE 27

Conclusion

t Complementary lithography enables high quality

layout with less mask manufacturing cost

t Merge & cut technique to reduces conflicts t Simultaneous SADP layout decomposition and

E-beam assignment performed effectively to minimize

› Conflict › SADP overlay due to trim mask › E-beam shot counts

27

slide-28
SLIDE 28

Thank You

28