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.

[1]  Haidar Harmanani,et al.  A data path synthesis method for self-testable designs , 1991, 28th ACM/IEEE Design Automation Conference.

[2]  LaNae J. Avra,et al.  ALLOCATION AND ASSIGNMENT IN HIGH-LEVEL SYNTHESIS FOR SELF-TESTABLE DATA PATHS , 1991, 1991, Proceedings. International Test Conference.

[3]  Melvin A. Breuer,et al.  Estimating BIST Resources in High-level Synthesis , 1996 .

[4]  Nikil D. Dutt,et al.  Comprehensive Lower Bound Estimation From Behavioral Descriptions , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[5]  Christos A. Papachristou,et al.  Method for RTL Synthesis with Testability Tradeoffst , 1993 .

[6]  Melvin A. Breuer,et al.  Data Path Allocation for Synthesizing RTL Designs with Low BIST Area Overhead , 1995, 32nd Design Automation Conference.

[7]  K. Kucukcakar,et al.  Data path tradeoffs using MABAL , 1990, 27th ACM/IEEE Design Automation Conference.

[8]  Christos A. Papachristou,et al.  An improved method for RTL synthesis with testability tradeoffs , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[9]  Robert A. Walker,et al.  Computing lower bounds on functional units before scheduling , 1994, Proceedings of 7th International Symposium on High-Level Synthesis.

[10]  Yuan Hu,et al.  Lower bounds on the iteration time and the number of resources for functional pipelined data flow graphs , 1993, Proceedings of 1993 IEEE International Conference on Computer Design ICCD'93.

[11]  Alok Sharma,et al.  Estimating Architectural Resources and Performance for High-Level Synthesis Applications , 1993, 30th ACM/IEEE Design Automation Conference.

[12]  Alice C. Parker,et al.  Data path tradeoffs using MABAL , 1991, DAC '90.

[13]  Alex Orailoglu,et al.  SYNCBIST: SYNthesis for concurrent built-in self-testability , 1994, Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors.