Lower bounds on test resources for scheduled data flow graphs
Ishwar Parulkar, Sandeep K. Gupta, Melvin A. Breuer · 1996
Abstract|Lower bound estimations of resources at various stages of high-level synthesis are essential to guide synthesis algorithms towards optimal solutions.In this paper we present l o w er bounds on the number of test resources (i.e.test pattern generators, signature analyzers and CBILBO registers) required to test a synthesized data path using built-in self-test (BIST).The estimations are performed on scheduled data ow graphs and provide a practical way of selecting or modifying module assignments and schedules such that the resulting synthesized data path requires a small number of test resources to test itself.I.