English  |  正體中文  |  简体中文  |  Items with full text/Total items : 52047/87178 (60%)
Visitors : 8687842      Online Users : 200
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/95957

    Title: An Efficient Low-Overhead Policy for Constructing Multiple Scan-Chains
    Authors: Rau, Jiann-Chyi;Lin, Ching-Hsiu;Chang, Jun-Yi
    Contributors: 淡江大學電機工程學系
    Date: 2004-11
    Issue Date: 2014-02-13 11:26:39 (UTC+8)
    Abstract: In this paper, we present an efficient method for reducing the total length of the scan paths. The method appropriately assigns scan flip-flops into scan chains after these flip-flops being placed. We compare our proposed method with previous work based on pre-placement (PP), greedy (GR), and stable marriage (SM) assignment, and show that our method is superior to the previous approaches. We also perform our method on some of the ISCAS 89 benchmarks. The obtained results of our experiments indicate that our algorithm improves the scan chain lengths by 79%-96%and the CPU time almost increases linearly.
    Relation: Proceedings of The Asian Test Symposium, 2004,頁82-87
    Appears in Collections:[電機工程學系暨研究所] 會議論文

    Files in This Item:

    File SizeFormat
    An Efficient Low-Overhead Policy for Constructing Multiple Scan-Chains_英文摘要.docx21KbMicrosoft Word67View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

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