A Comparative Study of subword parallel adders for multimedia applications

Subword parallelism can efficiently improve the performance of multimedia applications. Two different control mechanisms, carry truncation and carry elimination, for subword parallel adder design are proposed in this paper. The carry truncation mechanism achieves subword partition by inserting killing logics into the carry propagation chain, while the carry elimination one employs control logics on the subword boundary bit positions. Based on these two mechanisms, we implement several representative adder algorithms. The experimental results show that, for all the adder algorithms, the proposed carry elimination mechanism counts averagely 8% less delay than the carry truncation one. However, except for the Kogge-Stone and Brent-Kung adders, the carry elimination mechanism requires more gates and higher power consumption than the carry truncation one. This paper also compares the performance of different adder algorithms1.

[1]  Uri C. Weiser,et al.  MMX technology extension to the Intel architecture , 1996, IEEE Micro.

[2]  Vojin G. Oklobdzija,et al.  Multiplexer based adder for media signal processing , 1999, 1999 International Symposium on VLSI Technology, Systems, and Applications. Proceedings of Technical Papers. (Cat. No.99TH8453).

[3]  Robert Rose,et al.  Segmented Arithmetic Operators for Graphics Processing , 2003 .

[4]  Charles Roth,et al.  A low-power, high-speed implementation of a PowerPC/sup TM/ microprocessor vector extension , 1999, Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336).

[5]  Neil Burgess.  Packed arithmetic on a prefix adder (PAPA) , 2002, SPIE Optics + Photonics.

[6]  K. Suzuki,et al.  A 2000-MOPS embedded RISC processor with a Rambus DRAM controller , 1999 .

[7]  Reto Zimmermann,et al.  Binary adder architectures for cell-based VLSI and their synthesis , 1997 .