A CAD tool based on a group of efficient algorithms to verify,design,and optimize power/ground networks for standard cell model is presented.Nonlinear programming techniques,branch and bound algorithms and incomplete ...A CAD tool based on a group of efficient algorithms to verify,design,and optimize power/ground networks for standard cell model is presented.Nonlinear programming techniques,branch and bound algorithms and incomplete Cholesky decomposition conjugate gradient method (ICCG) are the three main parts of our work.Users can choose nonlinear programming method or branch and bound algorithm to satisfy their different requirements of precision and speed.The experimental results prove that the algorithms can run very fast with lower wiring resources consumption.As a result,the CAD tool based on these algorithms is able to cope with large-scale circuits.展开更多
A matrix whose entries are +,-, and 0 is called a sign pattern matrix. Let k be arbitrary positive integer. We first characterize sign patterns A such that .Ak≤0. Further, we determine the maximum number of negative ...A matrix whose entries are +,-, and 0 is called a sign pattern matrix. Let k be arbitrary positive integer. We first characterize sign patterns A such that .Ak≤0. Further, we determine the maximum number of negative entries that can occur in A whenever Ak≤0. Finally, we give a necessity and sufficiency condition for A2≤0.展开更多
文摘A CAD tool based on a group of efficient algorithms to verify,design,and optimize power/ground networks for standard cell model is presented.Nonlinear programming techniques,branch and bound algorithms and incomplete Cholesky decomposition conjugate gradient method (ICCG) are the three main parts of our work.Users can choose nonlinear programming method or branch and bound algorithm to satisfy their different requirements of precision and speed.The experimental results prove that the algorithms can run very fast with lower wiring resources consumption.As a result,the CAD tool based on these algorithms is able to cope with large-scale circuits.
基金Supported by Shanxi Natural Science Foundation(20011006)
文摘A matrix whose entries are +,-, and 0 is called a sign pattern matrix. Let k be arbitrary positive integer. We first characterize sign patterns A such that .Ak≤0. Further, we determine the maximum number of negative entries that can occur in A whenever Ak≤0. Finally, we give a necessity and sufficiency condition for A2≤0.
