Digital Logic and Design

Lecture No 16 : Possible Boolean Functions and Logic

BEE-11AB, Fall 202
Dated 19 Nov 2020

By Nasir Mahmoo
nasir.mahmood@seecs.edu.pk
nasirm15@gmail.com

1
0

Function Gate Implementations Contd..

2
Function Gate Implementations
● It is easier to implement a Boolean function with these
types of gates (as seen on last slide)

● Inverter (Complement), Buffer (transfer), AND, OR,

NAND, NOR, X-OR, and XNOR (equivalence) are
used as standard gates in digital design

● NAND and NOR are extensively used logic gates and

are more popular than AND and OR gates because
these gates are easily constructed with transistor
circuits and digital circuits are easily implemented
with them

3
 Multiple Inputs
●All of the previous defined gates, with the
exception of the inverter and the buffer, can
have multiple inputs.

● A gate can have multiple inputs provided it is a binary

operation that is commutative

(x + y = y + x and xy = yx)

and associative

(x + (y + z) = (x + y) + z and x(yz) = (xy)z)

● NAND and NOR functions are commutative but not

associative

● To overcome this difficulty we define multiple NOR (or

NAND) gate as a complemented OR (or AND) gate
e.g., as (x+y+z)’ or (xyz)’





Multiple Inputs (Non-associative NOR operation)
Multiple Inputs NOR and
NAND gates
 Multiple Inputs XOR gate
• 3-input XOR gate is normally implemented by
cascading 2-input gates (multiple inputs XOR is
uncommon from hardware point)
Positive and Negative Logic
• Binary signals in a circuit can have one of two values.
• One signal represents logic-1 and the other logic-0.

• A circuit input or output will hold either a high or low

signal.
• Choosing the high level, H, to represent logic-1 is called a positive logic system.

• Choosing the low level, L, to represent logic-1 is called a negative logic system

Positive and Negative Logic gates

 Learning Objective

● Given a function (completely or incompletely specified) of

three to five variables, plot it on a Karnaugh map and
use to simplify Boolean expressions. The function may
be given in minterms, maxterms, or algebraic form

● Reference Text Book section 3.1 to 3.3

10
 Karnaugh Map Method
● Provides an alternative technique for representing
Boolean functions

● One Box/square on map is for each row i.e minterm

or maxterm of the function in Truth Table

● Karnaugh map's input values must be ordered such

that the values for adjacent columns vary by only a
single bit, for example, 00, 01, 11, and 10. This is
necessary to observe the variable transitions
● Known as a Gray code

11

 Multiple Inputs K-Map

● Three and Four-variable maps

12
 Two-Variable Map

● A two-variable map
holds four minterms for
two variables.
● Again, we mark the squares
of the minterms that belong
to a given function.
● Note that the sequence is not
arranged in a binary way.
● The sequence used, similar
to Gray code, allows only
one bit to change from
column to column and row to
row.

13

 Three-Variable Map

● A three-variable map
holds eight minterms for
three variables.
● Again, we mark the squares
of the minterms that belong
to a given function.
● Note that the sequence is not
arranged in a binary way.
● The sequence used, similar
to Gray code, allows only
one bit to change from
column to column and row to
row.

14

 Three-Variable Map

● Correction: Columns are yz and not xz in fig 3-3 (book)

15
 Mapping Functions for three-
variable map
● When you have already been provided a function,
you can map the function into a K-map by
remembering
● the cells of a k-map represent minterms
● a 1 in a cell indicates that the minterm is part of the function
● two adjacent 1’s represent a two literal term
● four adjacent 1’s represent a one literal term
● eight adjacent 1’s represent a true function, F = 1

16

 Minimization Characteristics in 3-Variable Maps

● Since any two adjacent cells in a 3-variable map

represent a change in only a single bit, we use this to
do minimization.
● Consider the two cells for m0 and m1 where the difference is the
negation of the bit z.
● F = m0 + m1 = x’y’z’ + x’y’z = x’y’(z’ + z) = x’y’

17

The End

18