A fast algorithm to generate the universal test sets (UTS) for combinational function blocks is presented. The algorithm generates the UTS directly by Shannon-expanding and complementing the function, instead of the conventional truth table enumerating. This significantly reduces the time complexity and the memory requirements. Experimental results show that this algorithm achieves an improvement of 2 approximately 6 orders of magnitude in computational efficiency over that described by B. Sheldon and J.R. Akers (1973). This makes the UTS generation be practical for combinational function blocks.
展开▼
