Scribd
Upload
1 views

Lecture #5

Uploaded by

Haronicle
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
1 views

Lecture #5

Uploaded by

Haronicle
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16

Synthesis Using AND, OR, and NOT Gates

A logic circuit (a function) has the following truth table

To implement the function:


 create a product term that has a value of 1 for each valuation for which the
output function f has to be 1. Then we can take a logical sum of these product
terms to realize f .

1
First row ➔
Second row ➔
Fourth row ➔
 Thus, f may be realized as

 Simplifying the expression results in

2
The logic network corresponding to

Canonical sum-of-products

The network described by the simplified expression

Minimal-cost realization

3
 Sum-of-Products and Product-of-Sums Forms
 If a function f is specified in the form of a truth table, then an expression that
realizes f can be obtained in two ways.
a) Considering the rows in the table for which f = 1
b) Considering the rows for which f = 0

a) Considering rows with f = 1


Minterms
• For a function of n variables, a product term in which each of the n
variables appears once is called a minterm.

•Minterm is formed by including xi if xi = 1 and by


including xi if xi = 0.

4
 Three-variable minterms:

 Sum-of-Products Form
 Any function f can be represented by a sum of minterms that correspond to
the rows in the truth table for which f = 1.
• A logic expression consisting of product (AND) terms that are
summed (ORed) is said to be of the sum-of products form. If each
product term is a minterm, then the expression is called a canonical
sum-of-products for the function f .

5
Example: Synthesize the function f

We take minterms m1, m4, m5, and m6 and the function becomes

(Canonical sum-of-products expression)

This expression can be manipulated as follows

6
A minimal sum-of-products realization
b) Considering rows with f = 0
 Maxterms
Maxterms are complements of minterms.
We synthesize f by considering the rows for which f = 0.

7
 Product-of-Sums Form
 A logic expression consisting of sum (OR) terms that are the factors of a logical
product (AND) is said to be of the product-of-sums form.

 If each sum term is a maxterm, then the expression is called a canonical product-of-
sums for the given function.

 Any function f can be synthesized by finding its canonical product-of-sums. This


involves taking the maxterm for each row in the truth table for which f = 0 and
forming a product of these maxterms.

8
 Considering the previous example,

, alternatively:

This expression can be reduced to

9 A minimal product-of-sums realization


 Universal Gate: A gate which can be use to create any Logic gate.
 NAND and NOR Gates are called Universal Gates because all the other gates
can be created by using these gates.
 The NAND and NOR functions which are obtained by complementing the
output generated by AND and OR operations, respectively.
 These functions are attractive:
• Implemented with simpler electronic circuits than the AND and OR
functions.

10
 According to DeMorgan’s theorem,

11
Hence,
 A NAND of variables x1 and x2 is equivalent to first complementing each of the variables
and then ORing them.

 The NOR function is equivalent to first inverting the input variables and then
ANDing them.

 We have explained how any logic function can be implemented either in sum of-
products or product-of-sums form.
 Leads to logic networks that have either an AND-OR or an OR-AND
structure, respectively.

12
 Consider a AND-OR network.

 This network can be transformed into a network of NAND gates


 First, each connection between the AND gate and an OR gate is replaced by a connection
that includes two inversions.
 One inversion at the output of the AND gate and
 Another at the input of the OR gate.
• We know that, OR gate with inversions at its inputs is equivalent to a
NAND gate.

13
 Thus, we can redraw the network using only NAND gates:

14
 Similarly a product-of-sums network can be transformed into a circuit with only
NOR gates

15
 Exercise:
1.

2.

16

You might also like