Lower Bounds on Test Resources for Scheduled Data Flow Graphs

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 lower 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 flow 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. Introduction Estimation of data path resources during high-level synthesis enables a designer to evaluate certain aspects of a design by comparing the estimates with specified constraints. By providing quick feedback for any design decision, estimates aid the designer in exploring a number of design alternatives instead of synthesizing a complete implementation and then meas..