基于VLSI布局的直线多项式的快速连续Haar和Fourier变换
Fast Continuous Haar and Fourier Transforms of Rectilinear Polygons from VLSI Layouts
摘要:
我们发展了修剪连续Haar变换和快速连续傅立叶级数,两个快速和有效的算法,直线多边形。在VLSI工艺中使用矩形多边形来描述集成电路的设计和掩模布局。傅立叶表示是在许多这些过程的核心和哈尔变换预计将发挥重要作用的技术设想,以加快超大规模集成电路的设计。为了确保不断缩小的晶体管的正确印刷,同时处理它们越来越大的数量,需要越来越多的计算密集型技术。因此,Haar和Fourier变换的有效算法至关重要。我们推导出这两种算法的复杂性,并将其与传统上用于VLSI的离散变换进行比较。我们发现一个显着的复杂性降低时,多边形的顶点数是小的,是在超大规模集成电路布局的情况下。这种分析是由连续算法和离散算法的实现和基准完成的。我们表明,在测试的VLSI布局的修剪连续Haar变换是5至25倍的速度,而快速连续傅立叶级数是1.5至3倍的速度。
英文摘要:
We develop the pruned continuous Haar transform and the fast continuous Fourier series, two fast and efficient algorithms for rectilinear polygons. Rectilinear polygons are used in VLSI processes to describe design and mask layouts of integrated circuits. The Fourier representation is at the heart of many of these processes and the Haar transform is expected to play a major role in techniques envisioned to speed up VLSI design. To ensure correct printing of the constantly shrinking transistors and simultaneously handle their increasingly large number, ever more computationally intensive techniques are needed. Therefore, efficient algorithms for the Haar and Fourier transforms are vital. We derive the complexity of both algorithms and compare it to that of discrete transforms traditionally used in VLSI. We find a significant reduction in complexity when the number of vertices of the polygons is small, as is the case in VLSI layouts. This analysis is completed by an implementation and a benchmark of the continuous algorithms and their discrete counterpart. We show that on tested VLSI layouts the pruned continuous Haar transform is 5 to 25 times faster, while the fast continuous Fourier series is 1.5 to 3 times faster.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。