Skip to main navigation Skip to search Skip to main content

A gauss-elimination based PRPG for combinational circuits

  • Li Ren Huang
  • , Sy Yen Kuo
  • , Ing Yi Chen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

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.

Original languageEnglish
Title of host publicationProceedings of the 1995 European Conference on Design and Test, EDTC 1995
PublisherAssociation for Computing Machinery, Inc
Pages212-216
Number of pages5
ISBN (Electronic)0818670398, 9780818670398
DOIs
StatePublished - 6 Mar 1995
Event1995 European Conference on Design and Test, EDTC 1995 - Paris, France
Duration: 6 Mar 19959 Mar 1995

Publication series

NameProceedings of the 1995 European Conference on Design and Test, EDTC 1995

Conference

Conference1995 European Conference on Design and Test, EDTC 1995
Country/TerritoryFrance
CityParis
Period6/03/959/03/95

Fingerprint

Dive into the research topics of 'A gauss-elimination based PRPG for combinational circuits'. Together they form a unique fingerprint.

Cite this