?

Analogue Versus Digital

Positive & Negative Logic
Truth Table
Logic Gates
Universal Gates
Introduction to Boolean Algebra
Variable, Literal, and Term
Boolean Algebra Postulates , Laws, & Rules
AND-OR-INVERT Gates
Simplification Techniques
QuineMc Cluskey Tabular Method
Karnaugh Map Method (KMap)
CONCLUSION:
ANALOGUE SIGNAL
1)gives a continuous output
2)contain devices that process or work on various physical quantities
represented in analogue form

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.

* If the more positive of the two voltage or current

levels represents a logic 0 and the less positive of
the two levels represents a logic 1, then the logic
system is referred to as a negative logic system.
A truth table lists all possible combinations of
input binary variables and the corresponding
outputs of a logic system.
The logic gate is the most basic building block of
any digital system, including computers.

Graphical representation of basic logic gates.

The logic gate is the most basic building block of
any digital system, including computers.

Schematic diagram of gates

arrangement.
Logic Operation, Symbol, & Usage
An OR gate performs an ORing operation on two or more than two
logic variables.

OR gate in the standard TTL

An OR gate performs an ORing operation on two or more than two
logic variables.
An OR gate performs an ORing operation on two or more than two
logic variables.

Exampl
e:

IC 7432 building block d

An AND gate is a logic circuit having two or more inputs and
one output.

AND gate in standard TTL

An AND gate is a logic circuit having two or more inputs and
one output.
An AND gate is a logic circuit having two or more inputs and
one output.

IC 7408 building block diagram

A NOT gate is a one-input, one-output logic circuit whose output
is always the complement of the input.

Inverter in the standard TTL

A NOT gate is a one-input, one-output logic circuit whose output
is always the complement of the input.

IC 7404 building block diagr

The EXCLUSIVE-OR gate, commonly written as EX-OR gate, is a
two-input, one-output gate.

EX-OR gate in the standard TTL

The EXCLUSIVE-OR gate, commonly written as EX-OR gate, is a
two-input, one-output gate.
The EXCLUSIVE-OR gate, commonly written as EX-OR gate, is a
two-input, one-output gate.
The EXCLUSIVE-OR gate, commonly written as EX-OR gate, is a
two-input, one-output gate.
An AND gate followed by a NOT circuit makes it a NAND gate

Standard TTL NAND gate

An AND gate followed by a NOT circuit makes it a NAND gate

The General
Expression
An OR gate followed by a NOT circuit makes it a NOR gate

NOR gate in the standard TTL

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

74266 Quad XNOR DIP-format IC

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:

2. Associative law of addition: A + (B+C) = (A + B) + C and

multiplication: A(BC) =is(AB)C
equivalent
to:
3. Boolean Rule

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.

A sum-of-products expression is also known as a minterm expression.

The Truth Table of SOP
A product-of-sums expression contains the product of
different terms, with each term being either a single literal
or a sum of more than one literal.
Y A B C A B C A B C A B C

Transforming the given product-of-sums expression into

an equivalent sum-of-products expression is a
straightforward process.
Y A B C A B C A B C A B C
Y A B C A B C A B C A B C
Are they
equivalen
Transforming POS into SOP: t?
(a)taking the dual of the given expression,
(b)multiplying out different terms to get the sum-of products
form,
(c) removing redundancy, and
(d) taking a dual to get the equivalent product-of-sums
expression.
Consider the following sum-of-
products
Case 1: expression
Origin expression:

The expanded sum-of-products expression:

Case 2:
Origin expression:

The expanded sum-of-products expression:

An expanded form of Boolean expression, where each term contains all
Boolean variables in their true or complemented form, is also known as
the canonical form of the expression.
Case 1:
Origin expression:

The expanded sum-of-products expression:

Case 2:
Origin expression:

The expanded sum-of-products expression:

 and notations are respectively used to represent
sum-of-products and product-of-sums Boolean
expressions.
Case 1:

The expanded sum-of-products expression:

Notated SOP:

Case 2:

The expanded sum-of-products expression:

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