TY - JOUR
T1 - Post-routing layer assignment for double patterning with timing critical paths consideration
AU - Sun, Jian
AU - Lu, Yinghai
AU - Zhou, Hai
AU - Yan, Changhao
AU - Zeng, Xuan
N1 - Funding Information:
She received the First-Class Award of Electronic Information Science and Technology from the Chinese Institute of Electronics, Beijing, China, in 2005. She received the Second-Class Award of Science and Technology Advancement and the Cross-Century Outstanding Scholar Award from the Ministry of Education of China in 2006 and 2002, respectively. She received the award of “IT Top 10” in Shanghai in 2003. She served on the Technical Program Committee of the IEEE/ACM Asia and South Pacific Design Automation Conference in 2000 and 2005.
Funding Information:
This research is supported partly by National Natural Science Foundation of China (NSFC) research project 61125401, 60976034, 61076033 and 61106032 , partly by the National Basic Research Program of China under the Grant 2011CB309701 , partly by the National major Science and Technology Special project 2011ZX01035-001-001-003 of China during the 12th five-year plan period, partly by the doctoral program foundation of Ministry of Education of China 200802460068 , and partly by the program for Outstanding Academic Leader of Shanghai .
Funding Information:
He is currently an associate professor of electrical engineering and computer science at Northwestern University, Evanston, IL. His current research interests include very large scale integration computer-aided design, algorithm design, and formal methods. He has published more than 130 technical papers in prestigious journals and conferences in these areas. He was a recipient of the CAREER Award from the National Science Foundation in 2003. He has served in the editorial boards of many technical journals and the technical program committees of many leading conferences.
PY - 2013/3
Y1 - 2013/3
N2 - Double patterning lithography is promising for 32 nm technology and beyond. In this technique, one-layer layout is decomposed into two masks. Much work has been proposed to solve feature decomposition problem. However, post-routing layer assignment, which determines the layout features on each layer, thus having great impact on double patterning related parameters, has not been explored in the merit of double patterning. In this paper, we formulate post-routing layer assignment for double patterning problem for the first time. Both this problem and traditional single layer double patterning problem are proved to be NP-complete. An effective algorithm is further proposed to solve it. The algorithm consists of three major phases: multi-layer assignment to minimize double patterning risks, single layer double patterning, and via reduction. Since blind post-routing layer assignment may jeopardize timing critical paths obtained in the routing stage, our algorithm also considers total wire length and coupling capacitance on critical paths as timing metrics. Experimental results on Collaborative Benchmarking Laboratory benchmarks demonstrate the effectiveness of our algorithm. In comparison with single layer double patterning, our method achieves 62% and 11% average reduction on unresolvable conflicts and stitches, respectively, with only 0.30% increase of via number in layouts. Furthermore, the via height and parallel wire length on critical paths are decreased by 8% and 14% on average.
AB - Double patterning lithography is promising for 32 nm technology and beyond. In this technique, one-layer layout is decomposed into two masks. Much work has been proposed to solve feature decomposition problem. However, post-routing layer assignment, which determines the layout features on each layer, thus having great impact on double patterning related parameters, has not been explored in the merit of double patterning. In this paper, we formulate post-routing layer assignment for double patterning problem for the first time. Both this problem and traditional single layer double patterning problem are proved to be NP-complete. An effective algorithm is further proposed to solve it. The algorithm consists of three major phases: multi-layer assignment to minimize double patterning risks, single layer double patterning, and via reduction. Since blind post-routing layer assignment may jeopardize timing critical paths obtained in the routing stage, our algorithm also considers total wire length and coupling capacitance on critical paths as timing metrics. Experimental results on Collaborative Benchmarking Laboratory benchmarks demonstrate the effectiveness of our algorithm. In comparison with single layer double patterning, our method achieves 62% and 11% average reduction on unresolvable conflicts and stitches, respectively, with only 0.30% increase of via number in layouts. Furthermore, the via height and parallel wire length on critical paths are decreased by 8% and 14% on average.
KW - Algorithm
KW - Double patterning
KW - Layer assignment
KW - NP-completeness
KW - Timing critical paths
UR - http://www.scopus.com/inward/record.url?scp=84871922602&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84871922602&partnerID=8YFLogxK
U2 - 10.1016/j.vlsi.2012.02.003
DO - 10.1016/j.vlsi.2012.02.003
M3 - Article
AN - SCOPUS:84871922602
SN - 0167-9260
VL - 46
SP - 153
EP - 164
JO - Integration, the VLSI Journal
JF - Integration, the VLSI Journal
IS - 2
ER -