Professional Documents
Culture Documents
DLD Lec 05
DLD Lec 05
What is an algebra?
Mathematical system consisting of
Set of elements
Set of operators
Axioms or postulates
Analgebra that deals with Binary Variables
and Logical Operations.
Father of Boolean algebra
Define algebra for binary values
Developed by George Boole in 1854
Three most basic operations of which are AND,
OR and NOT. It was these three functions that
formed the basis of his premise.
Variable
Complement
Literal
BooleanAddition performed by OR gate
Sum Term describes Boolean Addition
B A
A B
A.B A.B
B A
Associative Law for Addition
A + (B + C) = (A + B) + C
A A
A+(B+C)
A+B
B
B
(A+B)+C
B+C C
C
AssociativeLaw for Multiplication
A.(B.C) = (A.B).C
A A
A.(B.C)
A.B
B
B
(A.B).C
B.C C
C
Distributive Law for Multiplication over
Addition
A.(B + C) = A.B + A.C
A A
A.(B+C)
A.B
B
B
A A.B+A.C
B+C
C A.C
C
DistributiveLaw for Addition over
Multiplication
A + B.C = (A + B) . (A + C)
1. A+0=A 7. A.A = A
2. A+1=1 8. A. A = 0
3. A.0 = 0 9. A = A
4. A.1 = A 10. A + A.B = A
5. A+A=A 11. A + A.B = A + B
6. A+A =1 12. A. (A+B) = A
First Theorem
A.B A B
A A
A.B A B
B B
Second Theorem
A B A.B A
A B
A
A.B
B B
Any number of variables
X.Y.Z X Y Z
Combination of variables
X Y Z X.Y.Z
AB+A(B+C)+B(B+C)
B
C
B B+AC
A
C
Boolean Algebra provides concise way to
represent operation of a logic circuit
Complete function of a logic circuit can be
determined by evaluating the Boolean
expression using different input combinations
A few Boolean Expressions:
F = A + B.C
F = (A.B) + (C.D)
F = A.(B+C) + (D+A).B
F = (A+B) . (C+D)A
Procedural steps:
Identify the number of inputs
Identify all possible combinations of inputs
Draw Truth Table for the expression
Implement the circuit using Gates
A
AB
B
AB C
C C
( AB C)D
D
( A B)( A B C)
( A B C)(C D E)(B C D)
( A B)( A B C)( A C)
A
D
B+AC+AD
B
A
C
A
B (A+B)(B+C+D)(A+C)
B
C
AD
C
AB B(CD EF) AB BCD BEF
( A B)(B C D) AB AC AD B BC BD
AC AD B
( A B) C ( A B)C ( A B)C A C BC