Redundant via insertion based on conflict removal

Jia Liang*, Song Chen, Takeshi Yoshimura

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

The occurrence of via defects increases due to the shrinking size in integrated circuit manufacturing. Double-via insertion is an effective and recommended method for improving chip yield and reliability and reducing the yield loss caused by via failures. In this paper we present a genetic algorithm based method to do the double-via insertion for layouts with grid-less or grid-based routing. Design rule violation between redundant via can be represented by a conflict graph whose vertices are redundant vias and edges represent design rule violations. We propose a genetic algorithm based method exploring the optimal removal of some redundant vias to get a conflict-free redundant via set for double via insertion. To reduce the problem size, we will first merge into one vertex (one redundant via) all the connected components that are cliques of the conflict graph. Experiment results show that the effectiveness of the proposed method.

Original languageEnglish
Title of host publicationICSICT-2010 - 2010 10th IEEE International Conference on Solid-State and Integrated Circuit Technology, Proceedings
Pages794-796
Number of pages3
DOIs
Publication statusPublished - 2010
Event2010 10th IEEE International Conference on Solid-State and Integrated Circuit Technology - Shanghai
Duration: 2010 Nov 12010 Nov 4

Other

Other2010 10th IEEE International Conference on Solid-State and Integrated Circuit Technology
CityShanghai
Period10/11/110/11/4

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Redundant via insertion based on conflict removal'. Together they form a unique fingerprint.

Cite this