Ok where to start. First you guys are a godsend. Who knew circuits would be harder than programming?
I read your tutorial and am still having trouble with Boolean simplification.
What I am going to do is write out my attempts at simplification of several problems and ask for any input on A. whether I got the correct answer and if not where I went wrong. and B. if there is a simpler logic. Two of these are homework problems the rest are just problems I am using to increase my knowledge of proper boolean process
Problem number one:
A'B + AB + A'B'
READ AS WITH MY Logic A not and B OR A and B OR A not and B not
((A + B') (A' + B') ( A + B))' Here I applied involution
(A + B')' After (A' + B') cancels (A + B)
A' + B my final answer
Problem number two:
AB + A'B + AB'
((A+B)' (A'+B)' (A+B')')' involution
((A'+B') (A+B') (A'+B))'
(A'+B')' after cancelation
A + B My final answer
In the above two problems I tried to adopt my logic from an internet example that used a k map.... but now my second inverse seems wrong according to my professor's lecture notes
Ok the tough ones:
Problem number three:
(A + B) (A' + C) (B' + C')
( (AB)' +(A'C)' +(B'C')' )'
( A'B' + AC' + BC )'
This is the point that I get stuck! every attempt to simplify further leads to everything cancelling out everything else!
my final answer is...
AB + A'C + B'C'
If the consensus theorem applies - (A + B)(A' + C)(B + C) = (A + B)(A' + C) - or - A B + A'C + BC = AB +A'C - how would I apply it? it seems to me in my example all the variables cancel each other out ie. A to A', C to C' , B to B'
Problem number four:
A'B + AB'
( (A + B') (A' + B) )'
( AA' + AB + B'A' + B'B)'
( 0 + AB + B'A' + 0 )'
( AB + A'B' )'
(A' + B') ( A + B) my final answer
Problem number five:
(a+b) + c
c + (a + b)'
which could be ....
c + a' + b'
or
( (c)' (a'b')')'
(c'ab)'
c+a'+b' My final answer.
Ok, I realize I probably got most of these problems wrong so any help would be much appreciated. I did read the tutorial and will look at it again. My problem is the examples seem to make sense but my application is off.
I read your tutorial and am still having trouble with Boolean simplification.
What I am going to do is write out my attempts at simplification of several problems and ask for any input on A. whether I got the correct answer and if not where I went wrong. and B. if there is a simpler logic. Two of these are homework problems the rest are just problems I am using to increase my knowledge of proper boolean process
Problem number one:
A'B + AB + A'B'
READ AS WITH MY Logic A not and B OR A and B OR A not and B not
((A + B') (A' + B') ( A + B))' Here I applied involution
(A + B')' After (A' + B') cancels (A + B)
A' + B my final answer
Problem number two:
AB + A'B + AB'
((A+B)' (A'+B)' (A+B')')' involution
((A'+B') (A+B') (A'+B))'
(A'+B')' after cancelation
A + B My final answer
In the above two problems I tried to adopt my logic from an internet example that used a k map.... but now my second inverse seems wrong according to my professor's lecture notes
Ok the tough ones:
Problem number three:
(A + B) (A' + C) (B' + C')
( (AB)' +(A'C)' +(B'C')' )'
( A'B' + AC' + BC )'
This is the point that I get stuck! every attempt to simplify further leads to everything cancelling out everything else!
my final answer is...
AB + A'C + B'C'
If the consensus theorem applies - (A + B)(A' + C)(B + C) = (A + B)(A' + C) - or - A B + A'C + BC = AB +A'C - how would I apply it? it seems to me in my example all the variables cancel each other out ie. A to A', C to C' , B to B'
Problem number four:
A'B + AB'
( (A + B') (A' + B) )'
( AA' + AB + B'A' + B'B)'
( 0 + AB + B'A' + 0 )'
( AB + A'B' )'
(A' + B') ( A + B) my final answer
Problem number five:
(a+b) + c
c + (a + b)'
which could be ....
c + a' + b'
or
( (c)' (a'b')')'
(c'ab)'
c+a'+b' My final answer.
Ok, I realize I probably got most of these problems wrong so any help would be much appreciated. I did read the tutorial and will look at it again. My problem is the examples seem to make sense but my application is off.