Algorithms for VLSI Design

VLSI 设计算法

• 批准号: 9023238
• 负责人: Douglas Dunham
• 金额: $ 18.88万
• 依托单位: University of Minnesota-Twin Cities
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 1991
• 资助国家: 美国
• 起止时间: 1991-05-15 至 1995-04-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9023238&HistoricalAwards=false
• 关键词: Algorithms; VLSI; Design

Thomborson The theory underlying optimal adder design and global wire routing is well understood, so the focus is on implementation issues. Experimental software is being developed to determine optimal adders. Attention is being paid to tradeoffs between the smallest area, fastest, and least power adders. The feasibility of using large linear programs to solve the problem of routing wires on chips and modules is being investigated. Theoretical work is on the problem of finding minimum length tree shaped interconnections (Steiner trees) among a set of terminals on a VLSI chip. Rendering grey-scale images on a monochrome display terminal or laser printer is being explored. Algorithms, amenable to speedup on parallel or pipelined computers, are sought.

最优加法器设计和全局布线背后的理论很好理解，所以重点是实现问题。正在开发实验软件以确定最佳加法器。人们正在关注最小面积、最快速度和最小功耗加法器之间的权衡。使用大型线性程序解决芯片和模块上布线问题的可行性正在研究中。理论工作是在VLSI芯片上的一组终端之间寻找最小长度树形互连（斯坦纳树）的问题。正在探索在单色显示终端或激光打印机上渲染灰度图像。需要寻找能够在并行或流水线计算机上加速的算法。