A Gauss-elimination based PRPG for combinational circuits
Resource
European Design and Test Conference, 1995. ED&TC 1995, Proceedings.
Journal
European Design and Test Conference, 1995. ED&TC 1995
Pages
Proceeding-s
Date Issued
1995-03
Date
1995-03
Author(s)
DOI
N/A
Abstract
A new algorithm for the reseeding of multiple polynomial LFSR for pseudorandom teat pattern genera- Tion(PRPG) is proposed in this paper∗. It is based on the Gauss- elimination procedure and the. deterministic test set generated by an ATPG software system for combinational circuits. In addition to the general LFSR model, wc also provide two further improve-ments, mslp and lsmp, to minimize the hardware overhead. Experimental results were obtained on IS- CAS.85 benchmark circuits to demonstrate the effectiveness of this methodology. Complete fault coverage is achieved in all circuits. Low hardware overhead is also maintained with a reasonable test length.
Other Subjects
Timing circuits; Benchmark circuit; Fault coverages; Gauss elimination; Hardware overheads; Pseudo random; Software systems; Test lengths; Test sets; Software testing
Type
conference paper
File(s)![Thumbnail Image]()
Loading...
Name
00470390.pdf
Size
447.83 KB
Format
Adobe PDF
Checksum
(MD5):04d21fd4a7467caf1f5aa480ec1332be