Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
For any two n-bit numbers a≤b define the Boolean function f[a,b]:{0,1}n→{0,1} to be the function for which fa,b=1 if and only if x is the binary representation of a number in the interval [a,b]. We consider the disjunctive normal form representation of such functions, and show how to compute such a representation with a minimum number of disjuncts in linear time. We also show how to compute a minimum "disjoint" representation; i.e., a representation in which the domains of the disjuncts are mutually disjoint. The minimum disjunctive normal form can be applied to devise efficient constraint satisfaction systems for automatic generation of test patterns. © 2005 Elsevier B.V. All rights reserved.
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
Harpreet S. Sawhney
IS&T/SPIE Electronic Imaging 1994
L Auslander, E Feig, et al.
Advances in Applied Mathematics