DLD BOOLEAN EXPRESSIONS

Gate-Level Minimization
Unit-1 Part-3
 Introduction
 The map method
 Four-variable K-Map
 Product of-Sums Simplification
 Don’t –Care Conditions
 NAND and NOR implementation
 Other Two level Implementations

Digital Circuits 3-2
3-1 Introduction
 Gate-level minimization refers to the design task
of finding an optimal gate-level implementation of
Boolean functions describing a digital circuit.

3-2 The Map Method
 The complexity of the digital logic gates that implement a Boolean function is directly related to
the complexity of the algebraic expression from which the function is implemented.
 Logic minimization
 Algebraic approaches
 lack specific rules
 It is a time consuming process.
 Re-write the simplified expressions after each step.
 The Karnaugh map (K-map)
 It is a graphical method, which consists of 2n cells for ‘n’ variables.
 The adjacent cells are differed only in single bit position.
 If there are more than 5 variables, it is still possible to use Karnaugh maps, but it
becomes more difficult to see patterns.
 Quine-McClukey tabular method
 It is a tabular method based on the concept of prime implicants.
 Prime implicant is a product orsum term, which can’t be further reduced by combining
with any other product orsum terms of the given Boolean function.

Digital Circuits
 A simple straight forward procedure.
 A pictorial form of a truth table.
 Applicable if the # of variables < 5
 However, as the number of variables increases it becomes more difficult to see patterns, and
computer methods start to become more attractive.
 A diagram made up of squares
 Each square represents one minterm.
 Boolean function
 Sum of minterms.
 Sum of products (or product of sum) in the simplest form.
 A minimum number of terms.
 A minimum number of literals.
 The simplified expression may not be unique.
3-4
Karnaugh map (K-map)

Two-Variable Map
 A two-variable map
 four minterms
 x' = row 0; x = row 1
 y' = column 0;
y = column 1
 a truth table in square diagram
 xy
 x+y=x’y+xy’+xy
Fig. 3.2 Representation of functions in
the map

A three-variable map
 Eight minterms
 The Gray code sequence
 00, 01, 10, 11 (binary seq. ) = 00, 01, 11, 10 (gray code seq.)
 Any two adjacent squares in the map differ by only on variable
 Primed in one square and unprimed in the other
 e.g., m5 and m7 can be simplified
 m5+ m7 = xy'z + xyz = xz (y'+y) = xz

 Example 3-1
 F(x,y,z) = S(2,3,4,5)
 F = x'y + xy'

 m0 and m2 (m4 and m6) are adjacent
 m0+ m2 = x'y'z' + x'yz' = x'z' (y'+y) = x'z'
 m4+ m6 = xy'z' + xyz' = xz' (y'+y) = xz'

 Example 3-2
 F(x,y,z) = S(3,4,6,7) = yz+ xz'

 Four adjacent squares
 2, 4, 8 and 16 squares
 m0+m2+m4+m6 = x'y'z'+x'yz'+xy'z'+xyz'
= x'z'(y'+y) +xz'(y'+y)
= x'z' + xz‘ = z'
 m1+m3+m5+m7 = x'y'z+x'yz+xy'z+xyz
=x'z(y'+y) + xz(y'+y)
=x'z + xz = z

 Example 3-3
 F(x,y,z) = S(0,2,4,5,6)
 F = z'+ xy'

 Example 3-4
 F = A'C + A'B + AB'C + BC
 express it in sum of minterms
 find the minimal sum of products expression

Digital Circuits
Worksheet-1
3-13

3-3 Four-Variable Map
 The map
 16 minterms
 combinations of 2, 4, 8, and 16 adjacent squares

 Example 3-5
 F(w,x,y,z) = S(0,1,2,4,5,6,8,9,12,13,14)
 F = y'+w'z'+xz'

 Example 3-6 Simplify the Boolean function
F = ABC + BCD + ABCD + ABC

Digital Circuits
Worksheet -2
3-17

 Prime Implicants
 all the minterms are covered.
 minimize the number of terms.
 a prime implicant: a product term obtained by combining the maximum
possible number of adjacent squares (combining all possible maximum
numbers of squares).
 essential: a minterm is covered by only one prime implicant, that prime
implicant is called essential.

 the simplified expression may not be unique
 F = BD+B'D'+CD+AD = BD+B'D'+CD+AB
= BD+B'D'+B'C+AD = BD+B'D'+B'C+AB'
( , , , ) (0,2,3,5,7,8,9,10,11,13,15)
F A B C D  
Consider

3-4 Five-Variable Map
 Map for more than four variables becomes
complicated
 five-variable map: two four-variable map (one on
the top of the other)

 Table 3.1 shows the relationship between the number
of adjacent squares and the number of literals in the
term.

 Example 3-7
 F = S(0,2,4,6,9,13,21,23,25,29,31)
F = A'B'E'+BD'E+ACE

 Another Map for Example 3-7

3-5 Product of Sums Simplification
 Approach #1
 Simplified F' in the form of sum of products
 Apply DeMorgan's theorem F = (F')'
 F': sum of products => F: product of sums
 Approach #2: duality
 combinations of maxterms (like it was minterms)
 M0M1 = (A+B+C+D)(A+B+C+D')
= (A+B+C)+(DD')
= A+B+C
CD
AB 00 01 11 10
00 M0 M1 M3 M2
01 M4 M5 M7 M6
11 M12 M13 M15 M14
10 M8 M9 M11 M10

 Example 3-8
 F = S(0,1,2,5,8,9,10)
 F' = AB+CD+BD'
 Apply DeMorgan's theorem; F=(A'+B')(C'+D')(B'+D)
 Or think in terms of maxterms

 Gate implementation of the function of
Example 3-8

 Consider the
function defined in
Table 3.2.
( , , ) (1,3,4,6)
F x y z  
In sum-of-minterm:
In product-of-maxterm:

 )
7
,
5
,
2
,
0
(
)
,
,
( z
y
x
F

 Consider the
function defined in
Table 3.2. ( , , )
F x y z x z xz
 
 
Combine the 1’s:
Combine the 0’s :
z
x
xz
F 




z
x
z
x
F 



Taking the complement of F
( , , ) ( )( )
F x y z x z x z
 
  

3-6 Don't-Care Conditions
 The value of a function is not specified for
certain combinations of variables
 BCD; 1010-1111: don't care
 The don't care conditions can be utilized in
logic minimization
 can be implemented as 0 or 1
 Example 3-9
 F (w,x,y,z) = S(1,3,7,11,15)
 d(w,x,y,z) = S(0,2,5)

 F = yz + w'x'; F = yz + w'z
 F = S(0,1,2,3,7,11,15) ; F = S(1,3,5,7,11,15)
 either expression is acceptable
 Also apply to products of sum

3-7 NAND and NOR Implementation
 NAND gate is a universal gate
 can implement any digital system

 Two graphic symbols for a NAND gate

Two-level Implementation
 two-level logic
 NAND-NAND = sum of products
 Example: F = AB+CD
 F = ((AB)' (CD)' )' =AB+CD
Fig. 3-20
Three ways to implement
F = AB + CD

 Example 3-10
( , , ) (1,2,3,4,5,7)
F x y z   ( , , )
F x y z xy x y z
 
  

 The procedure
 simplified in the form of sum of products
 a NAND gate for each product term; the inputs to each
NAND gate are the literals of the term
 a single NAND gate for the second sum term

Multilevel NAND Circuits
 Boolean function implementation
 AND-OR logic => NAND-NAND logic
 AND => NAND + inverter
 OR: inverter + OR = NAND
Fig. 3.22
Implementing F = A(CD + B) + BC

NAND Implementation
Fig. 3.23
Implementing
F = (AB +AB)(C+ D)

NOR Implementation
 NOR function is the dual of NAND function
 The NOR gate is also universal

 Two graphic symbols for a NOR gate
Example: F = (A + B)(C + D)E
Fig. 3.26
Implementing
F = (A + B)(C + D)E

Example: F = (AB +AB)(C + D)
Fig. 3.27
Implementing F = (AB +AB)(C + D) with NOR gates

 Boolean-function implementation
 OR => NOR + INV
 AND
 INV + AND = NOR

3-8 Other Two-level Implementations
 Wired logic
 NAND or NOR gates allow the possibility of aa wire connection between the outputs of two gates to provide a
specific logic function.
 open-collector TTL NAND gates: wired-AND logic
 The AND gate is drawn with the lines going through the centre of the gate to distinguish it from a conventional
gate.
 A wired-logic gate does not produce a physical second-level gate, since it is just a wire connection.
 The NOR output of ECL gates: wired-OR logic
 Emitter-coupled logic (ECL) is a high-speed integrated circuit bipolar transistor logic family.
( ) ( ) ( ) ( )( )
( ) ( ) [( )( )]
F AB CD AB CD A B C D
F A B C D A B C D
      
      
  
      
AND-OR-INVERT function
OR-AND-INVERT function

Nondegenerate Forms
 16 possible combinations of two-level forms
 eight of them: degenerate forms = a single operation
 Eight of these combinations are said to be degenerate forms because they
degenerate to a single operation.
 The eight nondegenerate forms
 AND-OR, OR-AND, NAND-NAND, NOR-NOR, NOR-OR, NAND-
AND, OR-NAND, AND-NOR
 AND-OR and NAND-NAND = sum of products
 OR-AND and NOR-NOR = product of sums
 NOR-OR, NAND-AND, OR-NAND, AND-NOR = ?

AND-OR-Invert Implementation
 AND-OR-INVERT (AOI) Implementation
 NAND-AND = AND-NOR = AOI
 F = (AB+CD+E)'
 F' = AB+CD+E(sum of products)
 simplify F' in sum of products

 OR-AND-INVERT (OAI) Implementation
 OR-NAND = NOR-OR = OAI
 F = ((A+B)(C+D)E)'
 F' = (A+B)(C+D)E (product of sums)
 simplified F' in products of sum

Tabular Summary and Examples
 Example 3-11
 F' = x'y+xy'+z (F': sum of products)
 F = (x'y+xy'+z)' (F: AOI implementation)
 F = x'y'z' + xyz' (F: sum of products)
 F' = (x+y+z)(x'+y'+z) (F': product of sums)
 F = ((x+y+z)(x'+y'+z))' (F: OAI)

Tabular Summary and Examples

3-9 Exclusive-OR Function
 Exclusive-OR (XOR)
 xy = xy'+x'y
 Exclusive-NOR (XNOR)
 (xy)' = xy + x'y'
 Some identities
 x0 = x
 x1 = x'
 xx = 0
 xx' = 1
 xy' = (xy)'
 x'y = (xy)'
 Commutative and associative
 AB = BA
 (AB) C = A (BC) = ABC

 Implementations
 (x'+y')x + (x'+y')y = xy'+x'y = xy

Odd function
 ABC = (AB'+A'B)C' +(AB+A'B')C
= AB'C'+A'BC'+ABC+A'B'C
= S(1,2,4,7)
 an odd number of 1's

 Logic diagram of odd and even functions

 Four-variable Exclusive-OR function
 ABCD = (AB’+A’B)(CD’+C’D)
= (AB’+A’B)(CD+C’D’)+(AB+A’B’)(CD’+C’D)

Parity Generation and Checking
 Parity Generation and Checking
 a parity bit: P = xyz
 parity check: C = xyzP
 C=1: an odd number of data bit error
 C=0: correct or an ever # of data bit error

3.10 Hardware Description Language (HDL)
 Describe the design of digital systems in a
textual form
 hardware structure
 function/behavior
 Timing
 VHDL and Verilog HDL

A Top-Down Design Flow
Specification
RTL design and
Simulation
Logic Synthesis
Gate Level Simulation
ASIC Layout FPGA Implementation

Module Declaration
 Examples of keywords:
module, end-module, input, output, wire, and, or,
and not.
Fig. 3-37
Circuit to demonstrate an HDL

HDL Example 3.1
 HDL description for circuit shown in Fig. 3.37

Gate Displays
Example: timescale directive
‘timescale 1 ns/100ps

HDL Example 3.2
 Gate-level description with propagation delays for
circuit shown in Fig. 3.37

HDL Example 3.3
 Test bench for simulating the circuit with delay

Simulation output for HDL Example 3.3

Boolean Expression
 Boolean expression for the circuit of Fig. 3.37
 Boolean expression:
HDL Example 3.4

HDL Example 3.4

User-Defined Primitives
 General rules:
 Declaration:
Implementing the hardware in Fig. 3.39

HDL Example 3.5

HDL Example 3.5 (Continued)

Fig. 3.39
Schematic for circuit with_UDP_02467

DLD BOOLEAN EXPRESSIONS

More Related Content

Similar to DLD BOOLEAN EXPRESSIONS (20)

Recently uploaded (20)

DLD BOOLEAN EXPRESSIONS