A graphic-based approach to the computation of the number of stack filters

NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Computer Science and Information Engineering > journal & Dissertation > Item 987654321/29160

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:	[Graduate Institute of Computer Science and Information Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	458	View/Open

社群 sharing