Suppose we have 2 4-bit binary number represented as:
We use 1-bit comparator for it.
Comparison starts from MSB.
Compare A3 with B3 using above 1-bit comparator. If A=B give high output (logic 1) then only it compare other bits. If A=B is false (logic 0) then the final answer of comparison is same as the output of 1-bit comparator.
If previous A=B is logic 1 (true) then it compare using 1 bit comparator and again the same consequences.
Is it possible to design 4-bit comparator using gates with above logic? If, yes then how can it be?
As a find comparator in Google which is drawn using K-Map.