Question

This same approach can be used to do other useful comparisons; here are some common outputs of binary comparators: ANEB C1 if A is not equal to B) .ALEBCIl' if A is less than or equal to B) . ALTB (" I , if A is less than B) . AGEB (. 1, ifA is greater than or equal to B) AGTB (T if A is greater than B When processing the bits in a column, you know that A is less than B if A and B are "equal so far", the bit from A is a 0, and the bit from B is a 1. Once you have determined that A is less than B, nothing about the bits in lower significant positions changes that. (Processing from msb to lsb is crucial to getting the right answer in this case.) To build a binary comparator with an ALTB output, modify the building block to have inputs X, Y, EQin, and LTin (less than so far), and produce outputs EQout and LTout Fill out the EQ and LT values for the following four-bit comparator example to demonstrate the equality-and-less-than comparator process. (Start) 8s place 4s place 2s place Is place A[n B[n) EQ[n] (equal so far?) yes LTIn) less than so far?) noO 。 Next, figure out the function for the LTout of the building block circuit, fill in its K- map, and use the K-map to find a minimal expression for the function. しTout = f(X, Y, EQin, LTin) X.Y EQin LTin 00 01 11 10 01 10

Answer 1

Ty ST 11 10 -maf out Lt (5) 叽(LTİ LTi