Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/10735
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKavousianos, X.en
dc.contributor.authorBakalis, D.en
dc.contributor.authorNikolos, D.en
dc.contributor.authorTragoudas, S.en
dc.date.accessioned2015-11-24T17:00:16Z-
dc.date.available2015-11-24T17:00:16Z-
dc.identifier.issn0278-0070-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/10735-
dc.rightsDefault Licence-
dc.subjectbuilt-in self-testen
dc.subjecttest pattern generatorsen
dc.subjecton-a-chipen
dc.subjectbisten
dc.titleA new built-in TPG method for circuits with random pattern resistant faultsen
heal.typejournalArticle-
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.languageen-
heal.accesscampus-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.publicationDate2002-
heal.abstractThe partition of the inputs of a circuit under test (CUT) into groups of compatible inputs reduces the size of a test pattern generator and the length of the test sequence for built-in self-test (BIST) applications. In this paper, a new test-per-clock BIST scheme is proposed which is based on multiple input partitions. The test session consists of two or more phases, and a new grouping is applied during each test phase. Using the proposed method a CUT can be tested at-speed and complete fault coverage (100%) is achieved with a small number of test vectors and small area overhead. Our experiments show that the proposed technique compares favorably to the already known techniques.en
heal.journalNameIeee Transactions on Computer-Aided Design of Integrated Circuits and Systemsen
heal.journalTypepeer reviewed-
heal.fullTextAvailabilityTRUE-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)

Files in This Item:
File Description SizeFormat 
Kavousianos-2002-A New Built-In TPG Method for Circuits With Random.pdf375.57 kBAdobe PDFView/Open    Request a copy


This item is licensed under a Creative Commons License Creative Commons