-
Oct 15th, 2005, 09:48 AM
#1
Thread Starter
Junior Member
Boolean algebra
hi, i was going through boolean algebra and i could not figure it out. let me know if you have any idea.
F= A(B+C')' + (B+D)A'
-
Oct 16th, 2005, 08:23 AM
#2
Re: Boolean algebra
Well presumeably ' means NOT.
Thus:
F = (A * NOT(B + NOT C)) + ((B + D) * NOT A)
So...
Code:
; left of second "+"
mov eax, C
not eax
add eax, B
not eax
mul A
mov ecx, eax ; save result
; right
mov eax, B
add eax, D
mov edx, A
not edx
mul edx
add eax, ecx
; EAX == F (the answer)
I could be wrong of course.
I don't live here any more.
-
Oct 18th, 2005, 10:16 AM
#3
Thread Starter
Junior Member
Re: Boolean algebra
I mean to say how do you solve this function using boolean algebra?
F= A(B+C')' + (B+D)A'
-
Oct 18th, 2005, 10:41 AM
#4
Re: Boolean algebra
This is not the math forum.
I don't live here any more.
-
Feb 15th, 2006, 11:02 AM
#5
New Member
Re: Boolean algebra
F = A(B+C')' + (B+D)A'
F = A.B + A.C' + A'.B + A'.D
F = B(A+A') + A.C' + A'.D
F = B + A.C' + A'.D [Because A+A'=1]
Last edited by AZZiDO; Feb 15th, 2006 at 11:08 AM.
-
Mar 7th, 2006, 10:52 AM
#6
Frenzied Member
Re: Boolean algebra
Do you mean "How do you simplify the expression" from it's minterms? If so, then google for Karnaugh maps. I don't think we have a thread on discrete design . .. . .. .yet.
(BTW Wossy: Karnaugh maps can be very useful for optimising long sequences of boolean maths in any language)
"As far as the laws of mathematics refer to reality, they are not certain; and as far as they are certain, they do not refer to reality." - Albert Einstein
It's turtles! And it's all the way down
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|