Challenge Sheet $2$

Logic Circuits and Boolean Algebra

$$

$1.$ Design a Comparator circuit that compares the binary values of two $2-$bit integers A$($a$1,$a$0)$ and B$($b$1,$b$0)$ and generates a signal on one of its outputs, indicating whether A$>$B$,$ AB $=1,$ or if A$=(1,0)$ and B$=(1,1)$ then output wire AB and AB and A$=$B$.$

$$

f$.$ Using the equations:

XY $+$ XY$=$ X$($Y$+$Y$)=$ X$\mathrm{.}1=$ X

XYZ $+$ XYZ$+$ XY$$Z $+$ XY$$Z$=$ X$($YZ $+$ YZ$+$ Y$$Z $+$ Y$$Z$)=$ X$\mathrm{.}1=$ X

$$ Can the equations for AB be simplified $?$ If so$,$ what are these$$

$$ equations and what are

$$

$2.$ The following circuit :

$$

has the Boolean equation:

$$

$($A $+$ B$+$ C$)+[($C $+$ B$).($AB$)]+0$

$=($A $+$ B$+$ C$)+[($C $+$ B$).($AB$)]$

$$

a$.$ Use De$$ Morgan$$s Theorem to expand and simplify it as far as possible. $($You can repeatedly apply De Morgan$$s law.

$$

b$.$ What is the equivalent gate circuit of the equation that you have produced in $2.$a $?$

$$