子字并行加法器的研究与实现  

Research and implementation of subword-parallel adder

作　　者：马胜[1] 黄立波[1] 王志英[1] 刘聪[1] 戴葵[1] 

机构地区：[1]国防科技大学计算机学院,长沙410073

出　　处：《计算机工程与应用》2009年第36期54-59,共6页Computer Engineering and Applications

基　　金：国家自然科学基金 No.60773024;No.60873015;国防科技大学优秀研究生创新资助No.S070606~~

摘　　要：子字并行加法器能够有效提高多媒体应用程序的处理性能。基于门延迟模型对加法器原理及性能进行了分析,设计了进位截断和进位消除两种子字并行控制机制。在这两种机制的指导下,实现了多种子字并行加法器,并对它们的性能进行了比较和分析。结果表明进位消除机制相对于进位截断机制需要较短的延时,较少的逻辑门数以及较低的功耗。在各种子字并行加法器中,Kogge-Stone加法器具有最少的延迟时间,RCA加法器具有最少的逻辑门数和最低的功耗。研究结果可以用于指导子字并行加法器的设计与选择。Subword-parallel adder can efficiently improve the performance of multimedia application.Based on the gate-delay model,this paper analyzes the design and performance of those scalar adders and presents two control mechanisms for subwordparallel：Carry truncation and carry elimination.Under the guidance of those two mechanisms,this paper implements several different subword-parallel adders and analyzes their performances.The results show that the carry elimination mechanism has shorter delay,fewer gates and lower power consumption than carry truncation mechanism.Among those subword-parallel adders,Kogge-Stone adder has the shortest delay and ripple carry adder has the fewest gates and lowest power.The research results presented in this paper can be used to guide the design and selection of subword-parallel adders.

关 键 词：子字并行 加法器 进位截断 进位消除 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]