Procedures for Static Compaction of Test Sequences for Synchronous Sequential Circuits

نویسندگان

  • Irith Pomeranz
  • Sudhakar M. Reddy
چکیده

ÐWe propose three static compaction techniques for test sequences of synchronous sequential circuits. We apply the proposed techniques to test sequences generated for benchmark circuits by various test generation procedures. The results show that the test sequences generated by all the test generation procedures considered can be significantly compacted. The compacted sequences thus have shorter test application times and smaller memory requirements. As a by-product, the fault coverage is sometimes increased as well. Additionally, the ability to significantly reduce the length of the test sequences indicates that it may be possible to reduce test generation time if superfluous input vectors are not generated. Index TermsÐStatic test compaction, synchronous sequential circuits, test application time.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

PROPTEST: a property-based test generator for synchronous sequential circuits

We describe a property-based test generation procedure for synchronous sequential circuits. Several techniques are used to generate test sequences that achieve high fault coverages at low computational complexity. These include the use of static test compaction, input vector holding with optimal numbers of hold cycles, input vector perturbation, and identification of subsequences that are usefu...

متن کامل

IEEE VLSI Test Symposium 1997, pp. 188-195 Fast Algorithms For Static Compaction of Sequential Circuit Test Vectors

Two fast algorithms for static test sequence compaction are proposed for sequential circuits. The algorithms are based on the observation that test sequences traverse through a small set of states, and some states are frequently re-visited throughout the application of a test set. Subsequences that start and end on the same states may be removed if necessary and su cient conditions are met for ...

متن کامل

Accelerated Static Compaction for Sequential Circuits by Exploiting "Essential" Subsequences

In this paper a GA-based method that compacts Test Sequences for sequential circuits is presented. In this algorithm from an initial set of test sequences a subset of sequences is selected and from these sequences parts of them (subsequences) are selected which are reordered and combined into one sequence covering all faults detected by the initial set. The method exploits the presence of essen...

متن کامل

Fast Algorithms for Static Compaction of Sequential Circuit Test Vectors

Two fast algorithms for static test sequence compaction are proposed for sequential circuits. The algorithms are based on the observation that test sequences traverse through a small set of states, and some states are frequently re-visited throughout the application of a test set. Subse-quences that start and end on the same states may be removed if necessary and suucient conditions are met for...

متن کامل

Partitioning and Reordering Techniques for Static Test Sequence Compaction of Sequential Circuits

Partitioning and Reordering Techniques for Static Test Sequence Compaction of Sequential Circuits Michael S. Hsiaoy and Srimat T. Chakradharyy yDepartment of Electrical and Computer Engineering, Rutgers University, Piscataway, NJ yyComputer & Communications Research Lab. NEC USA, Princeton, NJ Abstract We propose a new static test set compaction method based on a careful examination of attribut...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Computers

دوره 49  شماره 

صفحات  -

تاریخ انتشار 2000