A novel class of serial-parallel redundant signed-digit multipliers

Digit-serial multiplier structures (operating most significant digit first with a redundant radix 2 representation) are introduced. They achieve optimal performance with regard to the latency-throughput tradeoff. Their hardware complexity is shown to be lower than classical multipliers operating least significant bit first. A general derivation shows them to be the only canonical structures having these properties