Parity (XOR) Functions

Count the number of 1’s in the inputs and

produce a 1 if odd

A B

P2

0 1

1 0

1

1

A B C

P3

0 0 1

0 1 0

1 0 0

1 1 1

1

1

1

1

Smallest AND-OR circuit for Pn will contain

2n-1 AND gates

Similar increase for adders, subtractors,

multipliers, and most arithmetic functions

Previous slide

Next slide

Back to first slide

View graphic version