Implement the Given Function in the

Eight Non-Degenerate Forms

F(W,X,Y,Z)=∑(0,1,2,3,4,8,9,12)

Arshad Nazir 1
 F= ∑(0,1,2,3,4,8,9,12)

YZ
00 01 11 10
WX
00 1 1 1 1
01 1 0 0 0
11 1 0 0 0
10 1 1 0 0

SOP Form: F=WX+XY+YZ

2
1. AND-OR Implementation
F=WX+XY+YZ

W WX
X

X XY
WX+XY+YZ
Y

Y YZ
Z

3
2. NAND-NAND Implementation
F=[WX+XY+YZ] = [(WX) (XY) (YZ)]
F= F =[(WX) (XY) (YZ)]
W (WX)
X

X (XY)
WX+XY+YZ
Y

Y (YZ)
Z

4
3. OR-NAND Implementation
F=WX+XY+YZ F=(W+X)+(X+Y)+(Y+Z)
F=[(W+X) (X+Y) (Y+Z)]
W (W+X)
X

X (X+Y)
WX+XY+YZ
Y

Y (Y+Z)
Z

5
4. NOR-OR Implementation
F=WX+XY+YZ F=(W+X)+(X+Y)+(Y+Z)

W (W+X)
X

X (X+Y)
WX+XY+YZ
Y

Y (Y+Z)
Z

6
 F= ∑(0,1,2,3,4,8,9,12)

YZ
00 01 11 10
WX
00 1 1 1 1
01 1 0 0 0
11 1 0 0 0
10 1 1 0 0

POS Form: F=(W+Y).(X+Y).(X+Z)

7
5. OR-AND Implementation
F=(W+Y).(X+Y).(X+Z)

W (W+Y )
Y

X (X+Y) (W+Y).(X+Y).(X+Z)
Y

X (X +Z)
Z

8
6. NOR-NOR Implementation
F=[(W+Y) (X+Y) (X+Z)]
F=[(W+Y)+(X+Y)+(X+Z)]
W (W+Y)
Y

(X+Y) [(W+Y)+(X+Y)+(X+Z)]
X
Y

X (X+Z)
Z

9
 7. NAND-AND Implementation
F=[(W+Y) (X+Y) (X+Z)] = [(WY) (XY) (XZ)]

W (WY)
Y

X (XY) [(W+Y) (X+Y) (X+Z)]

Y

X (XZ)
Z

10
 F= ∑(0,1,2,3,4,8,9,12)

YZ
00 01 11 10
WX
00 1 1 1 1
01 1 0 0 0
11 1 0 0 0
10 1 1 0 0

SOP Form: F=WY+XY+XZ

11
8. AND-NOR Implementation
F=WY+XY+XZ F=(WY+XY+XZ)

W WY
Y

X XY
(WY+XY+XZ)
Y

X XZ
Z

Digital Logic Design 12