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 show n 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 evalu ating the Boolean function at thresholds corresponding to the sample v alues within the filter window, and by taking advantage of the orderin g information associated with the threshold sequences.