Resource and context based multiplier generation

A method of optimizing resource allocation in an integrated circuit (IC) to minimize resources needed to create multipliers, the method comprising:

• determining the number of look up tables (LUTs) needed to implement each of the multipliers;
• allocating a multiplexer carry as a first primitive to first ones of the multipliers where the number of LUTs needed to implement the multipliers is greater than a predetermined number;
• and
• allocating LUTs as second primitive to remaining ones of the multipliers apart from the first multipliers.

A method of implementing a multiplier using first primitives and second primitives to implement the multiplier in an integrated circuit (IC), the method comprising:

• creating a partial product matrix from two inputs of the multiplier;
• shifting matrix column entries in the partial product matrix for the given multiplier so that ones of the entries with values of zero are shifted to top rows of the columns;
• transposing entries in adjacent ones of the rows within the same ones of the columns of the partial product matrix to place common entries on a same one of the rows of the matrix;
• determining a size of support needed for each of the rows of the partial product matrix using the shifted and transposed entries;
• constructing an adder tree from the rows of the partial product matrix to complete a multiplication operation for the multiplier;
• determining totals of the support sizes for stages of the adder tree;
• and
• allocating first primitives for one of the adder tree stages if the total size of supports for any two of the rows forming one of the adder tree stages is less than or equal to a given threshold and allocating second primitives if the total size of supports for one of the adder tree stages is greater than the given threshold.