loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
IEEE Computer Society Annual Symposium on VLSI (ISVLSI '07)
Partial Product Reduction for Parallel Cubing
Porto Alegre, Brazil
March 09-March 11
ISBN: 0-7695-2896-1
James E. Stine, Oklahoma State University
Jeff M. Blank, Oklahoma State University
A new technique for computing the cube of an operand of any length is proposed, implemented, analyzed, and compared to existing techniques. The new proposed method is faster than previously proposed methods that compute the cube of an operand in parallel with the disadvantage that more counters are utilized to perform partial product reduction. Cubing circuits using the proposed techniques are implemented with several operand lengths and analyzed with regard to area consumption and latency. Results are shown for several designs in AMI C5N 0.6 ?m technology.
Citation:
James E. Stine, Jeff M. Blank, "Partial Product Reduction for Parallel Cubing," isvlsi, pp.337-342, IEEE Computer Society Annual Symposium on VLSI (ISVLSI '07), 2007
Usage of this product signifies your acceptance of the Terms of Use.