cs 121 digital logic design
DESCRIPTION
Chapter 3. CS 121 Digital Logic Design. Gate-Level Minimization. Outline. 3.1 Introduction 3.2 The Map Method 3.3 Four-Variable Map 3 .4 Product of sums simplification 3.5 Don‘t Care Conditions 3.7 NAND and NOR Implementaion 3.8 Other Two-Level Implementaion 3.9 Exclusive-OR function. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/1.jpg)
CS 121Digital Logic
Design
Gate-Level Minimization
Chapter 3
![Page 2: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/2.jpg)
Outline3.1 Introduction3.2 The Map Method3.3 Four-Variable Map3.4 Product of sums simplification3.5 Don‘t Care Conditions3.7 NAND and NOR Implementaion3.8 Other Two-Level Implementaion3.9 Exclusive-OR function
![Page 3: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/3.jpg)
3.1 Introduction (1-1)
Gate-Level Minimization refers to the design task of finding an optimal gate-level implementation of the Boolean functions describing a digital circuit.
Notes about simplification of Boolean expression: Minimum number of terms and literals in each term
(minimum number of gates and inputs in the digram). Reduce the complexity of the digital gates. The simplest expression is not unique.
Simplification Methods: Algebraic minimization lack on specific rules. (section
2.4). Karnaugh map or K-map.
![Page 4: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/4.jpg)
A Karnaugh map is a graphical tool for assisting in the general simplification procedure.
Combination of 2, 4, … adjacent squares
The relation is:Logic circuit ↔ Boolean function ↔ Truth table ↔ K-map ↔ conical form ↔ satndrad form.
Conical form: ( sum of minterms , product of maxterms.
Standrad form: ( simplifier : sum of product , product of sum
3.2 The Map Method (1-12)
![Page 5: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/5.jpg)
Number of sequares (minterms) is , where n is the number of variables.
So in tow-variable map there are 4 squares(minterms).
3.2 The Map Method (2-12)Two-variable
maps:
Y’ Y
X
X’
![Page 6: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/6.jpg)
3.2 The Map Method (3-12)
Rules for K-map:o We can reduce functions by circling 1’s in the K-mapo Each circle represents a minterm reductiono Following circling, we can deduce minimized and-or
form. Rules to considero Every cell containing a 1 must be included at least
once.o The largest possible “power of 2 rectangle” must be
enclosed.o The 1’s must be enclosed in the smallest possible
number of rectangles.
![Page 7: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/7.jpg)
Example 1:F(X,Y) = XY’ + XY
Two-Variable maps (cont.)
3.2 The Map Method (4-12)
From the map, we see thatF (X,Y) = X.Note: There are implied 0s in other boxes.
This can be justified using algebraic manipulations:F(X,Y) = XY’ + XY
= X(Y’ +Y) = X.1
= X
11 X
![Page 8: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/8.jpg)
Example 2:G(x,y) = m1 + m2 + m3
Two-Variable maps (cont.)
3.2 The Map Method (5-12)
G(x,y) = m1 + m2 + m3
= X’Y + XY’ + XY
From the map, we can see that :
G = X + Y
1
11 X
Y
![Page 9: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/9.jpg)
Example 3:F = Σ(0, 1)
Two-Variable maps (cont.)
3.2 The Map Method (6-12)
Using algebraic manipulations:
F = Σ(0,1) = x’y + x’y’ = x’ (y+y’) = x’
11 X’
x y F0 0 10 1 11 0 01 1 0
![Page 10: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/10.jpg)
3 variables 8 squares ( minterms). On a 3-variable K-Map:
◦ One square represents a minterm with three variables◦ Two adjacent squares represent a product term with two variables◦ Four “adjacent” terms represent a product term with one variables◦ Eight “adjacent” terms is the function of all ones (logic 1).
3.2 The Map Method (7-12)Three-variable
maps:
![Page 11: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/11.jpg)
using algebraic manipulations: F = X’Y’Z’ + X’YZ’ + XY’Z’ + XYZ’ = Z’ (X’Y’ + X’Y + XY’ + XY)
= Z’ (X’ (Y’+Y) + X (Y’+Y)) = Z’ (X’+ X)
= Z’
3.2 The Map Method (8-12)Three-variable maps
(cont.):Example 1:F(X,Y) = X’Y’Z’ + X’YZ’ + XY’Z’ + XYZ’
Y Z
x 1
1
1
1
![Page 12: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/12.jpg)
Example 2:F=AB’C’ +ABC +ABC +ABC + A’B’C + A’BC’
three-Variable maps (cont.)
3.2 The Map Method (9-12)
From the map, we see thatF=A+BC +BC
B CA
1
1
1
11 1
00 01 11 1001
![Page 13: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/13.jpg)
Example 4 :F (x, y, z)= Σm (2, 3, 6, 7)
three-Variable maps (cont.)
3.2 The Map Method (10-12)
using algebraic manipulations:
F(x , y, z) = x’yz + xyz + x’yz’ + xyz’
= yz (x’ + x) + yz’ (x’ + x)
= yz + yz’ = y (z + z’) = y
y zx
1 1
11
00 01 11 1001
Y
![Page 14: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/14.jpg)
Example (3-1) , (3-2) :
three-Variable maps (cont.)
3.2 The Map Method (11-12)
![Page 15: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/15.jpg)
Example (3-3) , (3-4) :
three-Variable maps (cont.)
3.2 The Map Method (12-12)
![Page 16: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/16.jpg)
3.3 Four-Variables Map (1-9)
4 variables 16 squares ( minterms). On a 4-variable K-Map: Two adjacent squares represent a term of three literals. Four adjacent squares represent a term of two literals. Eight adjacent squares represent a term of one literal. Note: The larger the number of squares combined, the
smaller the number of literals in the term.
![Page 17: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/17.jpg)
3.3 Four-Variables Map (2-9)
Flat Map Vs. Torus
![Page 18: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/18.jpg)
3.3 Four-Variables Map (3-9)
Example 1 (3-5) :F(w,x,y,z) = ∑ ( 0,1,2,4,5,6,8,9,12,13,14)
y z
w x 1
00 01 11 1000011110
1
1 1
1 1
1 1
1
1
1Y’
W’YZ’
XYZ’
F = y‘ + w‘yz‘ + xyz‘
![Page 19: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/19.jpg)
3.3 Four-Variables Map (4-9)
Example 2 (3-6) :F = A’B’C’ + B’CD’ + A’BCD’ + AB’C’
C D
A B1
00 01 11 101
F = B‘D‘ + B‘C‘ + A‘CD‘
00011110
1
1
11 1 B’D’
B’C’
A’CD’
![Page 20: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/20.jpg)
3.3 Four-Variables Map (5-9)
Simplification using Prime Implicantso A Prime Implicant is a product term obtained by
combining the maximum possible number of adjacent squares in the map .
o If a minterm in a square is covered by only one prime implicant, that implicant is called Essential .
o Prime Implicants and Essential Prime Implicants can be determined by inspection of a K-Map.
o Notes:• Two adjacent 1’s form prime implicant, if they are not within a
group of four adjacent squares.• Four adjacent 1’s form prime implicant, if they are not within
a group of eight adjacent squares and so on.
![Page 21: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/21.jpg)
3.3 Four-Variables Map (6-9)Simplification using Prime ImplicantsExample 1:F(A,B,C,D) = ∑ (0,2,3,5,7,8,9,10,11,13,15)
Minterms covered by single prime implicant
DB
CB
1 1
1 1
1 1
B
D
A
1 11 1
1
ESSENTIAL Prime Implicants
C
BD
CD
BD
DB
1 1
1 1
1 1
B
C
D
A
1 1
1 1
1
AD
BA
![Page 22: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/22.jpg)
3.3 Four-Variables Map (7-9)Simplification using Prime ImplicantsExample 1:F(A,B,C,D) = ∑ (0,2,3,5,7,8,9,10,11,13,15)
o Essential prim implicants:BD , B’D’o Prime implicant: CD , B’C, AD , AB’.o The minterms that not cover by essential implicants are: m3, m9,
m11.The simplified expression is optained from the sum of the
essential implicants and other prime implicants that may be needed to cover any remaining minterms.
o So this function can be written with these ways:• F = BD + B’D’ + CD + AD• F = BD + B’D’ + CD + AB’• F = BD + B’D’ + B’C + AD• F = BD + B’D’ + B’C + AB’
![Page 23: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/23.jpg)
3.3 Four-Variables Map (8-9)Simplification using Prime ImplicantsExample 2:F(W,X,Y,Z) = ∑ (0,2,3,8,9,10,11,12,13,14,15)
X
Y
Z
W
1 1 1
1 1 1 1
1 1 11
W
X’Y
X’Z’ Note: that all
of these prime implicants are
essential .
![Page 24: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/24.jpg)
3.3 Four-Variables Map (9-9)Simplification using Prime ImplicantsExample 3:F(W,X,Y,Z) = ∑ (0,2,3,4,7,12,13,14,15)
X
Y
Z
W
1 1 1
1 1
1 1 1 1
WX
W’Y’Z’
W’X’Y
W’YZ
XYZXY’Z
’
• Essential: WX• Prime: XYZ ,
XY’Z’ , W’Y’Z’, W’YZ, W’X’Y , W’X’Z’
W’X’Z’
![Page 25: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/25.jpg)
3.5 Producut-of-Sum simplification (1-9)
1. Mark with 1’s the minterms of F.2. Mark with 0’s the minterms of F’.
3. Circle 0’s to express F’.4. Complement the result in step 3 to
obtain a simplified F in product-of-sums form.
![Page 26: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/26.jpg)
3.5 Producut-of-Sum simplification (1-9)Example 1:Simplify :F= ∑(0,1,2,5,8,9,10) in Product-of-Sums Form
B
C
D
A
1 1 1
1
1 1 1
0
0 0 0
0 0 0 0
0
CD
ABBD’
• F’ = AB + CD + BD’• F = (F’)’ = (A’+B’) + (C’+D’) +
(B’+D)
![Page 27: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/27.jpg)
3.5 Producut-of-Sum simplification (1-9)
Example 2:Simplify :F(x, y, z) =(0, 2, 5,7)in Product-of-Sums Form
y zx
0
00 01 11 1001 0
0 0
XZ
X’Z’
• F’ = XZ + X’Z’• F = (F’)’ = (X’+Z’) +
(X+Z)
![Page 28: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/28.jpg)
3.6 Don't Cares Condition (1-4)
Sometimes a function table or map contains entries for which it is known:
The input values for the minterm will never occur, or The output value for the minterm is not used. Functions that have unspecified outputs for some input combinations are
called incompletely specified functions. In these cases, the output value is defined as a “don't care” ( an “x”
entry) assumed to be either 0 or 1. The choice between 0 and 1 is depending on the way the incompletely
specified function is simplied. By placing “don't cares” in the function table or map, the cost of the logic
circuit may be lowered.
![Page 29: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/29.jpg)
3.6 Don't Cares Condition (2-4)
Example : A logic function having the binary codes
for the BCD digits as its inputs. Only the codes for 0 through 9 are used.
The six codes, 1010 through 1111 never occur, so the output values for these codes are “x” to represent “don’t cares.”
![Page 30: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/30.jpg)
3.6 Don't Cares Condition (3-4)
Example (3.9) :F(W,X,Y,Z) = ∑ (1,3,7,11,15)d(W,X,Y,Z) = ∑ (0,2,5)
X
Y
Z
W
1 1 xx
1
0
x
1
1
0
0
0 0
0
0
0
F = YZ + W’Z
X
Y
Z
W
1 1 xx
1
0
x
1
1
0
0
0 0
0
0
0
F = YZ + W’X’
![Page 31: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/31.jpg)
3.6 Don't Cares Condition (4-4)
Example (3.9) :F(W,X,Y,Z) = ∑ (1,3,7,11,15)d(W,X,Y,Z) = ∑ (0,2,5)
X
Y
Z
W
1 1 xx
1
0
x
1
1
0
0
0 0
0
0
0
F’ = Z’ + WY’F = Z ( W’ + Y)
![Page 32: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/32.jpg)
3.7 NAND and NOR Implementation (1-15)
Digital circuits are frequently constructed with NAND or NOR gates rather than with AND and OR gates.
![Page 33: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/33.jpg)
3.7 NAND and NOR Implementation (2-15)
NAND gate: a universal gate. Any digital system can be implemented
with it.
NAND Implementation
![Page 34: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/34.jpg)
3.7 NAND and NOR Implementation (3-15)
To facilitate the conversion to NAND logic, there are alternative graphic symbol for it.
NAND Implementation
![Page 35: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/35.jpg)
3.7 NAND and NOR Implementation (4-15)
Procedures of Implementation with two levels of NAND gates:
1. Express simplified function in sum of products form.2. Draw a NAND gate for each product term that has
at least two literals to constitute a group of first-level gates
3. Draw a single gate using AND-invert or invert-OR in the second level
4. A term with a single literal requires an inverter in the first level.
NAND ImplementationTwo-Level Implementation
![Page 36: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/36.jpg)
3.7 NAND and NOR Implementation (5-15)
NAND ImplementationTwo-Level Implementation
F = AB + CD
([ =AB + CD’]’)
([ =AB(*’)CD’]’)
![Page 37: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/37.jpg)
3.7 NAND and NOR Implementation (6-15)
NAND ImplementationTwo-Level ImplementationExample (3.10):F(X,Y,Z) = ∑ (1,2,3,4,5,7)
y zx
1
00 01 11 1001 1
1 1
Z
X’Y
1
1
XY’
F = XY’ + X’Y + Z
![Page 38: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/38.jpg)
3.7 NAND and NOR Implementation (7-15)
Procedures of Implementation with multilevel of NAND gates:
1. Convert all AND gates to NAND gates with AND-invert graphic symbols
2. Convert all OR gates to NAND gates with invert-OR graphic symbols
3. Check all the bubbles in the diagrams. For a single bubble, invert aninverter (one-input NAND gate) or complement the input literal
NAND ImplementationMultilevel Implementation
![Page 39: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/39.jpg)
3.7 NAND and NOR Implementation (8-15)
NAND ImplementationMultilevel Implementation
EXAMPLE 1:F = A(CD + B) + BC’
![Page 40: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/40.jpg)
3.7 NAND and NOR Implementation (9-15)
NAND ImplementationMultilevel ImplementationEXAMPLE 2:F = (AB’ + A’B).(C + D’)
![Page 41: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/41.jpg)
3.7 NAND and NOR Implementation (10-15)
The NOR operation is the dual of the NAND operation. The NOR gate is anothar universal gate to
implement any Boolean function.
NOR Implementation
![Page 42: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/42.jpg)
3.7 NAND and NOR Implementation (11-15)
To facilitate the conversion to NOR logic, there are alternative graphic symbol for it.
NOR Implementation
![Page 43: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/43.jpg)
3.7 NAND and NOR Implementation (12-15)
Procedures of Implementation with two levels of NOR gates:
1. Express simplified function in product of sums form.2. Draw a NOR gate for each product term that has at
least two literals to constitute a group of first-level gates
3. Draw a single gate using OR-invert or invert-AND in the second level
4. A term with a single literal requires an inverter in the first level.
NOR Implementation
Two-Level Implementation
![Page 44: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/44.jpg)
3.7 NAND and NOR Implementation (13-15)
NOR ImplementationTwo-Level ImplementationExample :F = (A+B).(C+D).E
E
![Page 45: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/45.jpg)
3.7 NAND and NOR Implementation (14-15)
Procedures of Implementation with multilevel of NOR gates:
1. Convert all OR gates to NOR gates with OR-invert graphic symbols
2. Convert all AND gates to NOR gates with invert-AND graphic symbols
3. Check all the bubbles in the diagrams. For a single bubble, invert aninverter (one-input NAND gate) or complement the input literal
NOR Implementation
Multilevel Implementation
![Page 46: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/46.jpg)
3.7 NAND and NOR Implementation (15-15)
NOR ImplementationMulti-Level ImplementationExample :F = (A B’ + A’B).(C+D’)
A
B’
A’
B
![Page 47: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/47.jpg)
3.8 Other Two-Level Implementations (1-7)
16 possible combinations of two-level forms with 4 types of gates: AND, OR, NAND, and NOR
8 are degenerate forms: degenerate to a single operation.
(AND-AND , AND-NAND, OR-OR , OR-NOR , NAND-NAND , NAND-NOR , NOR-AND , NOR-NAND)
8 are generate forms:
NAND-AND = AND-NOR = AND-OR-INVERT
OR-NAND = NOR-OR = OR-AND-INVERT
Nondegeneratd forms Implementation
![Page 48: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/48.jpg)
3.8 Other Two-Level Implementations (3-7)
Nondegeneraetd forms Implementation
NOR NAND OR AND2nd level
1st level
# NAND (3.4) AND AND
NOR $ OR (3.4) OR
AND (3.6) NAND # NAND
(3.6) OR $ NOR NOR
Discussed beforeGenerated formsDiscuss now
![Page 49: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/49.jpg)
3.8 Other Two-Level Implementations (4-7)
Nondegeneraetd forms ImplementationAND-OR-INVERTo AND-NOR = NAND-AND = AND-OR-INVERTo Similar to AND-OR, AND-OR-INVERT requires an
expression in sum of productsExample: F = (AB + CD + E) ‘
![Page 50: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/50.jpg)
3.8 Other Two-Level Implementations (5-7)
Nondegeneraetd forms ImplementationOR-AND-INVERTo AND-NOR = NAND-AND = AND-OR-INVERTo Similar to OR-AND, OR-AND-INVERT requires an
expression in product of sumsExample: F = [(A+B) . (C+D) . E ] ‘
![Page 51: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/51.jpg)
3.8 Other Two-Level Implementations (6-7)
Nondegeneraetd forms Implementation
To Get an
Output of
Simplify F’ into
Implements the
Function
Equivalent Nondegenerate form
b a
Fsum-of-products form by combining 0’s in the map
AND-OR-INVERT NAND-AND AND-NOR
F
product-of-sums form by combining 1’s in the map and then complementing
OR-AND-INVERT NOR-OR OR-NAND
![Page 52: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/52.jpg)
3.8 Other Two-Level Implementations (7-7)
Nondegeneraetd forms ImplementationExample (3.11) :F(x,y,z) = ∑ (0,7)
AND-OR-INVERT:F’ = x’y + xy’ + zF = ( x’y + xy’ + z ) ‘-----------------------------OR-AND-INVERT:F = x’y’z’ + xyz’F = [ (x’y’z’ + xyz’)’ ] ‘F = [ (x+y+z) . (x’+y’+z) ] ‘
![Page 53: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/53.jpg)
3.9 Exclusive-OR Function (1-7)
Exclusive-OR (XOR) denoted by the symbol : x y = xy‘ + x‘y Exclusive-OR is equal to 1, when the values of x and y are
diffrent. Exclusive-NOR (XNOR): (x y )‘ = xy + x‘y‘ Exclusive-NOR is equal to 1, when the values of x and y
are same.
Only a limited number of Boolean functions can be expressed in terms of XOR operations, but it is particularly useful in arithmetic operations and error-detection and correction circuits.
![Page 54: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/54.jpg)
3.9 Exclusive-OR Function (2-7)
Exclusive-OR principles: x 0 = x x 1 = x‘ x x = 0 x x‘ = 1 x y‘ = x‘ y = (x y)‘ x y = y x (x y) z = x (y z)
![Page 55: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/55.jpg)
3.9 Exclusive-OR Function (3-7)
Implementaion Exclusive-OR with AND-OR-NOT:
x y = xy‘ + x‘y Implementaion
Exclusive-OR with NAND: x y = xy‘ + x‘y = x (x‘+y‘) + y (x‘+y‘) = x (xy)‘ + y (xy)‘ = [ (x(xy)‘ + y(xy)‘)‘]‘ = [ (x(xy)‘)‘ + (y(xy)‘)‘ ]‘
![Page 56: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/56.jpg)
3.9 Exclusive-OR Function (4-7)
The 3-variable XOR function is equal to 1 if only one variable is equal to 1 or if all three variables are equal to 1.
Multiple-variable exclusive OR operation = odd function : odd number of variables be equal to 1.
(A B C) = (AB‘ + A‘B) C‘ + (A‘B‘ + AB) C = AB‘C‘ + A‘BC‘ + A‘B‘C + ABC = ∑ (1,2,4,7)
Odd Function:
![Page 57: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/57.jpg)
3.9 Exclusive-OR Function (5-7)
Odd Function:
![Page 58: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/58.jpg)
3.9 Exclusive-OR Function (6-7)
Odd Function:A B C D= ∑ (1,2,4,7,8,11,13,14)
![Page 59: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/59.jpg)
3.9 Exclusive-OR Function (7-7)
Exclusive-OR function is useful in systems requiring error-detection and correction circuits.
A parity bit is used for purpose of detection errors during transmission.
Parity bit : an extra bit included with a binary message to make the number of 1’s either odd or even.
The circuit generates the parity bit in transmitter is called parity generator.
The circuit checks the parity bit in receiver is called parity checker.
Parity Generation and Checking:
![Page 60: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/60.jpg)
3.9 Exclusive-OR Function (8-7)
Parity Generation and Checking:Example : Three-bit message with even parityThree-bit Massage Parity
bitX Y Z P0 0 0 00 0 1 10 1 0 10 1 1 01 0 0 11 0 1 01 1 0 01 1 1 1
o From the truth table , P constitutes an odd function.
o It is equal 1 when numerical value of 1’s in a minterm is odd
o P = x y z
![Page 61: CS 121 Digital Logic Design](https://reader036.vdocument.in/reader036/viewer/2022062410/56815e17550346895dcc753c/html5/thumbnails/61.jpg)
3.9 Exclusive-OR Function (8-7)
Parity Generation and Checking:Example : Three-bit message with even parity
o From the truth table , C constitutes an odd function.
o It is equal 1 when numerical value of 1’s in a minterm is odd
o C = x y z P