Logic and Sequential Circuit

Design
(EC 201)

TWO VARIABLE K-MAP

y
1

xy

xy

xy

m0

m1

m2

m3

xy
(b)

(a)

y
x

1
1

1
(a) xy

(b) x+y

THREE VARIABLE MAP

y
yz
m0

m1

m4

m3

m5

m7

00

01

xyz

xyz

xyz

xyz

m2

m6
x

11
xyz

xyz

z
y

yz
00

01

11

0
1

1
1

10

MAP FOR

F=xyz+xyz+xyz+xyz
F=xy+xy

1
z

10
xyz

xyz

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
00

y
01

11

0
1

BC
10

00

01

1
1

BC

MAP FOR : AC+AB+ABC+BC=C+AB

yz

MAP FO R : xyz+xyz+xyz+xyz=yz+xz

11

00

01

11

1
1

10

1
1

F(x,y,z)=(0,2,4,5,6)=z+xy

10
1

m0

m1

m4

m3

m5

m12
m8
m8

m7

m13
m9

FOUR VARIBALE MAP

m2
m6

m15

m14

m11

m10
y

yz
00

wx

(a)
01

11

00

wxyz

wxyz

01

wxyz

wxyz

wxyz

wxyz

11

wxyz

wxyz

wxyz

wxyz

10

wxyz

wxyz

wxyz

wxyz

wxyz

z
1
2
4
8
16

10

square represents a term of 4 literals.

adjacent squares represent a term of 3 literals.
adjacent squares represent a term of 2 literals.
adjacent squares represent a term of 1 literal.
adjacent squares represent the function equal to 1

wxyz

yz
wx
00

00

01

01

11

w
10

11

CD

00

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

AB

10

00

01

11

10
1
1

01

B
A

11
10

MAP FOR : ABC+BCD+ABCD+ABC=BD+BC+ACD

AB
00

01

CDE
000
0

001

011

11

10

010

110

111

101

100

14

15

13

12
B

11

24

25

27

26

10

16

17

19

18

30

31
==

29

28

22

23

21

D
E

FIVE -VARIABLE MAP

20

DEF
ABC

000

001

011

010

11

10

000

001

011

24

25

27

26

010

16

17

19

18

111

101

14

15

13

12

110

30
22

31

29

23

21

100

28
20
B

110
111

48

56

49

51

57

59

50
58

54

55

62

63

53
61

52
60
C

A
101

40

100

32

41

43

33

35

F
SIX VARIABLE MAP

42
34

46

47

38

39

45
37

44
36

No of adjacent squares & literals in a term

2k adjacent squares=n-k literals
n-variable map
k
0
1
2
3
4
5
6
7

2k
1
2
4
8
16
32
64
128

n=2
2
1
0

n=3
3
2
1
0

n=4
4
3
2
1
0

n=5
5
4
3
2
1
0

n=6
6
5
4
3
2
1
0

n=7
7
6
5
4
3
2
1
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
01

11

1
1

1
1

1
1
1

1
1

A
10

D
F=BE+ADE+ABE

Example
F(A , B, C, D) =(0,1,2,5,8,9,10)
(i) Simplify it in:
(ii) Sum of products
(iii) Product of sums
CD
00

AB
00
01
11
A

10

1
0

C
01

11

1
1

0
0

10

1
0

(i) Sum of products

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

C
F D

A
D

F=BD+BC+ACD

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

GATE IMPLEMENTATION
X Y

0 0

0 0

0 1

0 1

1 0

1 0

1 1

1 1

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

TRUTH TABLE OF
FUNCTION F
F(x,y,z)= (1,3,4,6)

y
x

yz

11

10

00

01

Sum of products
F=xz+xz)

Product of sums
F=xz+xz
F=(x+z)(x+z)

wx
00

01
11

YZ
00

01

11

10

0
x

0
F(w,x,y,z)=

w
10

(1,3,7,11,15)
D(w,x,y,z)=(0,2,5)

z
Combing 1s and Xs

F=wz+yz
or
F=wx+yz

wx
00

01

YZ
00

01

11

10

0
x

11

10

Combing 0s and Xs

EXAMPLES WITH DONT CARE CONDITION

F=z+wy
F=z(w+y)

NAND and NOR implementation

x
y
z

F=(xyz)
AND invert

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

F=(x+y+z)
OR-invert
F=xyz=(x+y+z)
Invert-AND
(b) TWO GRAPHIC SYMBOLS FOR NOR GATE

Buffer-invert

x
AND-invert

x
OR-invert

THREE GRAPHIC SYMBOLS FOR INVERTOR

NAND Implementation
THREE WAYS TO IMPLEMENT
F=AB+CD+E
A
B

Simplified Boolean
function

C
D

F=AB+CD+E

E
(a)
A
B
C

D
E
(b)

Convert AND gates

with at least two
literals to NAND
gates at first level.

A
B

Draw a single NAND

gate at level-2

C
D

F
F={(AB).(CD).E}

F=AB+CD+E
(c)

&
NAND gate for a
term with single
literal

yz
00

y
01

11

10

F(x,y,z)= (0,6)
F=xyz+xyz
F=xy+xy+z

z
(a) MAP SIMPLIFICATION IN SUM OF PRODUCTS
x
y
z
F
Two-level implementation
x
y
z
(b) F=xyz+xyz

y
x
Y

F
Three level implementation

(c) F=xy+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+B)

Simplified
Boolean function

B
(C+D)

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

D
E
(a)
A
B
C

D
E
( b)

Convert OR gates
with at least two
inputs to NOR
gates at first level

A
B

Draw a single
NOR gate at level
2 & a NOR gate
for a term with
single literal.

C
D
E
(C)

Example
F(n, y, z) = {(0, 6)
x

F = xyz + xyz
F = xy + xy + z

y
x
y

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

z
x
y
z

F
F

x
y
z

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

IMPLEMENTATION WITH NOR GATES

RULES FOR NAND and NOR IMPLEMENTATION

Case

Function
to
Simplify

Standrad
From to
Use

How to
drive

Implement
with

Number
of Levels
to F

(a)
(b)
(c)
(d)

F
F
F
F

Sum of
Products
Sum of
Products
Product
of Sums
Product
of Sums

Combine 1,s
in map
Combine 0, s
In map
Complement
F in (b)
Complement
F in (a)

NAND
NAND
NOR
NOR

2
3
2
3

A
B
F
C
D

F = (A B) . (C D)
F = (AB + CD)

(a) Wired AND in open Collector TTL NAND

gates
A
B
F
C
D

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

(b) Wired OR in ECL gates

(AND OR - INVERT)

OR AND - INVERT

WIRED LOGIC
A
B

A
B

C
D

E
(a) AND - NOR

C
D
E

(b) AND - NOR

A
B
C
D
E
AND OR INVERT CIRCUITS
(Non degenerate form)

F
(c) NAND - AND
F = (AB + CD + E)

AND - - NOR & NAND AND are equivalent forms

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

ONE TYPE OF GATE

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
E

(a) OR - NAND

A
B
C
D
E

(b) OR - NAND
CONTED

A
B
C
D

(C) NOR - OR

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

(Non degenerate form)
OR NAND & NOR OR ARE EQUIVALENT FORMS

Example
X
y

X
y

y
z

X
y

AND - NOR

NAND - AND

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

00 01 11 10
0
0
0
0 1
1 0

F = x y + x y + z
F = x y z + x y z

x
y
z

x
y
z
F

x
y
z

F
x
y
z

NOR - OR

OR - NAND
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

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, 9

(8)*

8,

9,

10,

11,

(1,2)*

0100

4, 6

(2)*

8,

9,

10,

11,

(1,2)*

1000

8, 9

(1)

0110

8, 10

(2)

1001

6, 7

(1)*

1010

10

9, 11

(2)

0111

10,11

(1)

10 11

11

7, 15

(8)*

11,15

(4)*

1111

15

PRIME-IMPLICANTS
Decimal

Term

1,9 (8)

Binary
w x y z
- 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=xyz+wxz+wxy+xyz+wyz+wx

(ii) Selection of

PRIME-IMPLICANTS
1
xyz

1,9

wxz

4,6

wxy

6,7

xyz

7,15

wyz

11,15

wx

8,9,10,11

10

11

15

X
X

X
X

X
X

X
X
X

F=xyz+wxz+wx+xyz
Essential Prime-implicants

wx

YZ
00

00

01

y
01

11

10

1
1

11

w
10

z
F(w,x,y,z)=(1,4,6,7,8,9,10,11,15)

MAP FOR THE FUNCTION OF

F = xyz+wxz+xyz+wx

THE TABULATION METHOD (Q-M Method)

Example:

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

(i) DETERMINATION OF PRIME-IMPLICANTS
(a)

(b)

wxyz
0 0000
1 0001

wxyz
0,1

000-*

0,2

00-0

0,8

-000

2 0010
8 1000

2,10 -010
8,10 10-0

10 1010
10,11 101-
11 1011

10,14 1-10

14 1110
11,15 1-11
15 11111

(c)

14,15 111-

wxyz
0,2,8,10
0,8,2,10

-0-0*
-0-0*

10,11,14,15 1-1-*
10,11,14,15 1-1-*
Prime-implicants
F=wxy+xz+wy

(ii) Selection of

PRIME-IMPLICANTS
0

1
X

wxy

0,1

x;z

0,2,8,10

wy

10,11,14,15

10

X
X

Essential Prime-implicants : F=wxy+xz+wy

11 14

15

yz
wx

00

00

01
1

11

10

01
11
W
10

F= wxy + xz+wy

MAP FOR THE FUNCTION