Feasible aggressor-set identification under constraints for maximum coupling noise

  • Authors:
  • Debjit Sinha;Alex Rubin;Chandu Visweswariah;Frank Borkam;Gregory Schaeffer;Soroush Abbaspour

  • Affiliations:
  • IBM Systems and Technology Group, Electronic Design Automation, Hopewell Junction, NY;IBM Systems and Technology Group, Electronic Design Automation, Hopewell Junction, NY;IBM Thomas J. Watson Research Center, Yorktown Heights, NY;IBM Systems and Technology Group, Electronic Design Automation, Hopewell Junction, NY;IBM Systems and Technology Group, Electronic Design Automation, Hopewell Junction, NY;IBM Systems and Technology Group, Electronic Design Automation, Hopewell Junction, NY

  • Venue:
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • Year:
  • 2009

Quantified Score

Hi-index 0.03

Visualization

Abstract

In this paper, we consider the problem of identifying a feasible set of aggressor nets that would induce maximum crosstalk noise or delay pushout on a coupled victim net, under given logical constraints. We present a novel mathematical formulation of this problem and propose a Lagrangian relaxation-based approach for solving it efficiently and optimally. Experimental results show that the proposed approach is run-time efficient by a factor of up to 800 times in comparison to an exhaustive search approach and reduces timing pessimism by up to 36%. We also formulate and solve this problem while considering the noise susceptibility of the victim's receiving gate.