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 sub word 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 sub word boundary bit positions.Based on these two mechanisms, we implement several representative adder algorithms. The experimental results show that,for all the adder algo rithms,the proposed carry elimination mechanism counts averagely 8% less delay than the carry truncation one.How ever,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 algorithms.

作者: MA Sheng HUANG Libo LAI Mingce WANG Zhiying

作者单位: School of Computer,National University of Defense Technology,Hunan,China

会议类型: 国际会议

会议名称: 2009 IEEE 8th International Conference on ASIC(第八届IEEE国际专用集成电路大会)

会议地点: 长沙

会议语种:英文

页码: 179-182

在线出版日期: 2009-10-20（万方平台首次上网日期，不代表论文的发表时间）