• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国政府科技报告 >Determination of Expected Longest Carry Propagation Lengths for Binary Addition of Signed Numbers
【24h】

Determination of Expected Longest Carry Propagation Lengths for Binary Addition of Signed Numbers

机译：确定符号二进制加法的预期最长进位传播长度

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The expected longest carry delay of asynchronous self-timing additions and the expected maximum number of processing cycles of synchronous iterative additions for signed binary numbers are exactly determined. The former depends on the longest carry propagation lengths due to either zero or nonzero carries, whereas the latter depends only on the longest nonzero carry propagation lengths. The signed numbers are represented by 2's complement notation. It is found that the enormous possible combinations for binary additions of signed numbers and their longest carry delays can be expressed by some recursive formulas if state representations of allowable addition processes (without overflow) are employed. By this method, efficient computer programmings are written to determine exactly the expected longest carry delays for asynchronous additions and the expected maximum numbers of processing cycles for synchronous iterative additions. The results for n = 2 through n = 48, where n is the number of bits of the summands, are given. The dependence relations of these delays on n are also considered. (Author)

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号