New architecture for running threshold Boolean filtering

In this paper we use bit-serial 'local sorting' to perform the threshold Boolean filtering, based on running processing without ordering the input data. The proposed architecture is simple and suitable for realization. It is shown, that introduced homogeneous generalized threshold Boolean filters can be represented as a threshold Boolean filter on the appended input signal window, and can be computed in the same architectures. Also homogeneous generalized threshold Boolean filters are represented as linear combinations of homogeneous generalized stack filters.

[1]  Jaakko Astola,et al.  Digital Filters Based On Threshold Decomposition And Boolean Functions , 1989, Other Conferences.

[2]  K. Chen.  Bit-serial realizations of a class of nonlinear filters based on positive Boolean functions , 1989 .

[3]  David Akopian,et al.  A unified approach to implementation of stack filters , 1994, Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers.

[4]  Yong Hoon Lee,et al.  Threshold Boolean filters , 1994, IEEE Trans. Signal Process..

[5]  Saburo Muroga,et al.  Threshold logic and its applications , 1971 .

[6]  Edward J. Coyle,et al.  Minimum mean absolute error estimation over the class of generalized stack filters , 1990, IEEE Trans. Acoust. Speech Signal Process..

[7]  Edward J. Coyle,et al.  Stack filters and the mean absolute error criterion , 1988, IEEE Trans. Acoust. Speech Signal Process..

[8]  J. Astola,et al.  Binary polynomial transforms and nonlinear digital filters , 1995 .

[9]  K. D. Lee,et al.  Optimization of Threshold Boolean Filters , 1993, IEEE Winter Workshop on Nonlinear Digital Signal Processing.

[10]  O. Vainio,et al.  Processors for generalized stack filters , 1995, IEEE Trans. Signal Process..