Fast minimum and maximum selection
Anatoly I. Grushin · 2006
An algorithm of minimum and maximum selection, that allows to speed up this process is presented. New logic functions are introduced to describe the algorithm. Numbers are analyzed beginning with the most significant bits (MSBs). Particularly significant time reduction is achieved when bits of numbers come sequentially, beginning with the most significant ones, or one number comes earlier than the other, or it is necessary to select the minimum or maximum from several numbers (selection of the minimum from 8 4-bit numbers takes less time by 28% and area is 11% less in comparison with traditional methods).