The Weighted Syndrome Sums Approach to VLSI Testing

Zeev Barzilai, Jacob Savir, George Markowsky, Merlin G. Smith

Research output: Contribution to journalArticlepeer-review

36 Scopus citations

Abstract

With the advent of VLSI, testing has become one of the most costly, complicated, and time consuming problems. The method of syndrome-testing is applicable toward VLSI testing since it does not require test generation and fault simulation. It can also be considered as a vehicle for self-testing. In order to employ syndrome-testing in VLSI, we electronically partition the chip into macros in test mode. The macros are then syndrome tested in sequence. In this paper we show the means to syndrome-test macros. We examine the size of the syndrome driver counter and establish a method of determining its minimal length. The problem of minimizing the number of syndrome references needed for testing is also investigated. It is shown that it is always possible to use one weighted syndrome sum as reference for each and every macro. The question of weighted sum syndrome-testability is addressed and methods to achieve it are discussed. A self-test architecture based on these concepts is described.

Original languageEnglish (US)
Pages (from-to)996-1000
Number of pages5
JournalIEEE Transactions on Computers
VolumeC-30
Issue number12
DOIs
StatePublished - Dec 1981
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'The Weighted Syndrome Sums Approach to VLSI Testing'. Together they form a unique fingerprint.

Cite this