Title :
Systolic computation of the running min and max
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Northwestern Univ., Evanston, IL, USA
Abstract :
A method of computing the running min and max, requiring non 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.<>
Keywords :
computational complexity; filtering and prediction theory; parallel algorithms; pipeline processing; systolic arrays; max functions; min functions; rank order functions; running max; running min; time period complexity; word level pipelining;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19931031
