loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
16th IEEE Symposium on Computer Arithmetic (ARITH-16 '03)
High-Performance Left-to-Right Array Multiplier Design
Santiago de Compostela, Spain
June 15-June 18
ISBN: 0-7695-1894-X
Zhijun Huang, University of California at Los Angeles
Miloš D. Ercegovac, University of California at Los Angeles
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.
Citation:
Zhijun Huang, Miloš D. Ercegovac, "High-Performance Left-to-Right Array Multiplier Design," arith, pp.4, 16th IEEE Symposium on Computer Arithmetic (ARITH-16 '03), 2003
Usage of this product signifies your acceptance of the Terms of Use.