The paper deals with functional testing of Boolean systems in cases when the functionality of the system is unknown. Constructions of optimal linear-checks for testing such systems that have an acceptable representation as low order polynomials are presented. The linear checks determine a set of binary test vectors that form a relatively small subgroup of Cn 2 (Cn 2 consists of all the n-bit binary vectors with addition modulo two). The paper shows that for Walsh-transform-based implementations it is possible to define a subgroup in Cn 2 which does not depend on the actual functionality of the system. Moreover, the check set can be defined even without knowing neither the number of input variables nor their precision.
|Title of host publication
|10th Int. Workshop Boolean Problems
|Published - 2012