English  |  正體中文  |  简体中文  |  Items with full text/Total items : 67783/67783 (100%)
Visitors : 23063723      Online Users : 723
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU 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://ir.lib.ncu.edu.tw/handle/987654321/29160


    Title: A graphic-based approach to the computation of the number of stack filters
    Authors: Lee,WL;Fan,KC
    Contributors: 資訊工程研究所
    Date: 1998
    Issue Date: 2010-06-29 20:15:09 (UTC+8)
    Publisher: 中央大學
    Abstract: In this paper, we present a novel method to compute the number of all stack filters. In our approach, the Boolean function is represented by Hasse diagram. Owing to the decomposition property of Hasse diagram, the n-variable positive Boolean function can be synthesized by positive Boolean functions with variable size fewer than n - 2 which leads to the reduction of memory requirement. Besides, the positive Boolean functions of ii variables can be partitioned into 2(n) + 1 parts according to the cardinality of all the truth input vectors instead of the minimals of truth input vectors. This partition method reveals the symmetrical distribution behavior of positive Boolean functions, which results in the saving of the total computation effort nearly by half (C) 1998 Published by Elsevier Science B.V. All rights reserved.
    Relation: SIGNAL PROCESSING
    Appears in Collections:[資訊工程研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML340View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明