Logic minimization using Boolean cubes

• Uniting theorem = finding reduced-dimensionality subcubes

• Example: Binary full-adder carry-out logic

  • The on-set is covered by the OR of three 2-D subcubes

A B Cin Cout

0 0 0 0

0 0 1 0

0 1 0 0

0 1 1 1

1 0 0 0

1 0 1 1

1 1 0 1

1 1 1 1

111

A

B

Cin

000

101

(A'+A)BCin

AB(Cin'+Cin)

A(B+B')Cin

Cout = BCin+AB+ACin

Previous slide

Next slide

Back to first slide

View graphic version