Abstract
This paper proposed a small-area deterministic pattern generator, which is optimized by two issues, pattern reordering and partitioning. The main effort is concentrated on pattern partitioning. We proposed an estimating method to select the optimal group size of partitioning. A comparison is done based on ISCAS85 benchmark circuits.