https://scholars.lib.ntu.edu.tw/handle/123456789/152571
標題: | A Gauss-elimination based PRPG for combinational circuits | 作者: | Huang, Li-Ren Kuo, Sy-Yen Chen, Ing-Yi |
公開日期: | 三月-1995 | 起(迄)頁: | Proceeding-s | 來源出版物: | European Design and Test Conference, 1995. ED&TC 1995 | 摘要: | 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. |
URI: | http://ntur.lib.ntu.edu.tw//handle/246246/2007041910032111 https://www.scopus.com/inward/record.uri?eid=2-s2.0-33845428829&doi=10.1109%2fedtc.1995.470390&partnerID=40&md5=814a3b175b391313a02d4b819f3322f0 |
其他識別: | N/A | DOI: | 10.1109/EDTC.1995.470390 | SDG/關鍵字: | Timing circuits; Benchmark circuit; Fault coverages; Gauss elimination; Hardware overheads; Pseudo random; Software systems; Test lengths; Test sets; Software testing |
顯示於: | 電機工程學系 |
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
00470390.pdf | 447.83 kB | Adobe PDF | 檢視/開啟 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。