Worst Case Noise Prediction With Nonzero Current Transition Times for Power Grid Planning

IEEE Transactions on Very Large Scale Integration (VLSI) Systems(2014)

引用 0|浏览15
暂无评分
摘要
In this paper, we propose a novel method for power distribution network verification at early design stages. This approach predicts the worst case noise of on-chip power grids with multiple current sources subjected to a set of hierarchical constraints. The current constraints not only define bounds for current magnitudes, but also consider nonzero current transition times that makes the prediction of worst case noise more realistic. Under the novel current constraints, a dynamic programming algorithm is introduced to generate the worst case current sources based on the impulse responses of the power grid. The algorithm is accelerated by a modified Knuth–Yao quadrangle inequality speedup method, which reduces the time complexity from $O(s^{2}m)$ to $O(sm{\rm logs})$, where $s$ is the number of discretized current values and $m$ is the total number of zero-crossing points of the current sources. Experimental results show that our approach not only efficiently predicts realistic worst case noise of on-chip power grids, but also correlates the frequency-domain resonance effects with the time-domain noise behavior.
更多
查看译文
关键词
on-chip power grids,printed circuit interconnections,current constraints,worst case current sources,power integrity,hierarchical constraints,time-domain noise behavior,multiple current sources,constant current sources,modified knuth-yao quadrangle inequality speedup method,frequency-domain resonance effects,worst case noise,integrated circuit noise,nonzero current transition times,dynamic programming algorithm,power grid verification,current transition time,dynamic programming,power distribution network verification,impulse responses,zero-crossing points,early design stages
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要