Faculty of Computer and

Mathematical
Sciences

Digital System and Logic

CHAPTER 1 (B)

8/5/15

CSC159 - COMPUTER ORGANIZATION

Faculty of Computer and

Mathematical
Sciences

Integrated Circuits
The building blocks of computers
Designed for specialized functions
Examples: the CPU, bus interface,
memory management unit

Transistors: primary components of

ICs
Motorola MPC 7400 PowerPC modules:
6.5 million transistors in less than in2
Supplementary Chapter 1
Digital Computer Logic

S1-2

Faculty of Computer and

Mathematical
Sciences

Transistors
Boolean algebra: basis for computer
logic design
Transistors: means for implementing
Boolean algebra
Switches: on/off to represent the 0s
and 1s of binary digital circuits
Combined to form logic gates
Supplementary Chapter 1
Digital Computer Logic

S1-3

Faculty of Computer and

Mathematical
Sciences

Digital Circuits
Combinatorial logic
Results of an operation depend only on the
present inputs to the operation
Uses: perform arithmetic, control data
movement, compare values for decision
making

Sequential logic
Results depend on both the inputs to the
operation and the result of the previous
operation Supplementary Chapter 1
S1-4
Digital Computer Logic
Uses: counter

Faculty of Computer and

Mathematical
Sciences

Boolean Algebra
Rules that govern constants and variables
that can take on 2 values
True/false; on/off; yes/no; 0/1

Boolean logic
Rules for handling Boolean constants and
variables
3 fundamental operations:
AND, OR and NOT
Truth Table: specifies results for all possible
input combinations
Supplementary Chapter 1
Digital Computer Logic

S1-5

Faculty of Computer and

Mathematical
Sciences

Boolean Operators
AND
Result TRUE if and only if both
input operands are true
C=A
B

INCLUSIVE-OR
Result TRUE if any input
operands are true
C=A+B
Supplementary Chapter 1
Digital Computer Logic

S1-6

Faculty of Computer and

Mathematical
Sciences

Boolean Operators
NOT
Result TRUE if single input
value is FALSE
C=A

Supplementary Chapter 1
Digital Computer Logic

S1-7

Faculty of Computer and

Mathematical
Sciences

Boolean Operators
EXCLUSIVE-OR
Result TRUE if either A or B is
TRUE but not both
C=AB
Can be derived from
INCLUSIVE-OR, AND and NOT

A B = (A + B) ( A B )

A xor B equals A or B but not both A and B

A B = (A B ) + ( B A )

A xor B = either A and not B or B and not A

Supplementary Chapter 1
Digital Computer Logic

S1-8

Faculty of Computer and

Mathematical
Sciences

Boolean Algebra
Operations
Valid for INCLUSIVE-OR, AND, XOR
Associative

A + ( B + C ) = ( A + B ) + C

Distributive
A ( B + C ) = A B +A C

Commutative
A + B =B + A

DeMorgans Theorems

A + B =A B
A B =A + B

Supplementary Chapter 1
Digital Computer Logic

S1-9

Faculty of Computer and

Mathematical
Sciences

Computer Implementation
Gates or logical gates
Integrated circuits constructed from
transistor switches and other electronic
components

Supplementary Chapter 1
Digital Computer Logic

S1-10

Faculty of Computer and

Mathematical
Sciences

Logic Expression
Truth Table
Table of all combination of variable showing the relation
between the values that the variable may take and the
result of the operation.
Possible number of combination;
No. of combination = 2no. of variables
Example : There are 2 variables used, x and y.
No. of combination = 22
=4

x
0
0
1
1

y
0
1
0
1

z=x.y
0
0
0
1

Faculty of Computer and

Mathematical
Sciences

Logic Expression
From a truth table, we can write two
forms of logic or Boolean expressions:
Sum of Product (SOP) and Product of Sum
(POS) expressions.
Sum of Product (SOP) expression is
the sum of all product terms when
the output is a logic 1. What is a
product term? A product term is
formed
by
ANDing
the
complemented or uncomplemented
input variables.
Supplementary Chapter 1
Digital Computer Logic

S1-12

Faculty of Computer and

Mathematical
Sciences

Sum of Product (SOP)

For a 2 variables truth table, the product
term for :

AB=00
AB=01
AB=10
AB=11

Supplementary Chapter 1
Digital Computer Logic

is
is
is
is

~B.~A,
~B.A,
B.~A and,
A.B

S1-13

Faculty of Computer and

Mathematical
Sciences

Product of Sum (POS)

Product of Sum (POS) expression is
the product all sum terms when the
output is a logic 0. What is a sum
term? A sum term is formed by
ORing the complemented or
uncomplemented input variables.

Supplementary Chapter 1
Digital Computer Logic

S1-14

Faculty of Computer and

Mathematical
Sciences

Product of Sum (POS)

For a 2 variables truth table, the sum
term for

AB=00 is A+B
AB=01 is B+~A,
AB=10 is ~B+A and
AB=11 is ~B+~A

Supplementary Chapter 1
Digital Computer Logic

S1-15