Waleed arshad

WALEED ARSHAD
 TWO VARIABLE K-MAP

y
y
x 0 1

0 x’y’ x’y
m0 m1
1 xy’ xy
x
m2 m3

(a) (b)

y y

y y
0 1 x 0 1
x
1
0 0

1 1 1 1
x 1 x

(a) xy (b) x+y

 THREE VARIABLE MAP
y
yz

x 00 01 11 10
m0 m1 m3 m2

0 x’y’z’ x’y’z x’yz x’yz’

m4 m5 m7 m6
1 xy’z’ xy’z xyz xyz’
x

yz y
00 01 11 10 MAP FOR
0
1 1 F=x’yz+x’yz’+xy’z’+xy’z
F=x’y+xy’
1 1 1

z
 Reflected Code
Binary Code Reflected Code
0000 0000
0001 0001
0010 0011
0011 0010
0100 0110
0101 0111
0110 0101
0111 0100
1000 1100
1001 1101
1010 1111
1011 1110
1100 1010
1101 1011
1110 1001
1111 1000
 yz y BC BC B

00 01 11 10 00 01 11 10
x A
0 1 0 1
1 1
1 A 1 1
1 1 1 1

z
C
MAP FO R : x’yz+xy’z’+xyz+xyz’=yz+xz’
MAP FOR : A’C+A’B+AB’C+BC=C+A’B

yz y

00 01 11 10
x
0
1 1
x 1 1 1 1

F(x,y,z)=Σ(0,2,4,5,6)=z’+xy’
 m0 m1 m3 m2 FOUR VARIBALE MAP
m4 m5 m7 m6

m12 m13 m15 m14

m8
m8 m9 m11 m10
y
(a)
yz
wx 00 01 11 10

00 w’x’y’z’ w’x’y’z w’x’yz w’x’yz’

01 w’xy’z’ w’xy’z w’xyz w’xyz’

x

11 wxy’z’ wxy’z wxyz wxyz’

w

10 wx’y’z’ wx’y’z wx’yz wx’yz’

1 square represents a term of 4 literals.

2 adjacent squares represent a term of 3 literals.
4 adjacent squares represent a term of 2 literals.
8 adjacent squares represent a term of 1 literal.
16 adjacent squares represent the function equal to 1
 y
yz
00 01 11 10
wx
1
00 1
1

01 1 1 1

x
11 1 1 1

w
1 1
10

MAP FOR : F(w,x,y,z)=Σ(0,1,2,4,5,6,8,9,12,13,14)=y’+w’z’+xz’

z

C
CD
00 01 11 10
AB
00 1 1 1

01 1
B
11
A

10 1 1 1

MAP FOR : A’B’C’+B’CD’+A’BCD’+AB’C’=B’D’+B’C’+A’CD’

 C

CDE
AB 000 001 011 010 110 111 101 100

0 1 3 2 6 7 5 4
00

8 9 11 10 14 15 13 12
01

11 24 25 27 26 30 31 29 28
==

A
10 16 17 19 18 22 23 21 20

D
E
E

FIVE -VARIABLE MAP

 DEF D

ABC 000 001 011 010 110 111 101 100

000 0 1 3 2 6 7 5 4

8 9 11 10 14 15 13 12
001
C
31
011 24 25 27 26 30 29 28

010 16 17 19 18 22 23 21 20
B
48 49 51 50 54 55 53 52
110

111 56 57 59 58 62 63 61 60

A C

101 40 41 43 42 46 47 45 44

100 32 33 35 34 38 39 37 36

F E F
SIX VARIABLE MAP
No of adjacent squares & literals in a term
2k adjacent squares=n-k literals
n-variable map
k 2k n=2 n=3 n=4 n=5 n=6 n=7
0 1 2 3 4 5 6 7
1 2 1 2 3 4 5 6
0 4 0 1 2 3 4 5
3 8 0 1 2 3 4
4 16 0 1 2 3
5 32 0 1 2
6 64 0 1
7 128 0
 F(A,B,C,D,E)=Σ
(0,2,4,6,9,11,13,15,17,21,25,27,29,31) C
CDE
000 001 011 010 110 111 101 100
AB
00
1 1
1 1

01
1 1 1 1 B

11 1 1 1 1
A

10
1 1

E D E
F=BE+AD’E+A’B’E’
 Example
F(A , B, C, D) =∑(0,1,2,5,8,9,10)
(ii) Simplify it in:
(iii) Sum of products
(iv) Product of sums
CD C
00 01 11 10
AB
00
1 1 0 1
0 1 0 0
01
B
0 0 0 0
11
A
10 1 1 0 1

(i) Sum of products

D
F=B’D’+B’C’+A’C’D
F’ =AB+CD+BD’
(ii) F=(A’+B’)(C’+D’)(B’+D)
B’ A’
D’ B’

C’ F
C’ F D’

A’
D D

F=B’D’+B’C’+A’C’D F=(A’+B’)(C’+D’)(B’+D)
GATE IMPLEMENTATION
X Y Z F
0 0 0 0
0 0 1 1
TRUTH TABLE OF
0 1 0 0
FUNCTION F
0 1 1 1
F(x,y,z)= Σ(1,3,4,6)
1 0 0 1
7 0 1 0
1 1 0 1
1 1 1 0

F(x,y,z)= Σ(1,3,4,6)
F(x,y,z) = ∏ (0,2,5,7)
 y

x yz 00 01 11 10

0 1 1 0
0

1
1 0 0 1
x

z
Sum of products
F=x’z+xz’)

Product of sums
F’=xz+x’z’
F=(x’+z’)(x+z)
 NAND and NOR implementation

x
y F=(xyz)’
z
AND invert

F=(x’+y’+z’)=(xyz)’

Invert-OR
(a) TWO GRAPHIC SYMBOLS FOR NAND GATE
x
y
z F=(x+y+z)’
OR-invert
x
y
z F=x’y’z’=(x+y+z)’

Invert-AND
(b) TWO GRAPHIC SYMBOLS FOR NOR GATE
 x x’ x x’

Buffer-invert AND-invert

x x’

OR-invert

THREE GRAPHIC SYMBOLS FOR INVERTOR

NAND Implementation
THREE WAYS TO IMPLEMENT
F=AB+CD+E
A
B Simplified Boolean
function
C
F F=AB+CD+E
D
E

(a)

A
B
Convert AND gates
C with at least two
F
D literals to NAND
E’ gates at first level.

(b)
A
B Draw a single NAND
gate at level-2
C F &
D
F={(AB)’.(CD)’.E’} NAND gate for a
term with single
E F=AB+CD+D
literal

(c)
 yz y
00 01 11 10
x F(x,y,z)= Σ(0,6)
0 1 0 0 0 F=x’y’z’+xyz’
F’=x’y+xy’+z
1 0 0 0 1

z
(a) MAP SIMPLIFICATION IN SUM OF PRODUCTS

x’
y’
z’
F
Two-level implementation
x
y
z’

(b) F=x’y’z’+xyz’
X’
F
y

x F’
Y’
Three level implementation
z

(c) F’=x’y+xy’+z

IMPLEMENTATION OF THE FUNCTION WITH NAND GATES

F(x,y,z) = Σ(0,6)
NOR Implementation THREE WAYS TO IMPLEMENT
F=(A+B)(C+D)E
A (A+B)
Simplified
B
Boolean function
(C+D)
C F F=(A+B)(C+D)E
D
E

(a )

A
Convert OR gates
B
with at least two
inputs to NOR
C F gates at first level
D
E’
(b )
A
B
Draw a single
C NOR gate at level
2 & a NOR gate
D
for a term with
single literal.
E

(C)
 Example
F = x’y’z’ + xyz’
F(n, y, z) = {(0, 6)
F’ = x’y + xy’ + z
x
y’

x’
y F

z’ (a) F = (x + y’) (x’ + y)z’

x
y F
z
F’
x’

y’
(b) F’ = (x + y + z) (x’ + y’ + z)
z

IMPLEMENTATION WITH NOR GATES

 y
YZ
wx 00 01 11 10
00
X 1 1 X

01 0 X 1 0
x
11
0 0 1 0
w F(w,x,y,z)=
10 0 0 1 0 Σ(1,3,7,11,15)
D(w,n,y,z)=Σ(0,2,5)

F=w’z+yz
z
or
Combing 1’s and X’s
F=w’x’+yz
 y
YZ
wx 00 01 11 10
00
X 1 1 X

01 0 X 1 0
x
11
0 0 1 0
w
10 0 0 1 0

F’=z’+wy’
Combing 0’s and X’s z
F=z(w’+y)

EXAMPLES WITH DON’T CARE CONDITION

 DETERMINE THE PRIME-IMPLICANTS OF THE FUNCTION
F(w,x,y,z)=∑(1,4,6,7,8,9,10,11,15)
(a) (b) (c)

0001 1 1, 9 (8)* 8, 9, 10, 11, (1,2)*

0100 4 4, 6 (2)* 8, 9, 10, 11, (1,2)*
1000 8 8, 9 (1)
0110 6 8, 10 (2)
2 1 9
6, 7 (1)*
1010 10
9, 11 (2)

0111 7 10,11 (1)

2 11 11 7, 15 (8)*
11,15 (4)*
1111 15
 PRIME-IMPLICANTS
Decimal Binary Term
w x y z

1,9 (8) - 0 0 1 X’ y’ z

4,6 (2) 0 1 - 0 W’ x z’

6,7 (1) 0 1 1 - w’ x y

7,15 (8) - 1 1 1 Xyz

11,15 (4) 1 - 1 1 wyz

8,9,10,11 (1,2) 1 0 - - W x’

F=x’y’z+w’xz’+w’xy+xyz+wyz+wx’
 (i) Selection of

PRIME-IMPLICANTS

1 4 6 7 8 9 10 11 15
x’y’z 1,9 X X
w’xz’ 4,6 X X
w’xy 6,7 X X
xyz 7,15 X X
wyz 11,15 X X
wx’ 8,9,10,11 X X X X

F=x’y’z+w’xz’+wx’+xyz
Essential Prime-implicants
 y
YZ
wx 00 01 11 10
00
1

01 1 1 1
x
11
1
w
10 1 1 1 1

z
F(w,x,y,z)=∑(1,4,6,7,8,9,10,11,15)
MAP FOR THE FUNCTION OF
F = x’y’z+w’xz’+xyz+wx’
 THE TABULATION METHOD (Q-M Mehthod)
Example:

F(w,x,y,z) = ∑(0,1,2,8,10, 11,14,15)

(i) DETERMINATION OF PRIME-IMPLICANTS
(a) (b) (c)
wxyz wxyz wxyz
0 0000√ 0,1 000-* 0,2,8,10 -0-0*
0,2 00-0√ 0,8,2,10 -0-0*
1 0001√ 0,8 -000√ 10,11,14,15 1-1-*
2 0010√ 10,11,14,15 1-1-*
8 1000 √ 2,10 -010√ Prime-implicants
8,10 10-0√ F=w’x’y’+x’z’+wy
10 1010√
10,11 101-√
11 1011√ 10,14 1-10√
14 1110√
11,15 1-11√
15 11111√ 14,15 111-√
 (i) Selection of

PRIME-IMPLICANTS

0 1 2 8 10 11 14 15
w’x’y’ 0,1 X X
x;z’ 0,2,8,10 X X X X
wy 10,11,14,15 X X X X

Essential Prime-implicants : F=w’x’y’+x’z’+wy

 Y
yz

00 01 11 10
wx
00 1 1 1

01
X
11 1 1
W
10
1 1 1

F= w’x’y’ + x’z’+wy

MAP FOR THE FUNCTION

 RULES FOR NAND and NOR IMPLEMENTATION

Function Standrad How to Implement Number

Case to From to drive with of Levels
Simplify Use to F

Sum of Combine 1,s

(a) F Products in map NAND 2
(b) F Sum of
Products
Combine 0, s
In map
NAND 3
(c) F Product Complement NOR 2
of Sums F in (b)
(d) F Product Complement NOR 3
of Sums F in (a)
 A
B

F
C F = (A B)’ . (C D)’
D
F = (AB + CD)’
(a) Wired – AND in open Collector TTL NAND
gates
A
B
F

C
F = (A + B)’ + (C + D)’
D

F = [(A + B ) ( C + D)]’

(b) Wired – OR in ECL gates

(AND – OR - INVERT) OR – AND - INVERT
WIRED LOGIC
A A
B B

C
F C
D F
D

E E
(a) AND - NOR (b) AND - NOR
A
B
C
F
D

E
(c) NAND - AND
AND – OR – INVERT CIRCUITS F = (AB + CD + E)’
(Non degenerate form)

AND - - NOR & NAND – AND are equivalent forms

 NONDEGENERATE FORMS
COMMON GATE : AND, OR, NAND, NOR
IF AT LEVEL 1 : ONE TYPE OF GATE
AT LEVEL 2 : ONE TYPE OF GATE

* POSSIBLE COMBINATIONS = 16
8 OF THESE COMBINATIONS ARE SAID TO BE DEGENERATE FORMS
BECAUSE THEY DEGENERATE TO A SINGLE OPERATION.
FOR EXAMPLE :
NAND – OR AND – AND OPERATION
NAND – NOR OR – OR OPERATION
NOR – AND AND – NAND OPERATION
NOR – NAND OR – NOR OPERATION
8 OF THESE COMBINATION S ARE SAID TO BE NON – DEGENERATE
FORMS BECAUSE THEY PRODUCE AN IMPLEMENTATION IN SUM OF PRODUCTS OR
PRODUCT OF SUMS.
FOR EXAMPLE :
AND – OR OR – AND
NAND – NAND NOR – NOR
NOR – OR NAND – AND
OR – NAND AND - NOR
A
B

C
D F

E
(a) OR - NAND

A
B

C
D F

E
(b) OR - NAND

CONTED
 A
B

C
D F

(C) NOR - OR

OR – AND – INVERT F = [(A + B ) (C + D ) E]’

(Non – degenerate form)

OR – NAND & NOR – OR ARE EQUIVALENT FORMS

 Example
X’ X’
y y
X X
F F
y’ y’

z z

AND - NOR NAND - AND

F = x’ y + x y’ + z
(a) F = (x’ y + x y’ + z)’
00 01 11 10
0 1 0 0 0
1 0 0 0 1
F’ = x’ y + x y’ + z
F = x’ y z’ + x y z’
x x
y y
z z
F F
x’ x’
y’ y’
z z

OR - NAND NAND - OR

F = x’ y’ z’ + x y z’
F = (x + y + z) (x’ + y’ +z)
(b) F = [(x + y + z) (x’ + y’ + z)]’

TWO – LEVEL IMPLEMENTATION