Loading simulator…
From the behavioral table, Equality Output = 1 only when both corresponding bit pairs are equal:
A0 = B0A1 = B1| A1 | A0 | B1 | B0 | Equality Output |
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 1 |
| 0 | 1 | 0 | 1 | 1 |
| 1 | 0 | 1 | 0 | 1 |
| 1 | 1 | 1 | 1 | 1 |
| Any other combination | 0 |
NOT, OR, NAND, NOR, and XNOR gates are prohibited. Only XOR and AND gates can be used.
Use XOR to compare each corresponding bit pair:
X = A0 ⊕ B0
Z = A1 ⊕ B1XOR gives 0 when both inputs are equal. So the required output must be 1 only when both X and Z are 0.
| X | Z | Y |
|---|---|---|
| 0 | 0 | 1 |
| 0 | 1 | 0 |
| 1 | 0 | 0 |
| 1 | 1 | 0 |
From the table, this is NOR behavior:
Y = (X + Z)'Using De Morgan's theorem:
Y = X' · Z'Since NOT gates are prohibited, invert X and Z using XOR with logic HIGH:
X' = X ⊕ 1
Z' = Z ⊕ 1Therefore:
Y = (X ⊕ 1) · (Z ⊕ 1)Substituting X and Z:
Equality Output = ((A0 ⊕ B0) ⊕ 1) · ((A1 ⊕ B1) ⊕ 1)Connect each corresponding bit pair to an XOR gate, invert both XOR outputs using XOR with logic HIGH, then AND the two results to generate Equality Output.