Logarithmic complexity implementation for integer comparator

A logarithmic complexity implementation for the integer comparator is presented. The relation between unsigned integers to be compared and their comparison result is analyzed, and then a logarithmic complexity algorithm is inferred, which takes the advantage of both speed and area. The algorithm is also extended for comparing two signed integers in two's complement. The complexities of the basic algorithm in terms of time and hardware are given. The experimental results of several concrete schemes are also discussed.