Table of Contents
VLSI Design
Volume 14, Issue 1, Pages 107-122

Term Trees in Application to an Effective and Efficient ATPG for AND–EXOR and AND–OR Circuits

1Faculty of Electrical Engineering, Eindhoven University of Technology, P.O. Box 513 EH 10.25, Eindhoven 5600, MB, The Netherlands
2Department of Electrical and Computer Engineering, Portland State University, Portland 97207, OR, USA

Received 20 January 2000; Revised 4 October 2000

Copyright © 2002 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


A compact data representation, in which the typically required operations are performed rapidly, and effective and efficient algorithms that work on these representations are the essential elements of a successful CAD tool. The objective of this paper is to present a new data representation—term trees (TTs)—and to discuss its application for an effective and efficient structural automatic test-pattern generation (ATPG). Term trees are decision diagrams similar to BDDs that are particularly suitable for structure representation of AND–OR and AND–EXOR circuits. In the paper, a flexible algorithm for minimum term-tree construction is discussed and an effective and efficient algorithm for ATPG for AND–EXOR and AND–OR circuits is proposed.

The term trees can be used for many other purposes in logic design and in other areas—for all purposes where compact representation and efficient manipulation of term sets is important. The presented experimental results show that term trees are indeed a compact data representation allowing fast manipulations. They form a good base for algorithms considering the function's and circuit's term structures.