loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fifth International Conference on High Performance Computing
More on Arbitrary Boundary Packed Arithmetic
Madras, India
December 17-December 20
ISBN: 0-8186-9194-8
P S Karthikeyan, Indian Institute of Technology
P S Ranganathan, Sri Venkateswara College of Engineering
Recent microprocessors have been enhanced with media instruction sets for accelerating media algorithms. They exploit the fact that media algorithms have small data types, and widths much less than that of the processor. Current media instruction sets support only 8-, 16- and 32-bit sub-datatypes. This scheme is ineffecient in several applications where bit lengths of 9, 12 and so on are used. We need user programmable sub-datatype bit lengths. [Arbitary Precision Arithmetic -- SIMD Style, S. Balakrishnan and S.K. Nandy, VLSI98] discusses arbitrary boundary packed addition.Many media algorithms are based on multiply-accumulate algorithms. For full acceleration we also need arbitrary boundary packed multiplication. We present such a scheme based on Wallace tree multiplication. We also expand on [Arbitary Precision Arithmetic -- SIMD Style, S. Balakrishnan and S.K. Nandy, VLSI98] and provide a detailed treatment of the intermediate carries of sub-datatypes which were lost in the previous work. These carries could be used for saturation arithmetic and flow control.
Citation:
P S Karthikeyan, P S Ranganathan, "More on Arbitrary Boundary Packed Arithmetic," hipc, pp.19, Fifth International Conference on High Performance Computing, 1998
Usage of this product signifies your acceptance of the Terms of Use.