作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (23): 288-290. doi: 10.3969/j.issn.1000-3428.2011.23.097

• 开发研究与设计技术 • 上一篇    下一篇

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

丁宜栋1,刘昌明1,方湘艳2   

  1. (1. 海军计算技术研究所,北京 100841;2. 中国船舶重工集团公司第709研究所,武汉 430074)
  • 收稿日期:2011-06-13 出版日期:2011-12-05 发布日期:2011-12-05
  • 作者简介:丁宜栋(1972-),男,高级工程师、硕士,主研方向:信息安全;刘昌明,工程师;方湘艳,高级工程师、博士

Rapid Carry Adder Based on Carry Forecast Between Groups

DING Yi-dong 1, LIU Chang-ming 1, FANG Xiang-yan 2   

  1. (1. Navy Computing Technology Institute, Beijing 100841, China; 2. The 709th Research Institute, China Shipbuilding Industry Corporation, Wuhan 430074, China)
  • Received:2011-06-13 Online:2011-12-05 Published:2011-12-05

摘要: 为加快密码系统中大数加法的运算速度,提出并实现一种基于组间进位预测的快速进位加法器。将参与加法运算的大数进行分 组,每个分组采用改进的超前进位技术以减少组内进位延时,组间通过进位预测完成不同进位状态下的加法运算,通过每个组产生的进位状态判断最终结果。性能分析表明,该进位加法器实现1 024位大数加法运算的速度较快。

关键词: 进位预测, 大数加法器, 超前进位, 分组, 进位加法器

Abstract: 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.

Key words: carry forecast, large numbers adder, carry lookahead, grouping, carry adder

中图分类号: