互连线网时延估算的一种有效算法

An Efficient Method for Delay Estimation of Interconnection Networks

本文提出一种基于传递函数递推和系数匹配的互连线网时延估算法,该算法用二极点模型逼近互连线网的传递函数,仅通过计算某一频率点上的传递函数,就可利用导出的解析公式或拟合的经验公式进行快速时延估算,不必进行复杂的分量计算.算例表明,对于各个门限值,其计算结果均与spice计算的时延值十分接近,计算量也比通常基于高阶分量计算的算法大为减少,在计算效率和模拟精度两方面得到较好折衷,对于互连线网时延估算具有实用价值。

This paper proposes a delay estimation method for different interconnect tree topologies.Using this method,we can incrementally compute transfer function for general interconnection trees and construct a two pole transfer function to approximate the actual transfer function by coefficients matching,not the moment computation,then derive a two pole model for delay estimation.The delay estimates using our method are very close to spice computed delays.And the trade off between accuracy and efficiency can be obtained.It is useful for delay calculation of interconnection in the performance driven synthesis and layout of VLSI routing topologies.