English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54371/62179 (87%)
Visitors : 8742632      Online Users : 95
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU 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
    National Tsing Hua University Institutional Repository > 電機資訊學院 > 資訊工程學系 > 博碩士論文  >  針對工程變更命令電路利用布林可滿足性問題使邏輯差異最小化


    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/86647


    Title: 針對工程變更命令電路利用布林可滿足性問題使邏輯差異最小化
    Authors: 秦勢翔
    Chin, Shih-Hsiang
    Description: GH02101062626
    碩士
    資訊工程學系
    Date: 2014
    Keywords: 邏輯差異最小化
    ECO;logic difference
    Abstract: 在IC 設計工業中,隨著技術越來越進步,設計也越來越複雜,
    經常會在設計的後端才發現問題,功能性的工程變更命令(ECO)的技
    術的應用,可有效的減少設計的時間以及製造的成本。在這篇論文,
    我們提出一個三階段的演算法,找尋兩電路最少的相異部分,最後利
    用邏輯閘回收使用的方法減少相異的部分。第一階段,從輸出端找尋
    結構等價的部分,第二階段,使用可滿足性(SAT)檢測程式,找尋兩
    電路邏輯等價的輸入端邊界,第三階段,替換部分邏輯閘找尋邏輯等
    價的輸出端。利用這三階段找到的相異電路再進行減小。從實驗解果
    可以得知,在大部分的案例都有不錯的結果。
    In the IC industry, chip design cycles are becoming more compressed, while designs
    themselves are growing in complexity. Functional specifications are often modified late
    in the design cycle, after placement and routing are complete. These trends necessitate
    efficient methods to handle late-stage engineering change orders (ECOs) to the functional
    specification, often in response to errors discovered after much of the implementation is
    finished. In this thesis, we propose a three-stage algorithm for generating a minimal logic
    difference between an original circuit and a modified circuit. Our method has three different
    stages and we perform them in order to produce a better patch. In the first phase, we search
    from the primary outputs to find structural equivalence between the original circuit and
    the modified circuit. In the second phase, we modify DeltaSyn[1] to use a SAT solver
    to identify logic equivalence near the input-side boundary of the changes. In the third
    phase, we create levels in each gate. According to levels, we check logically equivalent and
    choose replaced gates. After the three different stages, a gate-recycle[2] process performs
    the patch minimization in the final step. Encouraging experimental results are obtained by
    our method.
    URI: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/86647
    Source: http://thesis.nthu.edu.tw/cgi-bin/gs/hugsweb.cgi?o=dnthucdr&i=sGH02101062626.id
    Appears in Collections:[資訊工程學系] 博碩士論文

    Files in This Item:

    File SizeFormat
    GH02101062626.pdf71KbAdobe PDF185View/Open


    在NTHUR中所有的資料項目都受到原著作權保護,僅提供學術研究及教育使用,敬請尊重著作權人之權益。若須利用於商業或營利,請先取得著作權人授權。
    若發現本網站收錄之內容有侵害著作權人權益之情事,請權利人通知本網站管理者(smluo@lib.nthu.edu.tw),管理者將立即採取移除該內容等補救措施。

    SFX Query

    與系統管理員聯絡

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