DocumentCode :
2617832
Title :
Partial Product Reduction for Parallel Cubing
Author :
Stine, James E. ; Blank, Jeff M.
Author_Institution :
Dept. of Electr. & Comput. Eng., Oklahoma State Univ., Stillwater, OK
fYear :
2007
fDate :
9-11 March 2007
Firstpage :
337
Lastpage :
342
Abstract :
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 mum technology
Keywords :
digital arithmetic; logic design; 0.6 micron; AMI C5N technology; counters; cubing circuits; operand cube computing; parallel cubing; partial product reduction; Ambient intelligence; Concurrent computing; Counting circuits; Cryptography; Delay; Function approximation; Hardware; Parallel processing; Signal processing; Table lookup;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
VLSI, 2007. ISVLSI '07. IEEE Computer Society Annual Symposium on
Conference_Location :
Porto Alegre
Print_ISBN :
0-7695-2896-1
Type :
conf
DOI :
10.1109/ISVLSI.2007.78
Filename :
4208937
Link To Document :
بازگشت