首页 | 官方网站   微博 | 高级检索  
     

子字并行加法器的研究与实现
引用本文:马胜,黄立波,王志英,刘聪,戴葵.子字并行加法器的研究与实现[J].计算机工程与应用,2009,45(36):54-59.
作者姓名:马胜  黄立波  王志英  刘聪  戴葵
作者单位:国防科技大学,计算机学院,长沙,410073
基金项目:国家自然科学基金,国防科技大学优秀研究生创新资助 
摘    要:子字并行加法器能够有效提高多媒体应用程序的处理性能。基于门延迟模型对加法器原理及性能进行了分析,设计了进位截断和进位消除两种子字并行控制机制。在这两种机制的指导下,实现了多种子字并行加法器,并对它们的性能进行了比较和分析。结果表明进位消除机制相对于进位截断机制需要较短的延时,较少的逻辑门数以及较低的功耗。在各种子字并行加法器中,Kogge-Stone加法器具有最少的延迟时间,RCA加法器具有最少的逻辑门数和最低的功耗。研究结果可以用于指导子字并行加法器的设计与选择。

关 键 词:子字并行  加法器  进位截断  进位消除
收稿时间:2009-1-15
修稿时间:2009-3-27  

Research and implementation of sub word-parallel adder
MA Sheng,HUANG Li-bo,WANG Zhi-ying,LIU Cong,DAI Kui.Research and implementation of sub word-parallel adder[J].Computer Engineering and Applications,2009,45(36):54-59.
Authors:MA Sheng  HUANG Li-bo  WANG Zhi-ying  LIU Cong  DAI Kui
Affiliation:School of Computer,National University of Defense Technology,Changsha 410073,China
Abstract: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 subword-parallel: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.
Keywords:subword-parallel  adder  carry truncation  carry elimination
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号