Decomposition (decomp)

a

b

c

d

e

w

x

y

z

p = ce + de

v = jd + ae’

s = r + b’

t = ac + ad + bc + bd + e

u = q’c + qc’ + qc

q = a + b

r = p + a’

j = a’ + b + c’

• Break a complex node into simpler ones (too complex for a single gate, create opportunities for sharing sub-expressions)

Previous slide

Next slide

Back to first slide

View graphic version