1
$\begingroup$

Hi i have derived the following SoP (Sum of Products) expression , by analyzing the truth table of a 3 bit , binary to gray code converter. I ask for verification, because i feel as though this answer may not be correct or complete.

X = a'bc' + a'bc + ab'c' + ab'c

which, using k-maps, was simplified to

X = ab' + a'b

Is this correct ?

$\endgroup$
2
$\begingroup$

You can verify that the two expressions are equivalent by using some logical equivalences. Below I'm using 1 to represent true. $$\begin{align} a'bc'+a'bc + ab'c'+ab'c &= (a'bc'+a'bc) + (ab'c'+ab'c) &\text{associativity of } +\\ &= a'b(c'+c) + ab'(c'+c) &\text{distributivity, twice}\\ &= a'b(1) + ab'(1) &\text{inverse for }+\\ &= a'b + ab' &\text{identity for }\cdot \end{align}$$

$\endgroup$
1
$\begingroup$

K-map Simplification leads to the expression which you have arrived at . For checking the same you can create a truth table for your simplified expression and match the outputs with those of the initial expression. Or you could also use set operations on the given expression and reduce it .

The final expression also is a XOR B if it helps .

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.