Digital Filters Based On Threshold Decomposition And Boolean Functions

Abstract
In this paper we discuss certain limitations which are inherent in filters that are based on threshold decomposition and Boolean functions. We also define a generalization of stack filters by dropping the requirement of positivity in the defining Boolean function. We show that while some of the nice properties of stack filters are lost the extra design freedom makes it possible to construct filters which have certain attractive properties that are not attainable with stack filters.

This publication has 0 references indexed in Scilit: