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


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


    题名: A timing-driven pseudo-exhaustive testing of VLSI circuits
    作者: Chang, S. C.;Rau, J. C.
    贡献者: 淡江大學電機工程學系
    日期: 2000-05
    上传时间: 2010-04-15 11:41:05 (UTC+8)
    出版者: Institute of Electrical and Electronics Engineers (IEEE)
    摘要: The object of this paper is to reduce the delay penalty of bypass storage cell (bsc) insertion for pseudo-exhaustive testing. We first propose a tight delay lower bound algorithm which estimates the minimum circuit delay for each node after bsc insertion. By understanding how the lower bound algorithm loses optimality, we can propose a bsc insertion heuristic which tries to insert bscs so that the final delay is as close to the lower bound as possible. Our experiments show that the results of our heuristic are either optimal because they are the same as the delay lower bounds or they are very close to the optimal solutions.
    關聯: Circuits and Systems, 2000. Proceedings. ISCAS 2000 Geneva. The 2000 IEEE International Symposium on (Volume:2 ), pp.665-668
    DOI: 10.1109/ISCAS.2000.856416
    显示于类别:[電機工程學系暨研究所] 會議論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    0780354826_2p665-668.pdf449KbAdobe PDF668检视/开启
    index.html0KbHTML95检视/开启

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

    TAIR相关文章

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