Scribd
Upload
5 views28 pages

Chapter 2-Boolean Algebra

The document discusses Boolean algebra, highlighting its differences from ordinary algebra, such as the binary values (0 and 1) it uses and the logical significance of its operations. It covers concepts like equivalent expressions, complements, binary logic, truth tables, and logic gates, as well as the importance of simplifying Boolean expressions for efficient circuit design. Additionally, it introduces DeMorgan's Laws and various methods for algebraic simplification, including the use of Karnaugh Maps.

Uploaded by

kasango abel
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
5 views28 pages

Chapter 2-Boolean Algebra

The document discusses Boolean algebra, highlighting its differences from ordinary algebra, such as the binary values (0 and 1) it uses and the logical significance of its operations. It covers concepts like equivalent expressions, complements, binary logic, truth tables, and logic gates, as well as the importance of simplifying Boolean expressions for efficient circuit design. Additionally, it introduces DeMorgan's Laws and various methods for algebraic simplification, including the use of Karnaugh Maps.

Uploaded by

kasango abel
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/ 28

Boolean Algebra

Design of logic circuits; minimization,


Karnaugh maps
Boolean Vs Ordinary Algebra
 In ordinary algebra, the letter symbols can take on any
number of values including infinity. In Boolean algebra, they
can take on either of two values, that is, 0 and 1.
 The values assigned to a variable have a numerical
significance in ordinary algebra, whereas in its Boolean
counterpart they have a logical significance.
 While ‘.’ and ‘+’ are respectively the signs of multiplication
and addition in ordinary algebra, in Boolean algebra ‘.’ means
an AND operation and ‘+’ means an OR operation. For
instance, A+B in ordinary algebra is read as A plus B, while
the same in Boolean algebra is read as A OR B

Digital Logic Design Ch1-2


 Variables are the different symbols in a Boolean expression. They may take on
the value ‘0’ or ‘1’. For instance, in expression (1), A, B and C are the three
variables. In expression (2), P, Q, R and S are the variables :
  
A A.B  A. C  A .B.C..........1
  
( P Q).( R  S ).( P  Q R)..........2

In expressions (1) and (2) there are eight and seven literals respectively

Digital Logic Design Ch1-3


Two given Boolean expressions are said to be equivalent if one of them equals
‘1’ only when the other equals ‘1’ and also one equals ‘0’ only when the
other equals ‘0’.
They are said to be the complement of each other if one expression equals ‘1’
only when the other equals ‘0’, and vice versa.
The complement of a given Boolean expression is obtained by complementing
each literal, changing all ‘.’ to ‘+’ and all ‘+’ to ‘.’, all 0s to 1s and all 1s to
0s.
Examples
1) Has compliment=
2) Has complement=

When ORed with its complement the Boolean expression yields a


‘1’,and when ANDed with its complement it yields a ‘0’)

Digital Logic Design Ch1-4


 Definition of Binary Logic
◦ Binary logic consists of binary variables and a set of logical operations.
◦ The variables are designated by letters of the alphabet, such as A, B, C,
x, y, z, etc, with each variable having two and only two distinct possible
values: 1 and 0,
◦ Three basic logical operations: AND, OR, and NOT.

Digital Logic Design Ch1-5


 Truth Tables, Boolean Expressions, and Logic Gates

AND OR NOT
x y z x y z x z
0 0 0 0 0 0 0 1
0 1 0 0 1 1 1 0
1 0 0 1 0 1
1 1 1 1 1 1

z=x•y=xy z=x+y z = x = x’

x x x
y z y z z
Digital Logic Design Ch1-6
AND OR

Digital Logic Design Ch1-7


 Logic gates
◦ Example of binary signals

3
Logic 1
2
Un-define
1
Logic 0
0

Figure 1.3 Example of binary signals


Digital Logic Design Ch1-8
 Logic gates
◦ Graphic Symbols and Input-Output Signals for Logic
gates:

Fig. 1.4 Symbols for digital logic circuits

Fig. 1.5 Input-Output signals for gates


Digital Logic Design Ch1-9
 Logic gates
◦ Graphic Symbols and Input-Output Signals for Logic
gates:

Fig. 1.6 Gates with multiple inputs

Digital Logic Design Ch1-10


Digital Logic Design Ch1-11
Digital Logic Design Ch1-12
Digital Logic Design Ch1-13
Digital Logic Design Ch1-14
4.simplify x  ACD  ABCD
5.............q  RST ( R  S  T )
6.............w  ABC  ABC  A

Digital Logic Design Ch1-15


DeMorgan's Laws
 Can be stated as follows:
 The complement of the product (AND) is the sum
(OR) of the complements.
 (X.Y)' = X' + Y'
 The complement of the sum (OR) is the product
(AND) of the complements.
 (X + Y)' = X' . Y'
 Easily generalized to n variables.
 Can be proven using a Truth table

Digital Logic Design Ch1-16


Proving DeMorgan's Law

(X . Y)' = X' + Y'

Digital Logic Design Ch1-17


DeMorgan's Theorems

x1
x1 x1
x2 x2
x2

(a) x1 x2 = x1 + x2

x1
x1 x1
x2 x2
x2

(b) x1 + x2 = x1 x2

Digital Logic Design Ch1-18


Importance of Boolean Algebra

 Boolean Algebra is used to simplify Boolean expressions.


– Through application of the Laws and Theorems discussed
 Simpler expressions lead to simpler circuit realization, which,
generally, reduces cost, area requirements, and power
consumption.
 The objective of the digital circuit designer is to design and
realize optimal digital circuits.

Digital Logic Design Ch1-19


Algebraic Simplification

 Justification for simplifying Boolean expressions:


– Reduces the cost associated with realizing the expression
using logic gates.
– Reduces the area (i.e. silicon) required to fabricate the
switching function.
– Reduces the power consumption of the circuit.
 In general, there is no easy way to determine when a
Boolean expression has been simplified to a minimum
number of terms or minimum number of literals.
– No unique solution

Digital Logic Design Ch1-20


Algebraic Simplification
 Boolean (or Switching) expressions can be simplified
using the following methods:
1. Multiplying out the expression
2. Factoring the expression
3. Combining terms of the expression
4. Eliminating terms in the expression
5. Eliminating literals in the expression
6. Adding redundant terms to the expression
As we shall see, there are other tools that can be used to simplify Boolean Expressions.
Namely, Karnaugh Maps.

Digital Logic Design Ch1-21


Digital Logic Design Ch1-22
Digital Logic Design Ch1-23
Digital Logic Design Ch1-24
Digital Logic Design Ch1-25
Digital Logic Design Ch1-26
Digital Logic Design Ch1-27
Digital Logic Design Ch1-28

You might also like