ADH
- Member since:
- July 16, 2006
- Total points:
- 57 (Level 1)
Can someone give me a simple explanation of how to simplify logic functions please?
For example F = A + A(Inverted).B
by Peter H
- Member since:
- June 14, 2008
- Total points:
- 30067 (Level 7)
- Badge Image:
-
- Contributing In:
- Medicine
Best Answer - Chosen by Voters
Check it with a truth table.
If F = A + A'.B
then F = (A'.B')'
-
by meb1337e...
- Member since:
- January 24, 2006
- Total points:
- 1961 (Level 3)
This one for example cannot be simplified.
There's a few rules you can apply to help you, but it takes guesswork and intuition.
Notation:
A, B is a bit
A', B' are those bits inverted
+ is OR
. is AND
1 is TRUE, 0 is FALSE
(A + A') = 1
(A . A') = 0
(A + AB) = A (because if AB is true, A must be true.)
(A . AB) = AB (because A is implicitly required in AB)
(AB + A'B) = B (because A can be true or false)
(A+B)' = (A' . B') (DeMorgan's Law)
(A . B) = (A' + B') (DeMorgan's Law)
-
by John S
- Member since:
- March 28, 2008
- Total points:
- 65 (Level 1)
there is a lot of information online. A lot of universities publish their notes and you can download them. Check it out. It'll help you.