BSG-Route: A length-matching router for general topology
BSG-Route: A length-matching router for general topology
复制标题
DOI：
10.1109/iccad.2008.4681621
复制
发表时间：
2008-11
期刊：
影响因子：
--
通讯作者：
Tan Yan;Martin D. F. Wong
中科院分区：
文献类型：
--
作者：
Tan Yan;Martin D. F. Wong
长度匹配布线是PCB布线中一个非常重要的问题。以往的长度匹配路由器[1]~[3]都有对路由拓扑的假设，而实际的设计可能不受任何拓扑约束。在本文中，我们提出了一种处理一般拓扑的路由器。与以前的路由器不同，我们的路由器对路由拓扑没有任何限制。此外，我们的路由器是无电网的。它的性能不依赖于输入的路由网格大小，而路由器依赖于输入的路由网格大小。这是一个很大的优势，因为现代PCB布线配置通常意味着巨大的布线网格。这项工作的新颖之处在于，我们将长度匹配路由问题视为一个区域分配问题，并使用一种放置结构，有界直线网格（BSG）来帮助解决问题。实验结果表明，该路由器可以处理以往路由器无法处理的实际设计。对于它们可以处理的设计，我们的路由器运行得快得多。例如，在我们的一个数据中，我们在88秒内获得结果，而路由器需要一天多的时间。
Length-matching routing is a very important issue for PCB routing. Previous length-matching routers [1]-[3] all have assumptions on the routing topology whereas practical designs may be free of any topological constraint. In this paper, we propose a router that deals with general topology. Unlike previous routers, our router does not impose any restriction on the routing topology. Moreover, our router is gridless. Its performance does not depend on the routing grid size of the input while routers do. This is a big advantage because modern PCB routing configurations usually imply huge routing grids. The novelty of this work is that we view the length-matching routing problem as an area assignment problem and use a placement structure, Bounded-Sliceline Grid (BSG), to help solving the problem. Experimental results show that our router can handle practical designs that previous routers canpsilat handle. For designs that they could handle, our router runs much faster. For example, in one of our data, we obtain the result in 88 seconds while the router takes more than one day.