Parallel implementation of binary comparison circuits

Abstract
A technique is proposed for implementing parallel tree-like comparator circuits with fan-in constrained gates, exhibiting logarithmic comparison time growth. The technique is based on formulating the binary comparator logic to resemble the carry look ahead logic of the binary adder. The implementation is extended to modular tree comparator networks.

This publication has 0 references indexed in Scilit: