High-Performance Left-to-Right Array Multiplier Design

We propose a split array multiplier organized in a left-to-right leapfrog (LRLF) structure with reduced delay compared to conventional array multipliers. Moreover, the proposed design shows equivalent performance as tree multipliers for n ≤ 32. An efficient radix-4 recoding logic generates the partial products in a left-to-right order. The partial products are split into upper and lower groups. Each group is reduced using [3:2] adders with optimized signal flows and the carry-save results from two groups are combined using a [4:2] adder. The final product is obtained with a prefix adder optimized to match the non-uniform arrival profile of the inputs. Layout experiments indicate that upper/lower split multipliers have slightly less area and power than optimized tree multipliers while keeping the same delay for n ≤ 32.

• Type: Conference
• Year: 2003
• Where: ARITH
• Authors: Zhijun Huang, Milos D. Ercegovac
• Keywords: Applied Computing, ARITH 2003, Array Multipliers, Conventional Array Multipliers, Tree Multipliers