Brian Schoner

A new architecture for area-efficient multiplication by a class of rational coefficients

In this paper we describe a new architecture for the area-efficient realization of a class of fixed-coefficient multipliers, using a recursive algorithm and redundant arithmetic. Difficult coefficients that gain little or no benefit from canonic signed-digit (CSD) or other signed power-of-two (SPT) representations, such as the factor one-third, can be efficiently implemented with a single carry-save addition stage.