Redundant Representations of Numbers

• Normal way of thinking of arithmetic circuit design: "Given a set of binary numbers in 1's complement, 2's complement, etc., find the fastest/smallest circuit that implements the arithmetic functions."

• Another way of asking the questions: "Given that we want the faster/smallest arithmetic circuits, how should the binary numbers be represented?"

  • Should we use log2(N) bits to represent N numbers?

Previous slide

Back to first slide

View graphic version