TY - GEN
T1 - Triple patterning aware detailed placement with constrained pattern assignment
AU - Tian, Haitong
AU - Du, Yuelin
AU - Zhang, Hongbo
AU - Xiao, Zigang
AU - Wong, Martin D.F.
N1 - Funding Information:
This work was partially supported by the National Science Foundation under Grant CCF-1320585.
Publisher Copyright:
© 2014, IEEE
PY - 2014/11
Y1 - 2014/11
N2 - Triple patterning lithography (TPL) has been recognized as one of the most promising techniques for 14/10nm technology node. There are various concerns for TPL decompositions. For standard cell based designs, assigning the same pattern for the same type of cells is a desired property for TPL decomposition. It is more robust for process variations and gives the chip similar physical and electrical characteristics as well as more reliable and predictable performance. Assigning the same type of pattern for the same type of cell is called a constrained pattern assignment (CPA) problem. In this paper, we integrated the flow of detailed placement and TPL decompositions with CPA coloring constraints. We focused on refining a layout to make it CPA-friendly during the detailed placement stage while minimizing the area and HPWL (half perimeter wire length) overhead. A weighted partial MAX SAT approach is proposed which guarantees to obtain a CPA-friendly detailed placement result while minimizing the area overhead. An efficient graph model is also proposed to compute the locations of the cells with optimal HPWL. Our formulation is very efficient and achieves a 79.4% area overhead reduction compared with the approach of fixing cell colors beforehand. Better HPWL are also achieved consistently over all benchmarks.
AB - Triple patterning lithography (TPL) has been recognized as one of the most promising techniques for 14/10nm technology node. There are various concerns for TPL decompositions. For standard cell based designs, assigning the same pattern for the same type of cells is a desired property for TPL decomposition. It is more robust for process variations and gives the chip similar physical and electrical characteristics as well as more reliable and predictable performance. Assigning the same type of pattern for the same type of cell is called a constrained pattern assignment (CPA) problem. In this paper, we integrated the flow of detailed placement and TPL decompositions with CPA coloring constraints. We focused on refining a layout to make it CPA-friendly during the detailed placement stage while minimizing the area and HPWL (half perimeter wire length) overhead. A weighted partial MAX SAT approach is proposed which guarantees to obtain a CPA-friendly detailed placement result while minimizing the area overhead. An efficient graph model is also proposed to compute the locations of the cells with optimal HPWL. Our formulation is very efficient and achieves a 79.4% area overhead reduction compared with the approach of fixing cell colors beforehand. Better HPWL are also achieved consistently over all benchmarks.
UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-84936881778&origin=resultslist&sort=plf-f&src=s&sid=d925372cf861d7bd7cad435bfe332bcb&sot=b&sdt=b&s=DOI%2810.1109%2FICCAD.2014.7001341%29&sl=31&sessionSearchId=d925372cf861d7bd7cad435bfe332bcb&relpos=0
U2 - 10.1109/ICCAD.2014.7001341
DO - 10.1109/ICCAD.2014.7001341
M3 - Conference proceeding
T3 - Proceedings of IEEE/ACM International Conference on Computer-Aided Design (ICCAD)
SP - 116
EP - 123
BT - 2014 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)
PB - IEEE
T2 - 2014 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2014
Y2 - 2 November 2014 through 6 November 2014
ER -