Cost-effective multiplication with enhanced adders for multimedia applications

Cost-sensitive consumer multimedia devices based on MPEG and JPEG type algorithms tend to have multiplications by constants, rather than by variables. In this paper we show how slightly enhanced adders may be used to perform these constant multiplications with higher performance than more expensive hardware multipliers, using low-cost preshift-add instructions. We were able to find the shortest instruction sequences for all 8-bit integer constants and nearly shortest sequences for 12-bit constants and 15-bit constants. We have achieved an average instruction length of 3.055 for 8-bit integer case, 4.2643 and 4.2782 for the two 12-bit constant cases and 5.07673 for the 15-bit constant case. Based on our preshifter design, we evaluate the area and delay of a 16-bit preshift-adder and compare it with a 16/spl times/16 multiplier. We show that the simpler preshift-adders achieve a speedup of more than 2X compared to multipliers with similar area cost for typical algorithms like DCT and IDCT.

[1]  T. Enomoto,et al.  A 300-MHz 16-b 0.5-/spl mu/m BiCMOS digital signal processor core LSI , 1994 .

[2]  Ruby B. Lee Accelerating multimedia with enhanced microprocessors , 1995, IEEE Micro.

[3]  Dan Zuras,et al.  Integer multiplication and division on the HP Precision Architecture , 1987, ASPLOS 1987.

[4]  Ruby B. Lee Subword parallelism with MAX-2 , 1996, IEEE Micro.

[5]  Gerry Kane,et al.  PA-RISC 2.0 Architecture , 1995 .

[6]  Y. Arai,et al.  A Fast DCT-SQ Scheme for Images , 1988 .

[7]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[8]  M. Yamashina,et al.  A 300 MHz 16 b BiCMOS video signal processor , 1993, 1993 IEEE International Solid-State Circuits Conference Digest of Technical Papers.

[9]  T. Enomoto,et al.  A 2.4-ns, 16-bit, 0.5-/spl mu/m CMOS arithmetic logic unit for microprogrammable video signal processor LSIs , 1993, Proceedings of IEEE Custom Integrated Circuits Conference - CICC '93.