English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 14490525      Online Users : 35
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 > 電機資訊學院 > 資訊工程學系 > 會議論文  >  Binary decision diagram with minimum expected path length


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


    Title: Binary decision diagram with minimum expected path length
    Authors: Yi-Yu Liu
    Kuo-Hua Wang
    TingTing Hwang
    Liu, C.L.
    教師: 黃婷婷
    Date: 2001
    Publisher: Institute of Electrical and Electronics Engineers Inc
    Relation: Automation and Test in Europe,2001.Conference and Exhibition 2001.Proceedings 13-16 March 2001, Page(s):708-712
    Keywords: Boolean functions
    binary decision diagrams
    logic CAD
    minimisation of switching nets
    Boolean functions representation
    binary decision diagram
    bottom-up method
    directed acyclic graph
    efficient algorithms
    generic data structure
    middle-way method
    minimized evaluation time
    minimum expected path length
    root node
    terminal node
    top-down method
    variable ordering
    Abstract: We present methods to generate a Binary Decision Diagram (BDD) with minimum expected path length. A BDD is a generic data structure which is widely used in several fields. One important application is the representation of Boolean functions. A BDD representation enables us to evaluate a Boolean function: Simply traverse the BDD from the root node to the terminal node and retrieve the value in the terminal node. For a BDD with minimum expected path length will be also minimized the evaluation time for the corresponding Boolean function. Three efficient algorithms for constructing BDDs with minimum expected path length are proposed
    Relation Link: http://ieeexplore.ieee.org/Xplore/dynhome.jsp
    URI: http://nthur.lib.nthu.edu.tw/handle/987654321/13553
    Appears in Collections:[資訊工程學系] 會議論文
    [積體電路設計技術研發中心] 會議論文

    Files in This Item:

    File Description SizeFormat
    2030202030026.pdf390KbAdobe PDF847View/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