Parallel-Search Max/Min Word Algorithm
Original Publication Date: 1979-Dec-01
Included in the Prior Art Database: 2005-Feb-20
There is often a need, as in a digital dynamic thresholder, for example, to quickly determine the maximum or minimum word or picture element (pel) value among a large number of words. In a common process using a two-word comparator, the number of steps and the processing time are proportional to the number of words (or pels). The algorithm described here is inherently faster, with the processing time being independent of the number of words to be searched.