• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国政府科技报告 >Channel and Switchbox Routing Using a Greedy Based Channel Algorithm with Outward Scanning Technique
【24h】

Channel and Switchbox Routing Using a Greedy Based Channel Algorithm with Outward Scanning Technique

机译：基于贪婪的信道算法和外向扫描技术的信道和交换机路由选择

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The problem of channel routing and for that matter routing in general has been attacked in a heuristic manner. This is not necessarily wrong, however it means that there is not always a solution to the problem. Channel routing is one of the most important phases in VLSI CAD (Very Large Scale Integration Computer Aided Design). It performs the detailed routing of a given channel. The switchbox is a four sided channel area, rectangular in shape, with nets entering from all four sides. There has been much work done in the channel and switchbox routing areas. The Greedy router, a proven heuristic, is one of the important building blocks for most of today's detailed routers and is used as basis for this thesis. Most routers scan the routing area using a left to right scanning method. This thesis attempts a different variation in routing, using an outward scanning technique. The thesis demonstrates how this new algorithm can be applied to various channel routing problems, by performing tests and making comparisons. The thesis also demonstrates how this new router can be used as a CAD tool. The new router assumes that all pins and wiring lie on a common grid, and that vertical wires are on one layer horizontal on another. The thesis also shows how this new channel router can be modified to allow for a switchbox router implementation. Theses. (jhd)

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号