Achieving minimal hardware multiple signature analysis for BIST

Y. Wu, A. Ivanov
{"title":"Achieving minimal hardware multiple signature analysis for BIST","authors":"Y. Wu, A. Ivanov","doi":"10.1109/ATS.1993.398823","DOIUrl":null,"url":null,"abstract":"This paper proposes a new method for achieving minimal hardware multiple intermediate signature analysis whereby n signatures are checked against a single reference. With a single reference, checking multiple signatures requires the same amount of hardware as for checking only one. However, checking multiple signatures has many advantages. In comparison to the method described by Y. Wie and A Ivahou (1993) in [13], the proposed method is faster by a factor of 2/sup k/, where k is the signature size. E.g., to check two 16-bit signatures against a single reference, the total CPU time cost (Sun Sparcstation 2) is less than 4 sec. for a test length of up to 2/sup 20/, independently of the size of the circuit under test (CUT).<<ETX>>","PeriodicalId":228291,"journal":{"name":"Proceedings of 1993 IEEE 2nd Asian Test Symposium (ATS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1993 IEEE 2nd Asian Test Symposium (ATS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ATS.1993.398823","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This paper proposes a new method for achieving minimal hardware multiple intermediate signature analysis whereby n signatures are checked against a single reference. With a single reference, checking multiple signatures requires the same amount of hardware as for checking only one. However, checking multiple signatures has many advantages. In comparison to the method described by Y. Wie and A Ivahou (1993) in [13], the proposed method is faster by a factor of 2/sup k/, where k is the signature size. E.g., to check two 16-bit signatures against a single reference, the total CPU time cost (Sun Sparcstation 2) is less than 4 sec. for a test length of up to 2/sup 20/, independently of the size of the circuit under test (CUT).<>
实现最小的BIST硬件多重签名分析
本文提出了一种实现最小硬件多重中间签名分析的新方法,即根据单个引用检查n个签名。对于单个引用,检查多个签名所需的硬件数量与只检查一个签名所需的硬件数量相同。但是,检查多个签名有很多优点。与Y. Wie和A . Ivahou(1993)在[13]中描述的方法相比,本文提出的方法的速度提高了2/sup k/,其中k为签名大小。例如,根据单个参考检查两个16位签名,对于高达2/sup 20/的测试长度,与测试电路(CUT)的大小无关,总CPU时间成本(Sun Sparcstation 2)小于4秒。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信