| 多位快速加法器的设计 |
| |
| 引用本文： | 詹文法,马俊,谢莹,黄玉.多位快速加法器的设计[J].合肥工业大学学报(自然科学版),2005,28(10):1281-1283. |
| |
| 作者姓名： | 詹文法 马俊 谢莹 黄玉 |
| |
| 作者单位： | 安庆师范学院,教育技术系,安徽,安庆,246011 |
| |
| 摘 要： | 加法运算在计算机中是最基本的,也是最重要的运算。传统的快速加法器是使用超前进位加法器,但其存在着电路不规整,需要长线驱动等缺点。文章提出了采用二叉树法设计加法器的方法,用该方法实现的加法器,具有电路规整、易于扩展及速度快等优点。
|
| 关 键 词： | 半加器 全加器 超前进位加法器 二叉树法 |
| 文章编号： | 1003-5060(2005)10-1281-03 |
| 修稿时间： | 2004年12月23 |
Design of the multi-bit rapid adder |
| |
| ZHAN Wen-fa,MA Jun,XIE Ying,HUANG Yu.Design of the multi-bit rapid adder[J].Journal of Hefei University of Technology(Natural Science),2005,28(10):1281-1283. |
| |
| Authors: | ZHAN Wen-fa MA Jun XIE Ying HUANG Yu |
| |
| Abstract: | In a computer,which is comprised of some logic parts with serial logic functions,the adder is the most basic and important logic circuit,but the traditional rapid adder circuit uses the carry look-ahead adder,which has some shortcomings,such as abnormity,needing long-line drive.In this paper,a binary tree-based adder method is presented,which improves the performance of the adder in the aspecst of regularity,extension and speed. |
| |
| Keywords: | half adder full adder carry look-ahead adder binary tree |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
