Hello everyone, im having an issue with the following question: convert the function F(AB) = AB' into 2nd canonical form using Boolean algebra.(where ' is NOT) I just want to understand each step because i am really confused! Thankyou!
sum of products
- Thread starter u-will-neva-no
- Start date
You have represented your function as a Sum of Products. All's fine with that.
By referring to the second canonical form I guess you mean Product of Sums. That can't always be done with simple boolean operations. Check this thread for more info:
http://forum.allaboutcircuits.com/showthread.php?t=52634
By referring to the second canonical form I guess you mean Product of Sums. That can't always be done with simple boolean operations. Check this thread for more info:
http://forum.allaboutcircuits.com/showthread.php?t=52634
On the other post, shouldnt the F column read:
1
1
1
1
0
0
1
1
I got that result just from reading, for example, ABC = 000 and A'B'C'=111 and that AC' = ABC' and AB'C'. Please let me know if im doing it wrong!
1
1
1
1
0
0
1
1
I got that result just from reading, for example, ABC = 000 and A'B'C'=111 and that AC' = ABC' and AB'C'. Please let me know if im doing it wrong!
Ignore, i should be reading ABC as 111 and A'B'C' as 000, sorry!
