淡江大學機構典藏:Item 987654321/52803
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62819/95882 (66%)
造访人次 : 4011014      在线人数 : 956
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/52803


    题名: A Novel Reseeding Mechanism for Improving Pseudo-Random Testing of VLSI Circuits
    作者: Rau, Jiann-chyi;Wu, Po-han;Ho, Ying-fu
    贡献者: 淡江大學電機工程學系
    关键词: BIST;LFSR;Pseudo-Random Testing;Reseeding
    日期: 2008-06
    上传时间: 2010-12-01 10:33:14 (UTC+8)
    出版者: 臺北縣:淡江大學
    摘要: During built-in self-test (BIST), the set of patterns generated by a pseudo-random pattern generator may not provide sufficiently high fault coverage and many patterns can't detect fault (called useless patterns). In order to reduce the test time, we can remove useless patterns or change them to useful patterns (fault dropping). In fact, a random test set includes many useless patterns. Therefore we present a technology, including both reseeding and bit modifying (a.k.a. pattern mapping) to remove useless patterns or change them to useful patterns. When patterns changed, we pick out number of different fewer bits, leading to very short test length. Then we use an additional bit counter to improve test length and achieve high fault coverage. The technique we present is applicable for single-stuck-at faults. Experimental results indicate that complete fault coverage-100% can be obtained with less test time.
    關聯: 淡江理工學刊=Tamkang journal of science and engineering 11(2),頁175-184
    DOI: 10.6180/jase.2008.11.2.09
    显示于类别:[電機工程學系暨研究所] 期刊論文

    文件中的档案:

    档案 大小格式浏览次数
    1560-6686_11-2-9.pdf433KbAdobe PDF456检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈