期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于组间进位预测的快速进位加法器

Rapid Carry Adder Based on Carry Forecast Between Groups
在线阅读 下载PDF
导出
摘要 为加快密码系统中大数加法的运算速度,提出并实现一种基于组间进位预测的快速进位加法器。将参与加法运算的大数进行分组,每个分组采用改进的超前进位技术以减少组内进位延时,组间通过进位预测完成不同进位状态下的加法运算,通过每个组产生的进位状态判断最终结果。性能分析表明,该进位加法器实现1 024位大数加法运算的速度较快。 This paper presents and realizes a rapid carry adder based on carry forecast between groups to improve the speed of the large numbers adder in some cryptography systems.The large numbers is divided into many groups,the delay of carry-chain is reduced by carry lookahead in group.The group addition operation of different carry state is finished by carry forecast between groups.The addition sun of different carry forecast state is selected as the final result based on the carry state.Performance analysis shows that the computing speed of the carry adder is faster when realizing the 1 024 bit large numbers add operation.
作者 丁宜栋 刘昌明 方湘艳
机构地区 海军计算技术研究所 中国船舶重工集团公司第
出处 《计算机工程》 CAS CSCD 北大核心 2011年第23期288-290,共3页 Computer Engineering
关键词 进位预测 大数加法器 超前进位 分组 进位加法器 carry forecast large numbers adder carry lookahead grouping carry adder
分类号 TP309 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献7

  • 1Nagendra C, Irwin M J, Owens R W. Area-time-power Tradeoffs in Parallel Adders[J]. IEEE Trans. on Circuits and SystemsII, 1996, 43(10): 689-702.
  • 2Wang Chuachin, Huang Chenjung, Tai Kunchu. A1.0-GHz 0.6 μm 8-bit Carry Lookahead Adder Using PLA-styled All-n-transister Logic[J]. IEEE Trans. on Circuits and Systems, 2000, 47(2): 133-135.
  • 3Schulte M J, Chirca K, Glossner J, et al. A Low-power Carry Skip Adder with Fast Saturation[C]//Proc. of the 15th IEEE International Conf. on Application-specific Systems, Architectures and Processors. Los Alamos, USA: IEEE Press, 2004.
  • 4Huang Yenmou, Kuo J B. A High-speed Conditional Carry Select (CCS) Adder Circuit with a Successively Incremented Carry Number Block Structure for Low-voltage VLSI Implementation[J]. IEEE Trans. on Circuits and Systems I1,2000, 47(10): 1074-1079.
  • 5Manzoul M A. Parallel CLA Algorithm for Fast Addition[C]//Proc. of PARELEC'00. Quebec, Canada: Is. n.], 2000.
  • 6曹苏群,王士同,陈晓峰.基于后验概率的不平衡数据集特征选择算法[J].计算机工程,2008,34(19):1-3. 被引量：5
  • 7Pai Yuting, Chen Yu-kumg. The Fastest Carry Look Ahead Adder[C]//Proc. of the 2nd IEEE International Workshop on Electronic Design, Test and Applications. Los Alamos, USA: IEEE Press, 2004.

二级参考文献6

  • 1Abe N, Kudo M. Non-parametric Classifier-independent Feature Selection[J]. Pattern Recognition, 2006, 39(5): 737-746.
  • 2Barandela R, Sanchez J S, Garcfa V. Strategies for Learning in Class Imbalance Problems[J]. Pattern Recognition, 2003, 36(3): 849-851.
  • 3Tomek I. Two Modifications of CNN[J]. IEEE Transactions on Systems, Man and Communications, 1976, 6(11): 769-772.
  • 4Blake C L, Merz C J. UCI Repository of Machine Learning Databases[EB/OL]. (1998-08-08). http://www.ics.uci.edu/-mlearn/ MLRepository.html.
  • 5Cover T M, Hart P E. Nearest Neighbor Pattern Classification[J]. IEEE Transactions on Information Theory, 1967, 13(1): 21-27.
  • 6Wang Shitong, Zhu Jiagang, Chung Fulai, et al. Theoretically Optimal Parameter Choices for Support Vector Regression Machines with Noisy Input[J]. Soft Computing, 2005, 9(10): 732-741.

共引文献4

计算机工程
2011年 第23期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部