Algorithm Design for VLSI Layout

VLSI布局算法设计

• 批准号: 9207267
• 负责人: Majid Sarrafzadeh
• 金额: $ 19.57万
• 依托单位: Northwestern University
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 1992
• 资助国家: 美国
• 起止时间: 1992-12-01 至 1996-11-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9207267&HistoricalAwards=false
• 关键词: Algorithm; Design; VLSI; Layout

Sarrafzadeh The research is in four areas of geometric algorithms for design tools. The research topics are: 1. floor planning by graph dualization; 2. placement of modules by exploiting circuit regularities; 3. rectilinear Steiner tree problems; and 4. point dominance problems. In floor-planning, topological aspects of the problem are considered and geometric issues such as sizing are explored. A clustering technique for module placement, that exploits regularities in circuit structures, is being investigated. In this way natural clusters that reflect the hierarchical perspective of circuit connections can be built automatically. Problems in approximate designs for global and single layer routing using Steiner trees are being investigated. Point dominance, from computational geometry, is being applied to circuit layout problems.

Sarrafzadeh这项研究涉及设计工具几何算法的四个领域。研究课题为：1.；图二化法的平面规划2. 利用电路规律布置模块；3. 线性斯坦纳树问题；和4。点优势问题。在楼层规划中，考虑了问题的拓扑方面，并探讨了诸如尺寸等几何问题。一种利用电路结构规律的模块放置聚类技术正在研究中。通过这种方式，可以自动构建反映电路连接层次观点的自然集群。研究了基于斯坦纳树的全局和单层路由近似设计问题。点支配，从计算几何，被应用到电路布局问题。