GABIST: A New Methodology to Find near Optimal LFSR for BIST Structure

Fault coverage and test time have important roles in using built in self-test (BIST). Two parameters are crucial and effective in BIST design: LFSR's polynomial (or configuration) and its initial seed. In this paper we propose a practical method for finding near optimal LFSR with genetic algorithm (GA) and show that LFSR is a good TPG compared with other TPGs. In this method, the candidate seeds are achieved through a deterministic approach, and an evolutionary approach is employed to obtain the LFSR configurations for the desired fault coverage under test time constraint. The configurations are encoded in binary chromosomes. The evolution process evolves the fittest configurations to achieve the maximum fault coverage within minimum test time. Some of ISCAS'85, ISCAS'89 and ITC'99 test cases are used to evaluate the proposed approach. Experimental results show good performance in BIST hardware and test time with constrained fault coverage.

[1]  Mehdi Salmani Jelodar,et al.  Power Aware Scan-Based Testing using Genetic Algorithm , 2006, 2006 Canadian Conference on Electrical and Computer Engineering.

[2]  Dong Sam Ha,et al.  AN EFFICIENT, FORWARD FAULT SIMULATION ALGORITHM BASED ON THE PARALLEL PATTERN SINGLE FAULT PROPAGAT , 1991, 1991, Proceedings. International Test Conference.

[3]  Biplab Sikdar,et al.  GF(2/sup p/) cellular automata as a built in self test structure , 2001, Proceedings of the ASP-DAC 2001. Asia and South Pacific Design Automation Conference 2001 (Cat. No.01EX455).

[4]  H.-J. Wunderlich,et al.  Optimal hardware pattern generation for functional BIST , 2000, Proceedings Design, Automation and Test in Europe Conference and Exhibition 2000 (Cat. No. PR00537).

[5]  Dhiraj K. Pradhan,et al.  GLFSR-a new test pattern generator for built-in-self-test , 1994, Proceedings., International Test Conference.

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

[7]  R. Ubar,et al.  LFSR Polynomial and Seed Selection Using Genetic Algorithm , 2006, 2006 International Biennial Baltic Electronics Conference.

[8]  Janusz Rajski,et al.  Arithmetic Built-In Self-Test for Embedded Systems , 1997 .

[9]  David Bryan,et al.  Combinational profiles of sequential benchmark circuits , 1989, IEEE International Symposium on Circuits and Systems,.

[10]  Janusz Rajski,et al.  Automated synthesis of large phase shifters for built-in self-test , 1998, Proceedings International Test Conference 1998 (IEEE Cat. No.98CH36270).

[11]  C. Landrault,et al.  On calculating efficient LFSR seeds for built-in self test , 1999, European Test Workshop 1999 (Cat. No.PR00390).

[12]  Giovanni Squillero,et al.  RT-Level ITC'99 Benchmarks and First ATPG Results , 2000, IEEE Des. Test Comput..

[13]  Biplab K. Sikdar,et al.  Cellular automata as a built in self test structure , 2001, ASP-DAC '01.

[14]  Chin-Long Wey,et al.  Built-in self-test (BIST) design of high-speed carry-free dividers , 1995, International Symposium on Circuits and Systems.