Professional Documents
Culture Documents
Gerbang Logika
Gerbang Logika
DIGITAL SIGNAL
1)represents the numerical value of the quantity in steps of discrete
values
2)contain devices that process the physical quantities represented in
digital form
* If the more positive of the two voltage or current
levels represents a logic 1 and the less positive of
the two levels represents a logic 0, then the logic
system is referred to as a positive logic system.
Exampl
e:
The General
Expression
An OR gate followed by a NOT circuit makes it a NOR gate
The General
Expression
An OR gate followed by a NOT circuit makes it a NOR gate
EXCLUSIVE-NOR (commonly written as EX-NOR) means NOT of EX-
OR, i.e. the logic gate that we get by complementing the output of
an EX-OR gate
The General
Expression
Three Basic Logic
Gates
1. 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.
2. The values assigned to a variable have a numerical significance in
ordinary algebra, whereas in its Boolean counterpart they have a
logical significance.
3. 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.
4. More specifically, Boolean algebra captures the essential properties of
both logic operations such as AND, OR and NOT and set operations
such as intersection, union and complement.
5. Boolean algebra may also be defined to be a set A supplied with two
binary operations of logical AND (, logical OR (V), a unary operation
of logical NOT () and two elements, namely logical FALSE (0) and
logical TRUE (1)
8 3 5 Terms
Literals Variables
7 4 5 Terms
Literals Variable
s
1. Boolean Algebra
Postulates
2. Boolean
Algebra Lawslaw of addition: A + B = B + A and multiplication: AB
1. Coomutative
= BA
is equivalent
to:
A 1 X
0 1 0
1 1 1
A 0 X
0 0 0
1 0 1
A 1 X
0 1 1
1 1 1
A A X
0 0 0
1 1 1
A A X
0 0 0
1 1 1
A A X
c
0 1 0
A A X
1 0 0
c
0 1 1
1 0 1
A A Ac
c c
0 1 0
1 0 1
Write the equation of the circuits below, simplify the equation,
and draw the logic circuit of the simplified equation!
Circuit
1
Circuit
2
This theorem allows us to convert an expression having an
inversion bar over two or more variables into an expression
having inversion bars over single variables only.
Case 1:
equivalent
result
Case 2:
equivalent
result
Example:
A) Simplify the circuit below and draw the simplified circuit!
X AB
B) Derive the simplified equation of ( A C ) AB A B C
!
Prior Concepts:
1. Sum-of-Products Boolean
Expressions
2. Product-of-Sums Expressions
3. Expanded Forms of Boolean
Expressions
4. Canonical Form of Boolean
Expressions
5. and Nomenclature
A sum-of-products expression contains the sum of
different terms, with each term being either a single literal
or a product of more than one literal.
Case 2:
Origin expression:
Case 2:
Origin expression:
Notated SOP:
Case 2:
Notated POS:
QuineMc Cluskey Tabular
Method
Karnaugh Map Method
(KMap)
* Reff. Anil K. Maini (2007):
228
RESOURCES:
1)Number Systems
2)Binary Codes Maini, A.K. 2007. Digital
Electronics: Principles,
3)Binary Arithmetic Devices and
4)Logic families Applications. India: John
Wiley & Sons.
5)Arithmetic Circuits
Balch, M. Complete
6)Programable Logic Devices
Digital Design: A
7)Flip-Flops and Related Devices
Comprehensive Guide to
8)Counters and Registers Digital Electronics
and Computer System
9)Data Conversion CircuitsArchitecture. USA: The
McGraw-Hill Companies.
10)Microprocessors
11)Microcontrollers
Crowe, J. & Hayes-Gill, B.
12)Computer Fundamentals 1998. Introduction to
Digital
THANKS