Co-evolutionary high-level test synthesis

The main approach of this paper is utilizing bio-inspired evolutionary strategies for high level test synthesis. In this paper a genetic algorithm (GA) is implemented to schedule a data-flow graph considering latency. Also, module binding is performed with another GA concurrently, considering resource constraints. The register allocation is performed using another GA which minimizes the number of registers. Then a co-evolutionary strategy merges the results of these three solutions, targeting testability improvement. Experimental results show using the proposed approach results in improvement in fault coverage with no or negligible overhead in area and delay.

[1]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

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

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

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

[5]  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.

[6]  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.

[7]  J. 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).

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

[9]  Hadi Esmaeilzadeh,et al.  A parameterized graph-based framework for high-level test synthesis , 2006, Integr..

[10]  David Beasley,et al.  An overview of genetic algorithms: Part 1 , 1993 .

[11]  Robert H. Storer,et al.  Datapath synthesis using a problem-space genetic algorithm , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

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

[14]  Sujit Dey,et al.  High-level synthesis for testability: a survey and perspective , 1996, DAC '96.

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

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

[17]  Laurence T. Yang,et al.  An efficient algorithm to integrate scheduling and allocation in high-level test synthesis , 1998, Proceedings Design, Automation and Test in Europe.