|
Published Articles >> Table of Contents >> Abstract
7th International Symposium on Quality Electronic Design (ISQED'06)
pp. 43-50
Efficient Model Update for General Link-Insertion Networks
Zhuo Feng, Texas A&M University
Peng Li, Texas A&M University
Jiang Hu, Texas A&M University
Full Article Text:
 
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISQED.2006.55
Send link to a friend
| Abstract |
|
Link insertion has been proposed as a means of incremental
design to improve performance robustness of linear passive
networks. In clock network design, links can be inserted
between subnetworks to reduce the variability of clock
skews introduced by process and environmental fluctuations,
thereby improving the network’s immunity to PVT variations.
Under these scenarios, it is desired to incrementally
compute a reduced-order model for the updated network in
order to efficiently evaluate the effectiveness of link insertions.
In this paper, we present an efficient model update
scheme for general link-insertion networks. By updating the
Krylov projection subspace used in model order reduction,
the proposed scheme can efficiently compute a reduced-order
model for the network with inserted links. More generally,
we extend the proposed approach to consider the merging of
a (small) multiple-input linear network with a much larger
network. We demonstrate the usage of the proposed technique
for clock networks and general RLC circuits with an
arbitrary number of link insertions as well as the more general
case where the inserted links are in the form of a linear
network.
|
 Additional Information
|
Citation:
Zhuo Feng, Peng Li, Jiang Hu,
"Efficient Model Update for General Link-Insertion Networks,"
isqed,
pp. 43-50,
7th International Symposium on Quality Electronic Design (ISQED'06),
2006
|
|
