arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1105.1261cs.CEcs.CGcs.DS
收藏

二维多边形图案的剪枝连续Haar变换及其在VLSI布局中的应用

Pruned Continuous Haar Transform of 2D Polygonal Patterns with Application to VLSI Layouts

Robin Scheibler, Paul Hurley, Amina Chebira

摘要:

我们介绍了一种算法的连续Haar变换的2D模式,可以描述多边形的有效计算。这些图案在VLSI工艺中是普遍存在的,其中它们用于描述设计和掩模布局。在那里,由于要解决的问题的规模,速度是至关重要的,因此需要非常快的算法。我们表明,借用计算几何的技术,我们不仅能够直接计算的连续Haar变换,但也做得很快。这是通过大量修剪变换树来实现的,从而在顶点数量很小时显著降低计算负荷,就像VLSI布局的情况一样。我们称这种新算法为修剪连续Haar变换。我们实现了该算法,并表明,在VLSI布局中发现的图案,该算法是在最坏的情况下,其离散对应的速度和高达12倍的速度。

英文摘要:

We introduce an algorithm for the efficient computation of the continuous Haar transform of 2D patterns that can be described by polygons. These patterns are ubiquitous in VLSI processes where they are used to describe design and mask layouts. There, speed is of paramount importance due to the magnitude of the problems to be solved and hence very fast algorithms are needed. We show that by techniques borrowed from computational geometry we are not only able to compute the continuous Haar transform directly, but also to do it quickly. This is achieved by massively pruning the transform tree and thus dramatically decreasing the computational load when the number of vertices is small, as is the case for VLSI layouts. We call this new algorithm the pruned continuous Haar transform. We implement this algorithm and show that for patterns found in VLSI layouts the proposed algorithm was in the worst case as fast as its discrete counterpart and up to 12 times faster.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑