A parameterized graph-based framework for high-level test synthesis

Improving testability during the early stages of high-level synthesis has several benefits including reduced test hardware overheads, reduced test costs, reduced design iterations, and significant improved fault coverage. In this paper, we present a novel register allocation method, which is based on weighted graph coloring algorithm, targeting testability improvement for digital circuits. In our register allocation method, several high-level testability parameters including sequential depth, sequential loop, and controllability/ observability are considered. Our experiments show using this register allocation method results in significant improvement in automatic test pattern generation time and fault coverage.

[1]  Niraj K. Jha,et al.  Behavioral synthesis for easy testability in data path allocation , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[2]  Niraj K. Jha,et al.  Behavioral Synthesis of Highly Testable Data Paths under the Non-Scan and Partial Scan Environments , 1993, 30th ACM/IEEE Design Automation Conference.

[3]  Hideo Fujiwara,et al.  Handling the pin overhead problem of DFTs for high-quality and at-speed tests , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Daniel P. Siewiorek,et al.  Automated Synthesis of Data Paths in Digital Systems , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[5]  Fadi J. Kurdahi,et al.  REAL: A Program for REgister ALlocation , 1987, 24th ACM/IEEE Design Automation Conference.

[6]  John P. Knight,et al.  Applicability of a Subset of Ada as an Algorithmic Hardware Description Language for Graph-Based Hardware Compilation , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[7]  Kwang-Ting Cheng,et al.  On improving test quality of scan-based BIST , 2000, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Miodrag Potkonjak,et al.  Exploiting hardware sharing in high-level synthesis for partial scan optimization , 1993, ICCAD '93.

[9]  Akihiro Hashimoto,et al.  Wire routing by optimizing channel assignment within large apertures , 1971, DAC.

[10]  Srivaths Ravi,et al.  TAO: regular expression-based register-transfer level testability analysis and optimization , 2001, IEEE Trans. Very Large Scale Integr. Syst..

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

[12]  Alice C. Parker,et al.  Tutorial on high-level synthesis , 1988, DAC '88.

[13]  Bruno Rouzeyre,et al.  High-level synthesis for easy testability , 1995, Proceedings the European Design and Test Conference. ED&TC 1995.

[14]  Wolfgang Rosenstiel,et al.  Synthesizing circuits from behavioural descriptions , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  Bruno Rouzeyre,et al.  Scanning datapaths: a fast and effective partial scan selection technique , 1998, Proceedings Design, Automation and Test in Europe.

[16]  A. Mujumdar,et al.  Incorporating testability considerations in high-level synthesis , 1992, [1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing.

[17]  Andreas Steininger,et al.  Testing and built-in self-test - A survey , 2000, J. Syst. Archit..

[18]  Christos A. Papachristou,et al.  A built-in self-testing approach for minimizing hardware overhead , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[19]  Haidar M. Harmanani,et al.  An Evolutionary Algorithm for the Allocation Problem in High-level Synthesis , 2005, J. Circuits Syst. Comput..

[20]  H. Harmanani,et al.  An incremental approach for test scheduling and synthesis using genetic algorithms , 2004, The 2nd Annual IEEE Northeast Workshop on Circuits and Systems, 2004. NEWCAS 2004..

[21]  Mike Tien-Chien Lee,et al.  High-Level Test Synthesis of Digital VLSI Circuits , 1997 .

[22]  Janak H. Patel,et al.  High-level variable selection for partial-scan implementation , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).

[23]  Alice C. Parker,et al.  The high-level synthesis of digital systems , 1990, Proc. IEEE.

[24]  Mahmut T. Kandemir,et al.  An ILP formulation for reliability-oriented high-level synthesis , 2005, Sixth international symposium on quality electronic design (isqed'05).

[25]  Niraj K. Jha,et al.  Behavioral synthesis for easy testability in data path scheduling , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

[26]  Vishwani D. Agrawal,et al.  Essentials of electronic testing for digital, memory, and mixed-signal VLSI circuits [Book Review] , 2000, IEEE Circuits and Devices Magazine.

[27]  Dong Sam Ha,et al.  A new approach to built-in self-testable datapath synthesis based on integer linear programming , 2000, IEEE Trans. Very Large Scale Integr. Syst..

[28]  Janak H. Patel,et al.  HITEC: a test generation package for sequential circuits , 1991, Proceedings of the European Conference on Design Automation..

[29]  E. F. Girczyc,et al.  HAL: A Multi-Paradigm Approach to Automatic Data Path Synthesis , 1986, 23rd ACM/IEEE Design Automation Conference.

[30]  S. Dey,et al.  High-level synthesis for testability: a survey and perspective , 1996, 33rd Design Automation Conference Proceedings, 1996.

[31]  Haidar M. Harmanani,et al.  An evolutionary algorithm for the testable allocation problem in high-level synthesis , 2002, 9th International Conference on Electronics, Circuits and Systems.

[32]  Zebo Peng,et al.  Integrated scheduling and allocation of high-level test synthesis , 1998, Proceedings Eleventh Annual IEEE International ASIC Conference (Cat. No.98TH8372).

[33]  Sujit Dey,et al.  Considering testability during high-level design , 1998, Proceedings of 1998 Asia and South Pacific Design Automation Conference.