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

NCU Institutional Repository > 資訊電機學院 > 資訊工程研究所 > 期刊論文 > Item 987654321/29160

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29160

题名:	A graphic-based approach to the computation of the number of stack filters
作者:	Lee,WL;Fan,KC
贡献者:	資訊工程研究所
日期:	1998
上传时间:	2010-06-29 20:15:09 (UTC+8)
出版者:	中央大學
摘要:	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.
關聯:	SIGNAL PROCESSING
显示于类别:	[資訊工程研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	458	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing