Bit-serial window partitioning algorithm for stack filtering

The authors introduce a new bit-serial algorithm for stack filtering, designated as the bit-serial window partitioning algorithm. It is shown that the proposed algorithm can achieve very important savings over the conventional bit-serial binary-tree search algorithm, in terms of the computational speed. This improved efficiency is obtained by evaluating the Boolean function at thresholds corresponding to the sample values within the filter window, and by taking advantage of the ordering information associated with the threshold sequences