DocumentCode
2826280
Title
Some representation properties of stack filters
Author
Yu, Pao Ta
Author_Institution
Inst. of Comput. Sci. & Inf. Eng., Nat. Chung Cheng Univ., Chiayi, Taiwan
fYear
1991
fDate
11-14 Jun 1991
Firstpage
208
Abstract
Stack filters are a class of nonlinear filters which are based on positive Boolean functions as the window operators. Representations of these window operators are given here via the structures of on-set and off-set of the positive Boolean functions which can be expressed as a Boolean expression containing no complements of the input variables. The minimal elements of on-set and the maximal elements of off-set of any positive Boolean function are shown to be equivalent to the simplest sum-of-product form and product-of-sum form of that positive Boolean function, respectively. A fast algorithm for finding the representation of stack filters is designed
Keywords
Boolean functions; filtering and prediction theory; fast algorithm; nonlinear filters; positive Boolean functions; representation properties; stack filters; window operators; Algorithm design and analysis; Boolean functions; Computer science; Filtering; Input variables; Nonlinear filters;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1991., IEEE International Sympoisum on
Print_ISBN
0-7803-0050-5
Type
conf
DOI
10.1109/ISCAS.1991.176310
Filename
176310
Link To Document