首页> 外文会议>ACM international symposium on physical design 2011 >More Realistic Power Grid Verification Based on Hierarchical Current and Power Constraints
【24h】

More Realistic Power Grid Verification Based on Hierarchical Current and Power Constraints

机译:基于分层电流和功率约束的更现实的电网验证

获取原文
获取原文并翻译 | 示例

摘要

Vectorless power grid verification algorithms, by solving linear programming (LP) problems under current constraints, enable worst-case voltage drop predictions at an early design stage. However, worst-case current patterns obtained by many existing vectorless algorithms are time-invariant (i.e., are constant throughout the simulation time), which may result in an overly pessimistic voltage drop prediction. In this paper, a more realistic power grid verification algorithm based on hierarchical current and power constraints is proposed. The proposed algorithm naturally handles general RCL power grid models. Currents at different time steps are treated as independent variables and additional power constraints are introduced; this results in more realistic time-varying worst-case current patterns and less pessimistic worst-case voltage drop predictions. Moreover, a sorting-deletion algorithm is proposed to speed up solving LP problems by utilizing the hierarchical constraint structure. Experimental results confirm that worst-case current patterns and voltage drops obtained by the proposed algorithm are more realistic, and that the sorting-deletion algorithm reduces runtime needed to solve LP problems by > 85%.
机译:通过在电流约束下解决线性编程(LP)问题,无矢量电网验证算法可在设计的早期阶段实现最坏情况下的压降预测。然而,由许多现有的无矢量算法获得的最坏情况的电流模式是时不变的(即,在整个仿真时间内是恒定的),这可能导致过于悲观的电压降预测。本文提出了一种基于分层电流和功率约束的更现实的电网验证算法。所提出的算法自然可以处理一般的RCL电网模型。在不同时间步长的电流被视为独立变量,并引入了额外的功率约束。这将导致更现实的时变最坏情况下的电流模式和更少悲观的最坏情况下的压降预测。此外,提出了一种排序删除算法,以利用分层约束结构加快解决LP问题的速度。实验结果证明,通过该算法获得的最坏情况下的电流模式和电压降更为现实,并且排序删除算法将解决LP问题所需的运行时间减少了> 85%。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号