Simultaneous buffer insertion and wire sizing considering systematic CMP variation and random leff variation

• Published in: IEEE transactions on computer-aided design of integrated circuits and systems Vol. 26; no. 5; pp. 845 - 857
• Main Authors: He, Lei, Kahng, Andrew B., Tam, King Ho, Xiong, Jinjun
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.05.2007; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Buffering; Buffers; Capacitance; Chemical-mechanical polishing; Couplings; dummy fill insertion; fill patterns; Insertion; Integrated circuit interconnections; interconnect optimization; Metals; Polynomials; process variation; random L eff variation; Sizing; systematic CMP variation; Systematics; Timing; Wire; wire sizing; Wires
• ISSN: 0278-0070; 1937-4151
• DOI: 10.1109/TCAD.2007.8361579

Abstract—This paper presents extensions of the dynamicprogramming (DP) framework to consider buffer insertion and wire-sizing under effects of process variation. We study the effectiveness of this approach to reduce timing impact caused by chemical–mechanical planarization (CMP)-induced systematic variation and random L eff process variation in devices. We first present a quantitative study on the impact of CMP to interconnect parasitics. We then introduce a simple extension to handle CMP effects in the buffer insertion and wire sizing problem by simultaneously considering fill insertion (SBWF).We also tackle the same problem but with random L eff process variation (vSBWF) by incorporating statistical timing into the DP framework. We develop an efficient yet accurate heuristic pruning rule to approximate the computationally expensive statistical problem. Experiments under conservative assumption on process variation show that SBWF algorithm obtains 1.6% timing improvement over the variationunaware solution. Moreover, our statistical vSBWF algorithm results in 43.1% yield improvement on average. We also show that our approaches have polynomial time complexity with respect to the net-size. The proposed extensions on the DP framework is orthogonal to other power/area-constrained problems under the same framework, which has been extensively studied in the literature.