From the logic gate diagram given below, derive the Boolean expression for (1), (2) and S. Reduce…
From the logic gate diagram given below, derive the Boolean expression for (1), (2) and S. Reduce the derived expression.
Answer
Answer
Checked answer.
(1) $= A \oplus B = A' \cdot B + A \cdot B'$
(2) $= (A' \cdot B + A \cdot B') \cdot C$
$S = A' \cdot B \cdot C + A \cdot B' \cdot C + A \cdot B = A \cdot B + B \cdot C + C \cdot A$ (the carry of a full adder)
The first gate is an XOR gate with inputs A and B: (1) $= A \oplus B = A' \cdot B + A \cdot B'$
The second gate is an AND gate with inputs (1) and C: (2) $= (A' \cdot B + A \cdot B') \cdot C = A' \cdot B \cdot C + A \cdot B' \cdot C$
The bottom AND gate has inputs A and B: $A \cdot B$
The OR gate gives $S = A' \cdot B \cdot C + A \cdot B' \cdot C + A \cdot B$
$A \cdot B = A \cdot B \cdot (C + C') = A \cdot B \cdot C + A \cdot B \cdot C'$, and a term may be repeated (Idempotent law), so $S = (A' \cdot B \cdot C + A \cdot B \cdot C) + (A \cdot B' \cdot C + A \cdot B \cdot C) + A \cdot B$
$= B \cdot C \cdot (A' + A) + A \cdot C \cdot (B' + B) + A \cdot B = B \cdot C + A \cdot C + A \cdot B$ (Complement law)