Maze routing algorithms with exact matching constraints for analog and mixed signal designs
Maze routing algorithms with exact matching constraints for analog and mixed signal designs
复制标题
DOI：
10.1145/2429384.2429409
复制
发表时间：
2012-11
期刊：
影响因子：
--
通讯作者：
Muhammet Mustafa Ozdal;R. Hentschke
中科院分区：
文献类型：
--
作者：
Muhammet Mustafa Ozdal;R. Hentschke
模拟和混合信号设计的设计自动化变得越来越重要，因为模拟和数字组件集成在同一片上系统（SOC）上。精确的布线匹配对于具有非均匀金属堆叠的模拟和混合信号设计是一个重要的约束。在本文中，我们提出了一个基于约束路径的迷宫布线算法，可以处理多个网络的精确匹配约束。我们还提出了一个可扩展的框架，利用建议的迷宫路由算法的现实问题的大小。与最近提出的图案布线算法[8]相比，我们的算法允许通过插入弯曲以避免拥挤区域来更彻底地探索解决方案空间。实验结果表明，该算法导致显着降低拥塞成本相比，以前的算法。
Design automation for analog and mixed signal designs has become more important, as analog and digital components are integrated on the same system-on-chips (SOCs). Exact route matching is an important constraint for analog and mixed signal designs with nonuniform metal stacks. In this paper, we propose a constrained-path based maze routing algorithm that can handle exact matching constraints for multiple nets. We also propose a scalable framework that utilizes the proposed maze routing algorithm for realistic problem sizes. Compared to the pattern routing algorithms proposed recently [8], our algorithms allow a more thorough exploration of the solution space by allowing bends to be inserted to avoid congested regions. The experimental study demonstrates that the proposed algorithm leads to significant reductions in congestion costs compared to the previous algorithm.