⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 http:^^www.cs.utexas.edu^users^cad^hiperf.html

📁 This data set contains WWW-pages collected from computer science departments of various universities
💻 HTML
字号:
MIME-Version: 1.0
Server: CERN/3.0
Date: Tuesday, 07-Jan-97 15:58:08 GMT
Content-Type: text/html
Content-Length: 2435
Last-Modified: Tuesday, 09-May-95 21:15:55 GMT

<title> Issues in High Performance VLSI </title><h1> Issues in High Performance VLSI</h1>The abstracts of papers by members of this group in the above area are listed below. Please use the email addresses at the end of eachabstract to get further details.<ul><li>Kai-Yuan Chao and D.F. Wong<b>Layer Assignment for High-Performance Multi-Chip Modules </b>. In<cite>Proceedings of the IEEE International Symposium on Circuits and Systems </cite>,April 1995. <p><blockquote>In this paper, we present a layer assignment method for high-performance multi-chip module environments.  In contrast with treating global routing and layer assignment separately, our method assigns nets to layers while considering preferable global routing topologies simultaneously.  We take transmission line effects into account to avoid noise in high-speed circuit packages.  The problem is formulated as a quadratic Boolean programming problem and an algorithm is presented to solve the problem after linearization.  Our method is applied to a set of benchmark circuits to demonstrate the effectiveness.</blockquote><b>Contact:</b> <i>chao@cs.utexas.edu</i><p><li> Shashidhar Thakur, Kai-Yuan Chao and D.F. Wong.<b> An Optimal Layer Assignment Algorithm for MinimizingCrosstalk for Three Layer VHV Channel Routing</b>.<cite>Proceedings of the IEEE International Symposiumon Circuits and Systems, </cite> April 1995.</a><p><blockquote>With the increasing density of VLSI circuits, theinterconnection wires are getting packed even closer. Thishas increased the effect of interaction between these wireson circuit performance and hence, the importance ofcontrolling crosstalk. We consider the gridded channelrouting problem where, specifically, the channel has 3 routinglayers in the VHV configuration. Given a horizontal trackassignment for the nets, we present an optimal algorithm forminimizing the crosstalk between vertical wiring segments inthe channel by finding an optimal vertical layer assignmentfor them. We show an algorithm that minimizes totalcrosstalk between between wires on the same V layer onadjacent columns of the grid in O(v log v) time using O(v) memory, where  the channel has v columns. Wethen extend this algorithm to consider crosstalk betweenwires in non-adjacent columns and between wires on differentlayers.</blockquote><b>Contact:</b> <i>thakur@cs.utexas.edu</i><p></ul>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -