Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing

  • Authors:
  • Z. Barzilai;D. Coppersmith;A. L. Rosenberg

  • Affiliations:
  • IBM T. J. Watson Research Center;-;-

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1983

Quantified Score

Hi-index 14.99

Visualization

Abstract

One has a shift register of length n and a collection of designated subsets of {0, 1,···, n-1}. The problem is to devise a method for feeding a string of bits into the shift register in such an order that, for each designated subset S = {k1,···, kr}, if one keeps track of the bit patterns appearing at the corresponding positions k1, ···, krof the shift r