Mark Bohr 2014 Idf Presentation
Mark Bohr 2014 Idf Presentation
004539
Ben Painter
Synopsys Inc.
Hillsboro, OR
Figure 5. Example of decomposition algorithm turn-around time (TAT)
References
vs. the number of nodes to color for a known TPT-compliant test 1. Y.-S. Chang, J. Sweis, J.-C. Lai, C.-C. Lin, and J. Yu, Full area pattern decomposition
pattern.5 Full TPT decomposition TAT shows a rapid increase with the of self-aligned double patterning for 30nm node NAND FLASH process, Proc. SPIE 7637,
p. 76371N, 2010.
number of linked nodes to color in a layout. Smart techniques—such as
2. K. Lucas, C. Cork, B. Yu, G. Luk-Pat, B. Painter, and D. Z. Pan, Implications of triple
those we have described elsewhere4 —can greatly reduce TAT. But full- patterning for 14nm node design and patterning, Proc. SPIE 8327, p. 832703, 2012.
chip TPT decomposition ability is far from certain. WCSP: Weighted 3. S. Sivakumar, EUV lithography: prospects and challenges, ICCAD Nanolithogr.
Wrkshp., 2011.
constraint satisfaction problem. SAT: Satisfiability. 4. B. Yu et al., Layout decomposition for triple patterning lithography, Proc. ICCAD,
pp. 1–8, 2011. doi:10.1109/ICCAD.2011.6105297
5. C. Cork, J.-C. Madre, and L. Barnes, Comparison of triple patterning decomposition
techniques developed for DPT can be reused in TPT. However, algorithms using aperiodic tiling patterns, Proc. SPIE 7028, p. 702839, 2008.
Author Information
Kevin Lucas
Synopsys Inc.
Austin, TX
Chris Cork
Synopsys Inc.
Montbonnot, France
c 2012 SPIE