Você está na página 1de 30

TCB1043 COMPUTER

ORGANISATION
Fundamental Building Block
of Computer

Saipunidzam Mahamad

/ Computer Organisation

Learning Objectives
Introducing to integrated circuit
Logic gates and Truth-tables
Simple Boolean algebra

Saipunidzam Mahamad

/ Computer Organisation

Introduction
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

Saipunidzam Mahamad

/ Computer Organisation

Introduction
What is digital Electronic?
Electronics with only two distinct values for working
with voltages: VH and VL
One input or output signal can have only two possible
states called LOGIC states.

What are digital Circuits?


Electronic Circuits in which only Two Logical Values
are present.
For example, in digital circuits:
0v signal voltage 1v represents Logic Value of 0.
4v signal voltage 5v represents Logic Value of 1.
Any other signal voltages outside this range are ignored.
Saipunidzam Mahamad

/ Computer Organisation

Introduction
What are Logic gates?
Tiny digital electronic devices made out of Transistors that
can be used to operate as switches.
The fundamental elements for building large digital electronic
circuits and computers
Can be combined in large numbers to perform specific digital
electronic functions
Can have only two possible Logic Values (1 or 0)

Saipunidzam Mahamad

/ Computer Organisation

Introduction
What are Digital Logic?
The business of
manipulating digital circuit
with many input and one
output signals in terms of
two opposite values: 1 and 0
(True and False)
An input or an output signal
can have only two possible
states called LOGIC states
True or False; 1 or 0; Yes or
No; On or OFF
Saipunidzam Mahamad

/ Computer Organisation

What is a Truth
Table
A table showing all
possible combination
of input value and
the corresponding
output value for each
combination
Each combination is
a different pattern of
1s and 0s

Logic Gates
The NOT gate (inversion gate)

Saipunidzam Mahamad

/ Computer Organisation

Logic Gates
The AND gate

Saipunidzam Mahamad

/ Computer Organisation

Logic Gates
The OR gate

Saipunidzam Mahamad

/ Computer Organisation

Logic Gates
The NAND gate

Saipunidzam Mahamad

/ Computer Organisation

Logic Gates
The NOR gate

Saipunidzam Mahamad

/ Computer Organisation

Logic Gates
The XOR gate

Saipunidzam Mahamad

/ Computer Organisation

Logic Gates
Construction of Gates using only NAND
or only NOR gates

Saipunidzam Mahamad

/ Computer Organisation

Logic Gates
Truth Tables Summary for Logic Gates

Saipunidzam Mahamad

/ Computer Organisation

Logic Gates
Logic Gates: Symbol Summary

Saipunidzam Mahamad

/ Computer Organisation

Logic Gates
Alternative Symbol for some Gates

Saipunidzam Mahamad

/ Computer Organisation

Boolean Algebra
What is Boolean Algebra?
was formulated by George Boole, an English mathematician
(1815-1864)
In digital electronics, Boolean algebra is used as a set of
powerful Mathematical Rules and Techniques to Predict and
Analyse the Behaviour of digital circuits.
Its describes rules that govern constants and variables that
can take on two values
Unlike other type of algebra, variables in Boolean algebra
(also called Boolean variables) can only have two distinct
values: 1 or 0
Saipunidzam Mahamad

/ Computer Organisation

Boolean Algebra
Postulates of Boolean Algebra?
Given X as Boolean variable and using the truth tables of
the OR gate, the AND gate and the NOT gate, the
following postulates can be stated:
Postulate-1: X=0 or X=1
Postulate-2: 00 = 0
Postulate-3: 1+1 = 1
Postulate-4: 0+0 = 0
Postulate-5: 11 = 1
Postulate-6: 10 = 01 = 0
Postulate-7: 1+0 = 0+1 = 1
Saipunidzam Mahamad

/ Computer Organisation

Boolean Algebra
Theorems or Laws of Boolean Algebra
Given 2 Boolean variables A and B, the following
constitutes Boolean Theorems. Note that these theorems
can be proven using truth tables of the basic logic gates we
have seen before
T-1: Commutative Law
a) A + B = B + A
b) A B = B A

T-2: Associative Law


a) (A + B) + C = A + (B + C)
b) (A B) C = A (B C)
Saipunidzam Mahamad

/ Computer Organisation

Boolean Algebra
Theorems or Laws of Boolean Algebra
T-3: Distributive Law
a) A ( B + C) = A B + A C
b) A+ ( B C) = (A + B) (A + C)

T- 4: Identity Law
a) A + A = A
b) A A = A

T-5: Negation Law


a) (A) = A b) (A) = A

T- 6: Redundance Law
a) A + A B = A
b) A (A + B) = A
Saipunidzam Mahamad

/ Computer Organisation

Boolean Algebra
Theorems or Laws of Boolean Algebra
T-7
a) 0 + A = A
c) 1 + A = 1

b) 1 A = A
d) 0 A = 0

T- 8
a) A + A = 1

b) A A = 0

T- 9
a) A + A B = A + B
b) A (A + B) = A B

T - 10: De Morgans Theorem


a) (A + B) = A B
b) (A B) = A + B
Saipunidzam Mahamad

/ Computer Organisation

Boolean Algebra
Theorem or Law of Boolean Algebra
Note that:
The Commutative, Associative and
Distributed laws apply both to the OR
(inclusive-OR) as well as the XOR
(exclusive-OR) operation

Saipunidzam Mahamad

/ Computer Organisation

Boolean Algebra
Summary

Saipunidzam Mahamad

/ Computer Organisation

Boolean Algebra
Proving Boolean Theorems: An Example

Saipunidzam Mahamad

/ Computer Organisation

Digital Circuit
Designing Digital Circuits Based on Boolean
Expression: Example
A Boolean Expression is a Boolean equation
describing one output in terms of one or more inputs
(or Boolean variables)
Example: Implement the following expression in a
digital circuit.

Saipunidzam Mahamad

/ Computer Organisation

Digital Circuit
More practiceUsing more than 2 input gates
The output of a NAND gate is 1 if any of its inputs
is 0. That is, the output is 0 if and only if all its
inputs are 1s. The boolean expression for a 4-input
NAND gate is:
Output = ABCD

where Output = 0 only when A=1, B=1, C=1 and


D=1, otherwise, Output = 1

Saipunidzam Mahamad

/ Computer Organisation

Digital Circuit
More PracticeDeriving Boolean Expression
from Digital Circuits
a) Write down the Boolean expression at the output Y
of the 3-input NAND gate in the following digital
circuit in terms of the inputs A, B and C
b) Complete the truth table for the same circuit.

Saipunidzam Mahamad

/ Computer Organisation

Digital Circuit & Logic Gates


Solution:

Saipunidzam Mahamad

/ Computer Organisation

Summary
Digital circuit and logic gates
AND, OR, NOT, NAND, NOR, XOR

Boolean algebra
Designing a digital circuit

Saipunidzam Mahamad

/ Computer Organisation

What Next?
More on Digital Circuits
Simple combinatorial circuits
Sequential circuits & Flip-Flops
Read the Supplementary Chapter-1 of the
textbook.

Saipunidzam Mahamad

/ Computer Organisation

Você também pode gostar