Use of binary decision diagrams in the modelling and synthesis of binary multipliers

Previous research has proved that the size of binary decision diagrams (BDD) which model the outputs of a binary multiplier grows exponentially with the number of multiplier inputs. This paper presents a method of partitioning the multiplier in a manner which restricts the complexity to the carry bits, which results in BDD's which grow no faster than the square of the number of inputs. These carry functions are themselves interesting, in that their computation amounts to computing subsets of power sets. The concept of largest possible BDD is introduced.