A tree matching chip

Proceedings of 9th International Conference on VLSI Design Pub Date : 1996-01-03 DOI:10.1109/ICVD.1996.489611

V. Krishna, N. Ranganathan, A. Ejnioui

引用次数: 5

Abstract

Tree matching is an important problem used for 3D object recognition in image understanding and vision systems. It is also used in the design of on-line interpreter systems as well as code optimization in compilers. The objective of tree matching is to find the set of nodes at which a pattern tree matches a subject tree. Recently, two linear systolic array algorithms have been proposed by the authors. In this paper, we propose an improved approach wherein the the systolic algorithm is based on a linear array of fixed size independent of the problem size and larger strings are partitioned and processed based on the array size. Also, the architecture is simplified by moving the logic for processing variables in each PE to a single PE attached at the end. The systolic algorithm and architecture have been verified through simulation using the Cadence design tools.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

一棵树匹配芯片

树匹配是图像理解和视觉系统中用于三维物体识别的一个重要问题。它还用于在线解释器系统的设计以及编译器中的代码优化。树匹配的目标是找到模式树与主题树匹配的节点集。最近，作者提出了两种线性收缩阵列算法。在本文中，我们提出了一种改进的方法，其中收缩算法基于固定大小的线性数组，与问题大小无关，较大的字符串根据数组大小进行分区和处理。此外，通过将每个PE中处理变量的逻辑移动到最后附加的单个PE中，可以简化体系结构。利用Cadence设计工具进行仿真，验证了收缩算法和结构。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Proceedings of 9th International Conference on VLSI Design

自引率

0.00%

发文量

期刊最新文献

A 20 MHz; CMOS variable gain amplifier Parallel concurrent path-delay fault simulation using single-input change patterns A tree matching chip An efficient test generation technique for sequential circuits with repetitive sub-circuits Routing using implicit connection graphs [VLSI design]