Electrical computers: arithmetic processing and calculating – Electrical digital calculating computer – Particular function performed
Reexamination Certificate
2000-04-14
2003-06-24
Ngo, Chuong Dinh (Department: 2124)
Electrical computers: arithmetic processing and calculating
Electrical digital calculating computer
Particular function performed
C708S709000, C708S710000
Reexamination Certificate
active
06584485
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Technical Field
The present invention relates to an apparatus for data processing in general, and in particular to a binary adder. Still more particularly, the present invention relates to a four-input/two-output binary adder.
2. Description of the Prior Art
The two most commonly encountered binary adders in digital arithmetic circuit arrangements are carry-propagate adders (CPAs) and carry-save adders (CSAs). CPAs are typically designed to have two data inputs and one output. CPAs operate according to well-known principles in which addend bits of the same order are added together, and a carry bit will be transferred to an adjacent higher order bit when required. A sum is directly derived from a bit-by-bit addition, with an appropriate carry to an adjacent higher order bit and a single bit carry out from the highest order bit position. The ripple carry of a CPA tends to result in slow non-parallel operations because high order bits computations are dependent on the results from low order bits.
CSAs, on the other hand, typically have three data inputs and two outputs. Carry bits in CSAs are accumulated separately from the sum bits of any given order (or position). The output of CSAs are two vectors, namely, a sum and a carry, which when added together yield the final result. One benefit of CSAs is that high-order bits have no dependency on any low-order bit because all bit positions are calculated independently, thereby avoiding the propagation latency associated with carry bits in CPAs. Because of their speed and simplicity, CSAs are pervasively found in digital logic designs.
The present disclosure provides a four input/two output CSA adder.
SUMMARY OF THE INVENTION
In accordance with a preferred embodiment of the present invention, a four-input/two-output adder includes a sum-lookahead full adder and a modified full adder. The sum-lookahead full adder includes an XOR
3
block and an AXOR block for receiving a first input, a second input, a third input, and an input from a forward adjacent, adder to generate a first sum signal and a sum-lookahead carry signal, respectively. The modified full adder includes an XOR
2
block and a MUX
2
block for receiving the first sum signal from the sum-lookahead full adder, a fourth input, and a sum-lookahead carry signal from a backward adjacent adder to generate a second sum signal and a carry signal, respectively.
All objects, features, and advantages of the present invention will become apparent in the following detailed written description.
REFERENCES:
patent: 4839850 (1989-06-01), Noll et al.
patent: 5299319 (1994-03-01), Vassiliadis et al.
patent: 5818747 (1998-10-01), Wong
patent: 6345286 (2002-02-01), Dhong et al.
patent: 6411980 (2002-06-01), Yoshida
patent: 6449629 (2002-09-01), Morgan
Hatsch et al., Carry Ripple Adder, Oct. 10 2002, United States patent application Publication No. U.S. 2002/0147756 A1.
Aoki Naoaki
Dhong Sang Hoo
Kojima Nobuo
Kwon Oh-sang
Bracewell & Patterson L.L.P.
Do Chat C.
Ngo Chuong Dinh
Salys Casimer K.
LandOfFree
4 to 2 adder does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with 4 to 2 adder, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and 4 to 2 adder will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3144913