PPT Slide

2 – Combinational Logic

© 1996 Gaetano Borriello

Three-variable example

• Binary full-adder carry-out logic

40

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'+A)BCin

AB(Cin'+Cin)

A(B+B')Cin

Cout = BCin+AB+ACin

The on-set is completely covered by the combination (OR) of the subcubes of lower dimensionality

Previous slide

Next slide

Back to first slide

View graphic version