Constructive pattern generation heuristic for meeting SSO limits

This paper discusses a heuristic for generating a minimal number of true/complement patterns while still meeting simultaneous switching requirements. The algorithm presented herein generates the patterns by construction, as opposed to selecting the patterns from a larger superset of possible patterns. This potentially offers advantages in time and memory, since no information about the superset needs to be stored or analyzed. In addition, the algorithm appears to produce good results, which in this case means small pattern sets while maintaining the same high level of fault coverage offered by other methods.