A FPGA Implementation of BIST Design for the Batch Testing


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 7, pp. 1900-1906, Jul. 1997
10.3745/KIPSTE.1997.4.7.1900,   PDF Download:

Abstract

In this paper, the efficient BILBO(named EBILBO) is designed for BIST that is able to batch the testing when circuit is designed on FPGA. The proposed algorithm of batch testing is able to test the normal operation speed with one-pin-count that can control all part of large and complex circuit. PRTPG is used for for the test pattern and MISR is used for PSA. The proposed algorithm of batch testing is VHDL coding on behavioral description, so it is easily modified the model of test pattern generation, signature analysis and compression. The EBILBO's area and the performance of designed BIST are evaluated with ISCAS89 benchmark circuit on FPGA. In circuit with above 600 cells, it is shown that area is reduced below 30%, test pattern is flexibly generated about 500K and the fault coverage is from 88.3% to 100%. EBILBO for the proposed batch testing BIST is able to execute concurrently normal and test mode operation in real time to the number of s n (2^s/2^p-1) clock(where, in CUT, # of PI;n, # of register, p is order # of polynomial). The proposed algorithm coded with VHDL is made of library, then it well be widely applied to DFT that satisfy the design and test field on sme time.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
R. K. Hyeon, "A FPGA Implementation of BIST Design for the Batch Testing," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 7, pp. 1900-1906, 1997. DOI: 10.3745/KIPSTE.1997.4.7.1900.

[ACM Style]
Rhee Kang Hyeon. 1997. A FPGA Implementation of BIST Design for the Batch Testing. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 7, (1997), 1900-1906. DOI: 10.3745/KIPSTE.1997.4.7.1900.