A time-recursive implementation of threshold Boolean filters

A time-recursive architecture for threshold Boolean filters (TBF) is presented. It is based on a certain kind of nearest neighbors calculation which is called “local sorting.” This procedure is implemented efficiently in a bit-serial manner. An extension of TBF´s, the homogeneous generalized TBF´s are defined, They are represented as a linear combination of several homogeneous generalized stack filter outputs and as a threshold Boolean filter on the appended input signal window. The proposed “local sorting” architecture applies to this class of TBF´s as well