High-Performance Left-to-Right Array Multiplier Design

  • Authors:
  • Zhijun Huang;Milo" D. Ercegovac

  • Affiliations:
  • -;-

  • Venue:
  • ARITH '03 Proceedings of the 16th IEEE Symposium on Computer Arithmetic (ARITH-16'03)
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 intoupper 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 andpower than optimized tree multipliers while keeping the same delay for n 驴 32.