Elimination

a

b

c

d

e

w

x

y

z

p = ce + de

v = a’d + bd + c’d + ae’

s = p + a’ + b’

t = ac + ad + bc + bd + e

u = q’c + qc’ + qc

q = a + b

• Removing a node (too simple a function, better to absorb into other gates)

Previous slide

Next slide

Back to first slide

View graphic version