An efficient method for gradient-aware dummy fill synthesis

  • Authors:
  • Peng Wu;Hai Zhou;Changhao Yan;Jun Tao;Xuan Zeng

  • Affiliations:
  • State Key Laboratory of ASIC & System, Microelectronics Department, Fudan University, China;State Key Laboratory of ASIC & System, Microelectronics Department, Fudan University, China and EECS, Northwestern University, USA;State Key Laboratory of ASIC & System, Microelectronics Department, Fudan University, China;State Key Laboratory of ASIC & System, Microelectronics Department, Fudan University, China;State Key Laboratory of ASIC & System, Microelectronics Department, Fudan University, China

  • Venue:
  • Integration, the VLSI Journal
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

In advanced VLSI fabrication, dummy fill is widely employed to solve the pattern dependent manufacturability issues. In this paper, a new linear programming formulation for dummy fill synthesis is proposed, which takes more consideration to the density gradient besides the pattern density. Based on the covering linear programming (CLP), a fast iterative approximation scheme is designed to solve this newly formulated problem. The complexity of the new method is proved to be O(n^2log(n)). Experimental results demonstrate the effectiveness of the new formulation, and show good accuracy and time efficiency of the proposed method. Compared with the ordinary LP method, speedup over magnitude is achieved with the acceptable overfill amount.