Browsing Computer Science by Subject "Computational complexity"
Now showing items 1-1 of 1
-
A fast circuit topology for finding the maximum of n k-bit numbers
(IEEE, 2013)Finding the value and/or address (position) of the maximum element of a set of binary numbers is a fundamental arithmetic operation. Numerous systems, which are used in different application areas, require fast (low-latency) ...
Share this page