Abstract
A method of computing the running min and max, requiring no fan-in and hence compatible with systolic implementation, is proposed. The time period complexity for the computation of the running min and max, or for more general rank order functions expressible in terms of min and max functions, is O(b), where b is the word length.

This publication has 0 references indexed in Scilit: