Lecture 001 : Boolean Algebra
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.
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.
- X = 0 or X = 1
- 0 . 0 = 0
- 1 + 1 = 1
- 0 + 0 = 0
- 1 . 1 = 1
- 1 . 0 = 0 . 1 = 0
- 1 + 0 = 0 + 1 = 1
The basic operations of Boolean algebra are the following ones:
- Not (negation), denoted A' (sometimes NOT A, or A NOT or !A), satisfies A' = 0 if A = 1 ; and A' = 1 if A = 0.
- And (conjunction), denoted A.B (sometimes A AND B), satisfies A.B = 1 if A = 1; B = 1.
- Or (disjunction), denoted A+B (sometimes A OR B ), satisfies A+B = 0 if A = 0; B = 0.
Good post.:)
ReplyDelete