Boolean algebra
Boolean algebra
lets talk about most famous Boolean mathematics..........
Last edited by Neo on Wed Mar 17, 2010 8:29 pm, edited 1 time in total.
Reason: Boolean algebra
Reason: Boolean algebra
Re: Boolean algebra
The most obvious way to simplify Boolean expressions is to manipulate them in the same way as normal algebraic expressions are manipulated. With regards to logic relations in digital forms, a set of rules for symbolic manipulation is needed in order to solve for the unknowns.
A set of rules formulated by the English mathematician George Boole describe certain propositions whose outcome would be either true or false. With regard to digital logic, these rules are used to describe circuits whose state can be either, 1 (true) or 0 (false). In order to fully understand this, the relation between the AND gate, OR gate and NOT gate operations should be appreciated. A number of rules can be derived from these relations as Table 1 demonstrates.
Prove T10: (a) A + A'B = A + B
A set of rules formulated by the English mathematician George Boole describe certain propositions whose outcome would be either true or false. With regard to digital logic, these rules are used to describe circuits whose state can be either, 1 (true) or 0 (false). In order to fully understand this, the relation between the AND gate, OR gate and NOT gate operations should be appreciated. A number of rules can be derived from these relations as Table 1 demonstrates.
- P1: X = 0 or X = 1
- P2: 0 . 0 = 0
- P3: 1 + 1 = 1
- P4: 0 + 0 = 0
- P5: 1 . 1 = 1
- P6: 1 . 0 = 0 . 1 = 0
- P7: 1 + 0 = 0 + 1 = 1
- T1 : Commutative Law
- A + B = B + A
- A B = B A
- T2 : Associate Law
- (A + B) + C = A + (B + C)
- (A B) C = A (B C)
- T3 : Distributive Law
- A (B + C) = A B + A C
- A + (B C) = (A + B) (A + C)
- T4 : Identity Law
- A + A = A
- A A = A
- T5 :
- AB + AB' = A
- (A+B)(A+B') = A
- T6 : Redundance Law
- A + A B = A
- A (A + B) = A
- T7 :
- 0 + A = A
- 0 A = 0
- T8 :
- 1 + A = 1
- 1 A = A
- T9 :
- A' + A = 1
- A'A = 0
- T10 :
- A + A'B = A + B
- A (A' + B) = AB
- T11 : De Morgan's Theorem
- (A+B)' = A'B'
- (AB)' = A' + B'
Prove T10: (a) A + A'B = A + B
- Algebraically
Code: Select all
A + A'B = A1 + A'B from T7(a) = A (1 + B) + A'B from T8(a) = A + AB + A'B from T3(a) = A + B (A + A') from T3(a) = A + B from T8
- Using the truth table
Re: Boolean algebra
thanks BRO....NEO.
Now I'm studding on this topic...I ask you before I study that.your post help me lot to get basic idea.
Thank you!
Now I'm studding on this topic...I ask you before I study that.your post help me lot to get basic idea.
Thank you!