Behavioral synthesis for easy testability in data path scheduling

Abstract

This paper presents a data path scheduling algorithm to improve testability without a priori assuming any particular test strategy. We introduce a scheduling heuristic for easy testability, based on our previous work [I51 on data path allocation for testability. We then develop a mobility path scheduling algorithm to implement this heuristic while also minimizing area. Experimental results on benchmark and ezample circuits show high fault coverage, short test generation time, and little or no area overhead.