Department of Electrical Engineering
National Tsing Hua University
Hsinchu, Taiwan 30043, Republic of China
We show that the testing of some binary ILAs is equivalent to a tile problem, which in turn can be formulated as a graph coloring problem. With the aid of the graph model, many M-testable hetero geneous arrays can easily be identified. A good existing graph coloring algorithm, therefore, can be adopted for ILA test generation.
Keywords: testing, iterative logic array, cellular array, tile, domino, colorability, C-testable, M-testable
Received August 24, 1989; revised December 9, 1989.
Communicated by Richard C. T. Lee.
*This work supported in part by the National Science Council, R.O.C., under Contracts NSC79-0404-E007-06 and NSC 79-0404-E007-21.