Scribd
Upload
11 views29 pages

Bools 1

Boolean algebra, named after George Boole and adapted by Claude Shannon, is an algebra of logic consisting of two values (true/false) and operators (NOT, AND, OR). It includes Boolean expressions and functions, which can be represented in Sum of Products (SOP) or Product of Sums (POS) forms, and is foundational for designing digital circuits using basic logic gates. The document also covers operator precedence, truth tables, and exercises for evaluating Boolean functions and constructing circuits.

Uploaded by

Hacchi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views29 pages

Bools 1

Boolean algebra, named after George Boole and adapted by Claude Shannon, is an algebra of logic consisting of two values (true/false) and operators (NOT, AND, OR). It includes Boolean expressions and functions, which can be represented in Sum of Products (SOP) or Product of Sums (POS) forms, and is foundational for designing digital circuits using basic logic gates. The document also covers operator precedence, truth tables, and exercises for evaluating Boolean functions and constructing circuits.

Uploaded by

Hacchi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 29

Boolean Algebra

Outline Claude Shannon


(1916 - 2001)

Boolean Algebra Representation of


Defined Boolean Expressions
and Functions

Boolean Operators Basic Logic Gates


Boolean Algebra Defined

What is Boolean
algebra?

 Itwas named after


George Boole
(1815 – 1864) and
was adapted in
1938 by Claude
Shannon
 What is Boolean Algebra?
 It is described as an algebra of logic
or an algebra of two values
 It is a form of algebra that consists
of:
 set of elements: A = {true, false} Boolean
or A = {on, off}, {1, 0}, {high, low}
Algebra
 setof operators: O = {NOT {'},
AND {•}, OR {+}} Defined
 … following some theorems,
postulates and axioms that hold for
binary logic
Boolean Algebra Defined
Boolean expression
 An algebraic statement of Boolean variables
or literals and operators
A+ B
A• B (AB) (dot operator is implicit)
A’ or A
Boolean function
 Maps inputs from the set {0,1} to the set
{0,1}
A function from B to Bn is called a Boolean
function of degree n
F(A,B) = AB + (A’B + B’)
F(W, X, Y, Z) = X(Y + W ′ Z)
Boolean Algebra Defined

 Operator precedence: to avoid ambiguity in


expressions
 Expressions within parentheses should be
evaluated first
 The NOT (') operator should be evaluated second
 The AND (·) operator should be evaluated third
 The OR (+) operator should be evaluated last
Basic forms in which a Boolean
algebraic expression can be written
 1. Sum of Product( SOP) form
 2. Product of Sum (POS form)

Representation of Boolean
Expression and Function
 Sum of Products (SOP) form
It is an expression that results from two or
more product terms, which are summed by
Boolean addition
Example: AB + BC
F(A,B) = AB’ + A’B’

Representation of Boolean
Expression and Function
 Product of Sums (POS) form
It is an expression that results from two or
more sum terms, which are multiplied by
Boolean multiplication.
Example: (A+B)(A+C)
F(A,B,C) = (A+C’) (A’+B’+ C)

Representation of Boolean
Expression and Function
Exercises: Inspect each of these Boolean expressions,
and determine whether each one is a sum of
products, or a product of sums:
 (B+C’+D)(A’+B)
 AB’C’+A’BC

 (X+Y’+Z’)(Y’+Z)(X’+Y)

 M’N’O’+MNO’+MN’O

Representation of Boolean
Expression and Function
 Truth table is a table that contains all possible values
of logical variables/statements in a Boolean
expression.
 List all possible combinations of 0's and 1's assigned to
variables
No. of possible combination = 2n
where n=number of variables used in a Boolean
expression.

Truth Table
Boolean Operators

 Truth
table for the Boolean NOT
operator

A A’
0 1
1 0
Boolean Operators

 Truth
table for the Boolean AND
operator

A B A⋅B = AB
0 0 0
0 1 0
1 0 0
1 1 1
Boolean Operators

 Truth
table for the Boolean OR
operator

A B A+ B
0 0 0
0 1 1
1 0 1
1 1 1
Boolean Operators
 The truth table for AB + C is as follows:

A B C AB AB + C
0 0 0 0 0
0 0 1 0 1
0 1 0 0 0
0 1 1 0 1
1 0 0 0 0
1 0 1 0 1
1 1 0 1 1
1 1 1 1 1
Boolean
Operators X Y Z Y' XY' X' X’Z
F = XY’+
X’Z
0 0 0 1 0 1 0 0

0 0 1 1 0 1 1 1
 Truth table for
0 1 0 0 0 1 0 0
F = XY’ + X’Z
0 1 1 0 0 1 1 1

1 0 0 1 1 0 0 1

1 0 1 1 1 0 0 1

1 1 0 0 0 0 0 0

1 1 1 0 0 0 0 0
Exercise

1. Given A = 0, B = 0, C = 1, D = 1, evaluate the


following boolean functions.
(a) F = A’C’ + (B’ + C’) + AB + D’(BC’ + A’B’)
(b) F = B’C’ + A(BD + C’D’) + D’(C + D)

2. Derive the truth table of the following Boolean


expressions:
(a) X’Y’+ X’Y
(b) F = (X’+Y +Z’) + XY’
(c) F = XY’ (Z+YZ’)+ Z’
 A computer, or electronic devices, is
made up of numerous circuits

Basic  Each circuit can be designed using the


rules of Boolean algebra
Logic
Gates  The basic element of circuits are called
gates

 Each type of gates implements a


Boolean Operation
 All circuits covered in this
chapter provides output that
depends only on the input, and
not on the current state of the
circuit

Basic Logic  These circuits that have no


Gates memory capabilities are called
combinational circuits or gating
networks

 Combinatorial circuits are built


using the different logic gates
like NOT gate or Inverter, AND
gate, OR gate, etc.
22
Basic Logic Gates

Role of each type of elements:


NOT gate or Inverter: it accepts the
value of one Boolean variable as input
and produces the complement of this
value as its output.

X'
X
Basic Logic Gates

 Switching circuit analogy of NOT function


Basic Logic
Gates
X
AND gate: The inputs to XY
this gate are the values of Y
two or more Boolean
variables.

The output is the Boolean


product of their values.

Output is always 0 if one


of the inputs is 0.
Basic Logic Gates

 Switching circuit analogy of AND function


Basic Logic
Gates
X

Y
X+Y OR Gate: it accepts
as input values of 2
or more Boolean
variables.
The output is the
Boolean sum of their
values
The output is always
1 if one of the inputs
is 1.
Basic Logic Gates

 Switching circuit analogy of OR function


Basic Logic Gates
 We can have multiple inputs to AND and OR:
X1
X2
… x1x2…xn
Xn

x1
x2 x1 + x2 + …+ xn
…
xn

Gates with n inputs

29
 Combinations of Gates

 Combinational circuits can be constructed


using a combination of inverters, OR gates,
and AND gates

 When combinations of circuits are formed,


some gates may share input using branching

Basic Logic Gates


X
XY
Y
XY + X’Y

X’
X
Y X’Y

X XY

Y
XY + X’Y

X’

X’Y

Two ways to draw the same circuit


 Exercise:
Construct circuits that produce the following outputs using 2-input
logic gates.

1. (X + Y) X’

2. X’ ( Y + Z’)’

3. (X + Y + Z) (X’Y’ + Z)

Basic Logic Gates


32

You might also like