摘要
加法运算在计算机中是最基本的,也是最重要的运算。传统的快速加法器是使用超前进位加法器,但其存在着电路不规整,需要长线驱动等缺点。文章提出了采用二叉树法设计加法器的方法,用该方法实现的加法器,具有电路规整、易于扩展及速度快等优点。
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.
出处
《合肥工业大学学报(自然科学版)》
CAS
CSCD
北大核心
2005年第10期1281-1283,共3页
Journal of Hefei University of Technology:Natural Science