Boolean Algebra

Logic Circuits and
Boolean Algebra
Introduction
1854: Logical algebra was published
by George Boole known today as
Boolean Algebra
Its a convenient way and systematic
way of expressing and analyzing the
operation of logic circuits.
1938: Claude Shannon was the first

to apply Booles work to the analysis
and design of logic circuits.
Boolean Operations &

Expressions
Variable a symbol used to represent
a logical quantity.
Complement the inverse of a
variable and is indicated by a bar
over the variable.
Literal a variable or the
complement of a variable.
LOGIC GATES
In formal logic, a statement (proposition) is a
declarative sentence that is either true(1) or
false (0). It is easier to communicate with
computers using formal logic.
Boolean variable: Any literal symbol that
takes only two values either true (1) or false
(0) such as x,y,z used to represent an
element of B={0,1}.
They are used as basic units of formal logic.
Boolean Expression
Boolean expression: Let x1, x2,,xn be
Boolean variables. A Boolean expression
over B is defined recursively as follows:
0 and 1 are Boolean expressions
x1, x2,,xn are Boolean expressions
If is a Boolean expression, then is a
Boolean expression
If 1 and 2 are Boolean expressions, then
(1 2) and (1 + 2) are Boolean
expressions.
Boolean function and logic

diagram
Boolean function: Mapping from Boolean
variables to a Boolean value.
Truth table:
Represents relationship between a
Boolean function and its binary variables.
It enumerates all possible combinations
of arguments and the corresponding
function values.
Boolean function and logic

diagram
Boolean algebra: Deals with binary
variables and logic operations
operating on those variables.
Logic diagram: Composed of
graphic symbols for logic gates. A
simple circuit sketch that represents
inputs and outputs of Boolean
functions.
Gates
It refers to the hardware to implement Boolean
operators.
A gate is a logic circuit with one or more input
signals but only one output signal.
The most basic gates are
Boolean function and truth

table
Boolean Addition
Boolean addition is equivalent to the OR
operation0+0=0 0+1=1 1+0=1 1+1=1
A sum term is produced by an OR operation with

no AND ops involved.
i.e. A B, A B , A B C , A B C D
A sum term is equal to 1 when one or more of the
literals in the term are 1.
A sum term is equal to 0 only if each of the literals is
0.
Boolean Multiplication
Boolean multiplication is equivalent to the
AND operation
00=0 01=0
10=0
11=1
A product term is produced by an AND

operation with no OR ops involved.
i.e. AB, AB , ABC , A BCD

A product term is equal to 1 only if each of the
literals in the term is 1.
A product term is equal to 0 when one or more
of the literals are 0.
Laws & Rules of Boolean

Algebra
The basic laws of Boolean algebra:
The commutative laws
The associative laws
The distributive laws
Commutative Laws
The commutative law of addition for
two variables is written as: A+B =
B+A A
B
B
A+B
B+A
The commutative law of

A
B
multiplication
for
two
variables
is
AB
B+A
B
A
written as: AB = BA
Associative Laws
The associative law of addition for 3
variables is written as: A+(B+C) =
(A+B)+C
A+B
A
A
B
C
A+(B+C)
B+C
B
C
(A+B)+C
The associative law of multiplication

ABas: A(BC) =
forA 3 variablesA(BC)
is written
A
B
B
(AB)C
(AB)C
C
C
BC
Distributive Laws
The distributive law is written for 3
variables as follows: A(B+C) = AB + AC
B+C
A
C
X=A(B+C)
AB
AC
X=AB+AC
Rules of Boolean Algebra

1. A 0 A
2. A 1 1
3. A 0 0
4. A 1 A
5. A A A
6. A A 1
7. A A A
8. A A 0
9. A A
10. A AB A
11. A A B A B
12.( A B)( A C ) A BC
___________________________________________________________
A, B, and C can represent a single variable or a combination of vari
Function Minimization using Boolean

Algebra
Examples:
(a) a + ab
(b) a(a + b)
(c) a(a' + b)
(d) abc + abc + abc + abc + abc
(e) (a+b+c)(a+b+c)(a+b+c)
The other type of question

Show that:
1. ab + ab' = a
2. (a + b)(a + b') = a
More Examples
Show that;
(a) ab + ab'c = ab + ac
(b) (a + b)(a + b' + c) = a + bc
DeMorgans Theorems
DeMorgans theorems provide
mathematical verification of:
the equivalency of the NAND and
negative-OR gates
the equivalency of the NOR and
negative-AND gates.
DeMorgans Theorems
The complement of two
or more ANDed
variables is equivalent
to the OR of the
complements of the
individual variables.
The complement of two

or more ORed variables
is equivalent to the AND
of the complements of
the individual variables.
NAND
Negative-OR
X Y X Y
NOR
Negative-AND
X Y X Y
DeMorgans Theorems
(Exercises)
Apply DeMorgans theorems to the
expressions:
X Y Z
X Y Z
X Y Z
W X Y Z
DeMorgans Theorems
(Exercises)
Apply DeMorgans theorems to the
expressions:
( A B C)D
ABC DEF
AB C D EF
A BC D ( E F )
Boolean Analysis of Logic

Circuits
Boolean algebra provides a concise
way to express the operation of a
logic circuit formed by a combination
of logic gates
so that the output can be determined for
various combinations of input values.
Boolean Expression for a Logic

Circuit
To derive the Boolean expression for
a given logic circuit, begin at the leftmost inputs and work toward the
final output, writing the expression
for each
gate.
CD
C
D
B+CD
B
A(B+CD)
Constructing a Truth Table for a

Logic Circuit
Once the Boolean expression for a given
logic circuit has been determined, a truth
table that shows the output for all
possible values of the input variables
can be developed.
Lets take the previous circuit as the
example:
A(B+CD)
There are four variables, hence 16 (24)
combinations of values are possible.

Logic Circuit
Evaluating the expression
To evaluate the expression A(B+CD),
first find the values of the variables that
make the expression equal to 1 (using
the rules for Boolean add & mult).
In this case, the expression equals 1
only if A=1 and B+CD=1 because
A(B+CD) = 11 = 1

Logic Circuit
Evaluating the expression (cont)
Now, determine when B+CD term equals 1.
The term B+CD=1 if either B=1 or CD=1
or if both B and CD equal 1 because
B+CD = 1+0 = 1
B+CD = 0+1 = 1
B+CD = 1+1 = 1
The term CD=1 only if C=1 and D=1

Logic Circuit
Evaluating the expression (cont)
Summary:
A(B+CD)=1
When A=1 and B=1 regardless of the values of C
and D
When A=1 and C=1 and D=1 regardless of the value
of B
The expression A(B+CD)=0 for all other value

combinations of the variables.

Logic Circuit
Putting the results
in truth table
format
A(B+CD)=1
When A=1
and B=1
regardless
of the
When
valuesA=1
of Cand
C=1
and D=1
and D
regardless of the
value of B
INPUTS
OUTPUT
OUTPUT
AA
CC
DD
A(B+CD)
A(B+CD)
00
00
00
00
11
00
00
11
11
00
00
00
00
00
11
00
11
11
11
00
00
11
00
11
11
11
00
11
00
00
11
11
00
11
11
11
11
00
11
11
11
11
11

Boolean Algebra

Uploaded by

Copyright:

Available Formats

Boolean Algebra

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Boolean Algebra

Uploaded by

Copyright:

Available Formats

Logic Circuits and

1938: Claude Shannon was the first

Boolean Operations &

Boolean function and logic

Boolean function and logic

Boolean function and truth

A sum term is produced by an OR operation with

A product term is produced by an AND

i.e. AB, AB , ABC , A BCD

Laws & Rules of Boolean

The commutative law of

The associative law of multiplication

Rules of Boolean Algebra

Function Minimization using Boolean

The other type of question

The complement of two

Boolean Analysis of Logic

Boolean Expression for a Logic

Constructing a Truth Table for a

Constructing a Truth Table for a

Constructing a Truth Table for a

The term CD=1 only if C=1 and D=1

Constructing a Truth Table for a

The expression A(B+CD)=0 for all other value

Constructing a Truth Table for a

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.