双版式光刻(DPL)-兼容布局结构(DCLC)与面积线使用权衡

D. Pal, Abir Pramanik, P. Dasgupta, D. K. Das
{"title":"双版式光刻(DPL)-兼容布局结构(DCLC)与面积线使用权衡","authors":"D. Pal, Abir Pramanik, P. Dasgupta, D. K. Das","doi":"10.1109/ISVDAT.2016.8064875","DOIUrl":null,"url":null,"abstract":"A layout decomposition in Double Patterning Lithography (DPL) is considered to be potential for processing nodes at or below 32 nm. In this method, two features are assigned different colors corresponding to different exposures if the spacing between them is less than a minimum value defined by design-specific rules. In general, there are cases where such different colors assignment may not be possible even though the inter-feature spacing is less than the specified minimum. This condition is often known as color conflict of adjacent features. Color conflicts are traditionally resolved by splitting the features. This problem is often modeled as a graph-theoretic problem, with color conflicts identified as odd-cycle detection, and the duplication of vertices of the graph arising out of splitting of features of a layout. However, for a given layout, the splitting of features may not always be desirable or even feasible. In this paper, we propose a merge-only technique with conservative application of de-compaction so that the overall area of the layout is minimally affected. We consider layouts having rectilinear features present in the layout and apply the proposed algorithm to obtain a DPL-compliant layout with selective use of stitches keeping the overall layout area fixed. Experimental results with some standard layouts demonstrate the effectiveness of the proposed algorithm.","PeriodicalId":301815,"journal":{"name":"2016 20th International Symposium on VLSI Design and Test (VDAT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Double Patterning Lithography (DPL)-compliant layout construction (DCLC) with area-stitch usage tradeoff\",\"authors\":\"D. Pal, Abir Pramanik, P. Dasgupta, D. K. Das\",\"doi\":\"10.1109/ISVDAT.2016.8064875\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A layout decomposition in Double Patterning Lithography (DPL) is considered to be potential for processing nodes at or below 32 nm. In this method, two features are assigned different colors corresponding to different exposures if the spacing between them is less than a minimum value defined by design-specific rules. In general, there are cases where such different colors assignment may not be possible even though the inter-feature spacing is less than the specified minimum. This condition is often known as color conflict of adjacent features. Color conflicts are traditionally resolved by splitting the features. This problem is often modeled as a graph-theoretic problem, with color conflicts identified as odd-cycle detection, and the duplication of vertices of the graph arising out of splitting of features of a layout. However, for a given layout, the splitting of features may not always be desirable or even feasible. In this paper, we propose a merge-only technique with conservative application of de-compaction so that the overall area of the layout is minimally affected. We consider layouts having rectilinear features present in the layout and apply the proposed algorithm to obtain a DPL-compliant layout with selective use of stitches keeping the overall layout area fixed. Experimental results with some standard layouts demonstrate the effectiveness of the proposed algorithm.\",\"PeriodicalId\":301815,\"journal\":{\"name\":\"2016 20th International Symposium on VLSI Design and Test (VDAT)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 20th International Symposium on VLSI Design and Test (VDAT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISVDAT.2016.8064875\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 20th International Symposium on VLSI Design and Test (VDAT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISVDAT.2016.8064875","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

双图案光刻(DPL)中的布局分解被认为是在32nm或以下处理节点的潜力。在该方法中,如果两个特征之间的间距小于设计特定规则定义的最小值,则两个特征对应于不同的曝光被赋予不同的颜色。通常,在某些情况下,即使特征间间距小于指定的最小值,也可能无法分配不同的颜色。这种情况通常被称为相邻特征的颜色冲突。颜色冲突通常是通过拆分特征来解决的。这个问题通常被建模为图论问题,将颜色冲突识别为奇循环检测,并且由于布局的特征分裂而产生图顶点的重复。然而,对于给定的布局,拆分功能可能并不总是理想的,甚至是可行的。在本文中,我们提出了一种仅合并的技术,并保守地应用了去压缩,从而使布局的整体面积受到最小的影响。我们考虑在布局中具有直线特征的布局,并应用所提出的算法来获得符合dpl的布局,并选择性地使用缝线来保持整体布局区域的固定。一些标准布局的实验结果证明了该算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Double Patterning Lithography (DPL)-compliant layout construction (DCLC) with area-stitch usage tradeoff
A layout decomposition in Double Patterning Lithography (DPL) is considered to be potential for processing nodes at or below 32 nm. In this method, two features are assigned different colors corresponding to different exposures if the spacing between them is less than a minimum value defined by design-specific rules. In general, there are cases where such different colors assignment may not be possible even though the inter-feature spacing is less than the specified minimum. This condition is often known as color conflict of adjacent features. Color conflicts are traditionally resolved by splitting the features. This problem is often modeled as a graph-theoretic problem, with color conflicts identified as odd-cycle detection, and the duplication of vertices of the graph arising out of splitting of features of a layout. However, for a given layout, the splitting of features may not always be desirable or even feasible. In this paper, we propose a merge-only technique with conservative application of de-compaction so that the overall area of the layout is minimally affected. We consider layouts having rectilinear features present in the layout and apply the proposed algorithm to obtain a DPL-compliant layout with selective use of stitches keeping the overall layout area fixed. Experimental results with some standard layouts demonstrate the effectiveness of the proposed algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信