Systems I: Computer

Organization and Architecture

Lecture 3 - Boolean Algebra

Digital Logic
• Digital logic hides the pitfalls of the analog
world by mapping all physical values as
sequences of 0s and 1s.
• Regardless of what type of digital circuit we
use, 0 and 1 are represented by two ranges
separated by an undefined range in between.
These two ranges are called low and high
respectively.
 Physical states representing 0 and 1
State Representing Bit
Technology 0 1

Pneumatic logic Fluid at low pressure Fluid at high pressure

Relay logic Circuit open Circuit closed

CMOS logic 0-1.5V 3.5-5.0 V

TTL logic 0-0.8V 2.0-5.0V

Fiber optics Light off Light on

Dynamic Memory Capacitor discharged Capacitor charged

Magnetic tape or disk Flux direction “north” Flux direction “south”

CD-ROM No pit Pit

Combinational Circuits
• A logic circuit whose output depends only
on its current inputs is called a
combinational circuit. Its operation is fully
described by a truth table that lists all
possible combinations of inputs and the
output values produced by each input set.
Combinational Circuit Truth Table – An Example

X Y Z F
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1

Logic Gates

Name Graphic Symbol Algebraic

Function
AND x = A°B
OR x = A+B
Inverter x = A’
Buffer x=A
NAND x = (AB)’
NOR x = (A+B)’
XOR x=A⊕ B
Exclusive NOR x = (A⊕ B)’
 Logic Gates and Their Truth Tables

A B AB A B A+B
0 0 0 0 0 0
0 1 0 0 1 1
1 0 0 1 0 1
1 1 1 1 1 1

Logic Gates and Their Truth Tables (continued)

A A’ A x=A
0 1 0 0
1 0 1 1
Logic Gates and Their Truth Tables (continued)

A B (AB)’ A B (A+B)’
0 0 1 0 0 1
0 1 1 0 1 0
1 0 1 1 0 0
1 1 0 1 1 0

Logic Gates and Their Truth Tables (continued)

A B A⊕B A B (A⊕B)’
0 0 0 0 0 1
0 1 1 0 1 0
1 0 1 1 0 0
1 1 0 1 1 1
 Functions and Their Respective Circuits

XY
X
Y XY + X’Y’Z
X’

Y’ X’Y’Z

Functions and Their Respective Circuits (continued)

x

F
z

F = x’y’z + x’yz + xy’

 Functions and Their Respective Circuits (continued)

y
F

F = xy’ + x’z

Types of Circuits
There are many ways to design an electronic
logic circuit. These are among the most
significant:
• TTL Logic
• MOS Logic
• CMOS Logic
 TTL Logic
• TTL (Transistor-transistor logic) is the most
successful family of bipolar logic circuit designs.
– Bipolar logic circuits have junctions where positively
“doped” semiconductors meet negatively “doped”
semiconductors.
• First introduced in the 1960s, TTL is now a family
of logic families that are compatible with each
other but differ in speed, power consumption and
cost.
• TTL was largely replaced by CMOS in the 1990s.

MOS Logic
• In MOS (Metal Oxide Semiconductor)
logic, increasing the voltage decreases the
effective resistance of the transistor.
• It was not until the 1960s that fabrication
methods were practical enough for
manufacturing.
• MOS was significantly slower than TTL but
used much less power.
 CMOS Logic
• CMOS (Complementary Metal Oxide
Semiconductor) Logic is an improved
variation on MOS logic and is commonly
used now in large-scale integrated circuits.
• CMOS logic is the most capable and the
easiest to understand commercial digital
logic technology.

Boolean Algebra
• Boolean algebra (named for British
mathematician George Boole) is the algebra
of logical values (true and false).
• Boolean algebra gives us postulates and
theorems that provides ways for us to
simplify logic expressions and therefore
come up with simpler circuits that perform
the same function as the ones with which
we started.
 Fundamental Concepts of Boolean Algebra

• Boolean algebra uses the + sign to indicate the logical OR

operation.
0+0=0 0+1=1
1+0=1 1+1=1
• Boolean algebra uses the • indicate the logical AND
operation.
0•0 =0 0•1 =0
1•0 =0 1•1 =1
• Complementation is taken as:
1’ = 0 0’ = 1

Boolean Algebra and Truth Tables

• Truth tables are used in the evaluation of logical functions:

X Y Z Z’ YZ’ X+YZ’
0 0 0 1 0 0
0 0 1 0 0 0
0 1 0 1 1 1
0 1 1 0 0 0
1 0 0 1 0 1
1 0 1 0 0 1
1 1 0 1 1 1
1 1 1 0 0 1
 Minterms and Maxterms

• A truth table must account for every combination of

independent logical variables.
– These combination are called minterms.
– If there are n independent variables, there will be 2n
minterms.
• Minterms are written as the product of independent
variations or their complements.
– We can also write them as the sum of the independent
variables or their complements. These are called
maxterms.
– For every minterm, there is a corresponding maxterm.

Minterms and Maxterms For 3 Variables

x y z Term Designation Term Designation

0 0 0 x’y’z’ m0 x+y+z M0
0 0 1 x’y’z m1 x+y+z’ M1
0 1 0 x’y z’ m2 x+y’+z M2
0 1 1 x’y z m3 x+y’+z’ M3
1 0 0 xy ’z’ m4 x’+y+z M4
1 0 1 xy ’z m5 x’+y+z’ M5
1 1 0 xyz’ m6 x’+y’+z M6
1 1 1 xyz m7 x’+y’+z’ M7
 Truth Tables for 16 2-Variable Function

x y F0 F1 F2 F3 F4 F5 F6 F7

0 0 0 0 0 0 0 0 0 0

1 1 0 0 0 0 1 1 1 1

0 0 0 0 1 1 0 0 1 1

1 1 0 1 0 1 0 1 0 1

Truth Tables for 16 2-Variable Function (continued)

x y F8 F9 F10 F11 F12 F13 F14 F15

0 0 1 1 1 1 1 1 1 1

1 1 0 0 0 0 1 1 1 1

0 0 0 0 1 1 0 0 1 1

1 1 0 1 0 1 0 1 0 1
 Sixteen Logic Microoperations

Boolean Function Name

F0 = 0 Clear
F1 = xy AND
F2 = xy’
F3 = x Transfer A
F4 = x’y
F5 = y Transfer B
F6 = x ⊕ y Exclusive-OR
F7 = x + y OR

Sixteen Logic Microoperations (continued)

Boolean Function Name

F8 = (x+y)’ NOR
F9 = (x ⊕ y)’ Exclusive-NOR
F10 = y’ Complement B
F11 = x + y’
F12 = x’ Complement A
F13 = x’ + y
F14 = (xy)’ NAND
F15 = 1 Set
 The Axioms of Boolean Algebra
x+0=x x• 1 = x
x + x’ = 1 x • x’ = 0
x+x=x x• x = x
x+1=1 x• 0 = 0
(x’)’ = x

x+y=y+x xy = y x
x + (y+z) = (x+y ) + z x(yz) = (xy)z
x(y + z) = xy + xz x + y z = (x+y)(x+z)
(x+y)’ = x’y’ (xy)’ = x’ + y’
x + xy = x x(x+y) = x
x + x’y = x + y x(x’+y) = xy

Simplifying Logical Expressions With

Boolean Algebra
xyz + x’y + xyz’ = xyz + xyz’ + x’y
= xy(z + z’) + x’y
= xy • 1 + x’y
= xy + x’y
= (x + x’) • y
=1• y
=y
 Simplifying Logical Expressions With
Boolean Algebra (continued)
y(wz’ + wz) + xy = yw(z’ + z) + xy
= yw + xy
= wy + xy
= (w + x) y

Simplifying Logical Expressions With

Boolean Algebra (continued)
xy(x’yz’ + xy’z’ + x’y’z’)
= xy (x’yz’ + x’y’z’ + xy’z’)
= xy (x’z’(y+y’) + xy’z’))
= xy(x’z’ + xy’z’) = xy(x’+xy’)z’
= xy(x’ + y’)z’ = xx’yz’ + xyy’z’
=0
 Simplifying Logical Expressions With
Boolean Algebra (continued)
AB + AB’ + A’C + A’C’
= A (B+B’) + A’(C+C’)
= A + A’
=1

Simplifying Logical Expressions With

Boolean Algebra (continued)
(x’+y)(x+z)(y+z)
= (x’ + y)(xy + z)
= x’xy + x’z + yxy + yz
= 0 + x’z + yxy + yz
= x’z + xyy + yz
= x’z + xy + yz
= xy + x’z + yz