|
|
| Line 1: |
Line 1: |
| [[File:4-bit carry lookahead adder.svg|thumb|right|250px|4-bit adder with carry lookahead]]
| | Oscar is how he's called and he completely loves this title. For many years he's been working as a meter reader and it's some thing he really enjoy. What I adore doing is to gather badges but I've been taking on new things lately. South Dakota is her beginning place but she requirements to transfer because of her family members.<br><br>My homepage ... [http://www.reachoutsociety.info/blog/435 http://www.reachoutsociety.info] |
| | |
| A '''carry-lookahead adder''' (CLA) is a type of [[adder (electronics)|adder]] used in [[digital logic]]. A carry-lookahead adder improves speed by reducing the amount of time required to determine carry bits. It can be contrasted with the simpler, but usually slower, ''[[ripple carry adder]]'' for which the carry bit is calculated alongside the sum bit, and each bit must wait until the previous carry has been calculated to begin calculating its own result and carry bits (see [[adder (electronics)|adder]] for detail on ripple carry adders). The carry-lookahead adder calculates one or more carry bits before the sum, which reduces the wait time to calculate the result of the larger value bits. The [[Kogge-Stone adder]] and [[Brent-Kung adder]] are examples of this type of adder.
| |
| | |
| [[Charles Babbage]] recognized the performance penalty
| |
| imposed by ripple carry and developed mechanisms for ''anticipating carriage'' in his computing engines.<ref>Charles Babbage, [http://books.google.com/books?id=Fa1JAAAAMAAJ&pg=PR3 Passages from the Life of a Philosopher], Longman, Green, Longmand Roberts & Green, London, 1864; pages 59-63 and 114-116.</ref> Gerald Rosenberger of [[IBM]] filed for a patent on a modern binary carry-lookahead adder in 1957.<ref>G.B. Rosenberger, [http://www.google.com/patents?id=SpBnAAAAEBAJ Simultaneous Carry Adder], U.S. Patent 2,966,305, Dec. 27, 1960.</ref>
| |
| | |
| ==Theory of operation==
| |
| | |
| A ripple-carry adder works in the same way as pencil-and-paper methods of addition. Starting at the rightmost (least significant) digit position, the two corresponding digits are added and a result obtained. It is also possible that there may be a carry out of this digit position (for example, in pencil-and-paper methods, "9+5=4, carry 1"). Accordingly all digit positions other than the rightmost need to take into account the possibility of having to add an extra 1, from a carry that has come in from the next position to the right.
| |
| | |
| This means that no digit position can have an absolutely final value until it has been established whether or not a carry is coming in from the right. Moreover, if the sum without a carry is 9 (in pencil-and-paper methods) or 1 (in binary arithmetic), it is not even possible to tell whether or not a given digit position is going to pass on a carry to the position on its left. At worst, when a whole sequence of sums comes to ...99999999... (in decimal) or ...11111111... (in binary), nothing can be deduced at all until the value of the carry coming in from the right is known, and that carry is then propagated to the left, one step at a time, as each digit position evaluated "9+1=0, carry 1" or "1+1=0, carry 1". It is the "rippling" of the carry from right to left that gives a ripple-carry adder its name, and its slowness. When adding 32-bit integers, for instance, allowance has to be made for the possibility that a carry could have to ripple through every one of the 32 one-bit adders.
| |
| | |
| Carry lookahead depends on two things:
| |
| # Calculating, for each digit position, whether that position is going to propagate a carry if one comes in from the right.
| |
| # Combining these calculated values to be able to deduce quickly whether, for each group of digits, that group is going to propagate a carry that comes in from the right.
| |
| | |
| Supposing that groups of 4 digits are chosen. Then the sequence of events goes something like this:
| |
| # All 1-bit adders calculate their results. Simultaneously, the lookahead units perform their calculations.
| |
| # Suppose that a carry arises in a particular group. Within at most 5 gate delays, that carry will emerge at the left-hand end of the group and start propagating through the group to its left.
| |
| # If that carry is going to propagate all the way through the next group, the lookahead unit will already have deduced this. Accordingly, ''before the carry emerges from the next group'' the lookahead unit is immediately (within 1 gate delay) able to tell the ''next'' group to the left that it is going to receive a carry - and, at the same time, to tell the next lookahead unit to the left that a carry is on its way.
| |
| | |
| The net effect is that the carries start by propagating slowly through each 4-bit group, just as in a ripple-carry system, but then move 4 times as fast, leaping from one lookahead carry unit to the next. Finally, within each group that receives a carry, the carry propagates slowly within the digits in that group.
| |
| | |
| The more bits in a group, the more complex the lookahead carry logic becomes, and the more time is spent on the "slow roads" in each group rather than on the "fast road" between the groups (provided by the lookahead carry logic). On the other hand, the fewer bits there are in a group, the more groups have to be traversed to get from one end of a number to the other, and the less acceleration is obtained as a result.
| |
| | |
| Deciding the group size to be governed by lookahead carry logic requires a detailed analysis of gate and propagation delays for the particular technology being used.
| |
| | |
| It is possible to have more than one level of lookahead carry logic, and this is in fact usually done. Each lookahead carry unit already produces a signal saying "if a carry comes in from the right, I will propagate it to the left", and those signals can be combined so that each group of (let us say) four lookahead carry units becomes part of a "supergroup" governing a total of 16 bits of the numbers being added. The "supergroup" lookahead carry logic will be able to say whether a carry entering the supergroup will be propagated all the way through it, and using this information, it is able to propagate carries from right to left 16 times as fast as a naive ripple carry. With this kind of two-level implementation, a carry may first propagate through the "slow road" of individual adders, then, on reaching the left-hand end of its group, propagate through the "fast road" of 4-bit lookahead carry logic, then, on reaching the left-hand end of its supergroup, propagate through the "superfast road" of 16-bit lookahead carry logic.
| |
| | |
| Again, the group sizes to be chosen depend on the exact details of how fast signals propagate within logic gates and from one logic gate to another.
| |
| | |
| For very large numbers (hundreds or even thousands of bits) lookahead carry logic does not become any more complex, because more layers of supergroups and supersupergroups can be added as necessary. The increase in the number of gates is also moderate: if all the group sizes are 4, one would end up with one third as many lookahead carry units as there are adders. However, the "slow roads" on the way to the faster levels begin to impose a drag on the whole system (for instance, a 256-bit adder could have up to 24 gate delays in its carry processing), and the mere physical transmission of signals from one end of a long number to the other begins to be a problem. At these sizes [[carry-save adder]]s are preferable, since they spend no time on carry propagation at all.
| |
| | |
| ==Carry lookahead method==
| |
| Carry lookahead logic uses the concepts of ''generating'' and ''propagating'' carries. Although in the context of a carry lookahead adder, it is most natural to think of generating and propagating in the context of binary addition, the concepts can be used more generally than this. In the descriptions below, the word ''digit'' can be replaced by ''bit'' when referring to binary addition.
| |
| | |
| The addition of two 1-digit inputs <var>A</var> and <var>B</var> is said to ''generate'' if the addition will always carry, regardless of whether there is an input carry (equivalently, regardless of whether any less significant digits in the sum carry). For example, in the decimal addition 52 + 67, the addition of the tens digits 5 and 6 ''generates'' because the result carries to the hundreds digit regardless of whether the ones digit carries (in the example, the ones digit does not carry (2+7=9)).
| |
| | |
| In the case of binary addition, <math>A + B</math> generates if and only if both <var>A</var> and <var>B</var> are 1. If we write <math>G(A,B)</math> to represent the binary predicate that is true if and only if <math>A + B</math> generates, we have:
| |
| | |
| :<math>G(A,B) = A \cdot B</math>
| |
| | |
| The addition of two 1-digit inputs <var>A</var> and <var>B</var> is said to ''propagate'' if the addition will carry whenever there is an input carry (equivalently, when the next less significant digit in the sum carries). For example, in the decimal addition 37 + 62, the addition of the tens digits 3 and 6 ''propagate'' because the result would carry to the hundreds digit ''if'' the ones were to carry (which in this example, it does not). Note that propagate and generate are defined with respect to a single digit of addition and do not depend on any other digits in the sum.
| |
| | |
| In the case of binary addition, <math>A + B</math> propagates if and only if at least one of <var>A</var> or <var>B </var> is 1. If we write <math>P(A,B)</math> to represent the binary predicate that is true if and only if <math>A + B</math> propagates, we have:
| |
| | |
| :<math>\ P(A,B) = A + B</math>
| |
| | |
| Sometimes a slightly different definition of ''propagate'' is used. By this definition <var>A + B</var> is said to propagate if the addition will carry whenever there is an input carry, but will not carry if there is no input carry. Fortunately, due to the way generate and propagate bits are used by the carry lookahead logic, it doesn't matter which definition is used. In the case of binary addition, this definition is expressed by:
| |
| | |
| :<math>P^{\prime}(A,B) = A \oplus B</math>
| |
| | |
| For binary arithmetic, ''or'' is faster than ''xor'' and takes fewer transistors to implement. However, for a multiple-level carry lookahead adder, it is simpler to use <math>P^{\prime}(A,B)</math>.
| |
| | |
| Given these concepts of generate and propagate, when will a digit of addition carry? It will carry precisely when either the addition generates ''or'' the next less significant bit carries and the addition propagates. Written in boolean algebra, with <math>C_i</math> the carry bit of digit <var>i</var>, and <math>P_i</math> and <math>G_i</math> the propagate and generate bits of digit <var>i</var> respectively,
| |
| | |
| :<math>C_{i+1} = G_i + \left( P_i \cdot C_i \right)</math>
| |
| | |
| ==Implementation details==
| |
| For each bit in a binary sequence to be added, the Carry Look Ahead Logic will determine whether that bit pair will generate a carry or propagate a carry. This allows the circuit to "pre-process" the two numbers being added to determine the carry ahead of time. Then, when the actual addition is performed, there is no delay from waiting for the ripple carry effect (or time it takes for the carry from the first Full Adder to be passed down to the last Full Adder). Below is a simple 4-bit generalized Carry Look Ahead circuit that combines with the 4-bit Ripple Carry Adder we used above with some slight adjustments:
| |
| | |
| <!-- Image with unknown copyright status removed: [[File:4-bit carry lookahead adder.png|thumb|400px|'''4-bit Carry Lookahead Adder''']] -->
| |
| For the example provided, the logic for the generate (g) and propagate (p) values are given below. Note that the numeric value determines the signal from the circuit above, starting from 0 on the far left to 3 on the far right:
| |
| | |
| :<math>C_1 = G_0 + P_0 \cdot C_0</math>
| |
| :<math>C_2 = G_1 + P_1 \cdot C_1</math>
| |
| :<math>C_3 = G_2 + P_2 \cdot C_2</math>
| |
| :<math>C_4 = G_3 + P_3 \cdot C_3</math>
| |
| | |
| Substituting <math>C_1</math> into <math>C_2</math>, then <math>C_2</math> into <math>C_3</math>, then <math>C_3</math> into <math>C_4</math> yields the expanded equations:
| |
| | |
| :<math>C_1 = G_0 + P_0 \cdot C_0</math>
| |
| :<math>C_2 = G_1 + G_0 \cdot P_1 + C_0 \cdot P_0 \cdot P_1</math>
| |
| :<math>C_3 = G_2 + G_1 \cdot P_2 + G_0 \cdot P_1 \cdot P_2 + C_0 \cdot P_0 \cdot P_1 \cdot P_2</math>
| |
| :<math>C_4 = G_3 + G_2 \cdot P_3 + G_1 \cdot P_2 \cdot P_3 + G_0 \cdot P_1 \cdot P_2 \cdot P_3 + C_0 \cdot P_0 \cdot P_1 \cdot P_2 \cdot P_3</math>
| |
| | |
| To determine whether a bit pair will generate a carry, the following logic works:
| |
| :<math>G_i = A_i \cdot B_i</math>
| |
| | |
| To determine whether a bit pair will propagate a carry, either of the following logic statements work:
| |
| :<math>P_i = A_i \oplus B_i</math>
| |
| :<math>\ P_i = A_i + B_i</math>
| |
| | |
| The reason why this works is based on evaluation of <math>C_1 = G_0 + P_0 \cdot C_0</math>. The only difference in the truth tables between (<math>A \oplus B</math>) and (<math>A + B</math>) is when both <math>A</math> and <math>B</math> are 1. However, if both <math>A</math> and <math>B</math> are 1, then the <math>G_0</math> term is 1 (since its equation is <math>A \cdot B</math>), and the <math>P_0 \cdot C_0</math> term becomes irrelevant. The XOR is used normally within a basic full adder circuit; the OR is an alternate option (for a carry lookahead only) which is far simpler in transistor-count terms.
| |
| | |
| The Carry Look Ahead 4-bit adder can also be used in a higher-level circuit by having each CLA Logic circuit produce a propagate and generate signal to a higher-level CLA Logic circuit. The group propagate (<math>PG</math>) and group generate (<math>GG</math>) for a 4-bit CLA are:
| |
| :<math>PG = P_0 \cdot P_1 \cdot P_2 \cdot P_3</math>
| |
| :<math>GG = G_3 + G_2 \cdot P_3 + G_1 \cdot P_3 \cdot P_2 + G_0 \cdot P_3 \cdot P_2 \cdot P_1</math>
| |
| | |
| Putting 4 4-bit CLAs together yields four group propagates and four group generates.
| |
| A [[Lookahead Carry Unit]] (LCU) takes these 8 values and uses identical logic to calculate <math>C_i</math> in the CLAs.
| |
| The LCU then generates the carry input for each of the 4 CLAs and a fifth equal to <math>C_{16}</math>.
| |
| | |
| The calculation of the [[gate delay]] of a 16-bit adder (using 4 CLAs and 1 LCU) is not as straight forward as the ripple carry adder.
| |
| Starting at time of zero:
| |
| * calculation of <math>P_i</math> and <math>G_i</math> is done at time 1
| |
| * calculation of <math>C_i</math> is done at time 3
| |
| * calculation of the <math>PG</math> is done at time 2
| |
| * calculation of the <math>GG</math> is done at time 3
| |
| * calculation of the inputs for the CLAs from the LCU are done at
| |
| ** time 0 for the first CLA
| |
| ** time 5 for the second, third & fourth CLA
| |
| * calculation of the <math>S_i</math> are done at
| |
| ** time 4 for the first CLA
| |
| ** time 8 for the second, third & fourth CLA
| |
| * calculation of the final carry bit (<math>C_{16}</math>) is done at time 5
| |
| | |
| The maximum time is 8 gate delays (for <math>S_{[8-15]}</math>).
| |
| A standard 16-bit ripple carry adder would take 31 gate delays.
| |
| | |
| ==Manchester carry chain==
| |
| | |
| The Manchester carry chain is a variation of the carry-lookahead adder that uses shared logic to lower the transistor count. As can be seen above in the implementation section, the logic for generating each carry contains all of the logic used to generate the previous carries. A Manchester carry chain generates the intermediate carries by tapping off nodes in the gate that calculates the most significant carry value. Not all [[logic families]] have these internal nodes, however, [[CMOS]] being a major example. [[Dynamic logic (digital logic)|Dynamic logic]] can support shared logic, as can [[transmission gate]] logic. One of the major downsides of the Manchester carry chain is that the capacitive load of all of these outputs, together with the resistance of the transistors causes the propagation delay to increase much more quickly than a regular carry lookahead. A Manchester-carry-chain section generally won't exceed 4 bits.
| |
| | |
| ==See also==
| |
| | |
| * [[Full adder]]
| |
| * [[Carry save adder]]
| |
| * [[Lookahead Carry Unit]]
| |
| * [[Kogge-Stone Adder]]
| |
| * [[Carry bypass adder]]
| |
| * [[Carry operator]]
| |
| | |
| ==External links==
| |
| * [http://www.ecs.umass.edu/ece/koren/arith/simulator/Add/lookahead/ Carry Look Ahead Adder JavaScript simulator]
| |
| | |
| ==References==
| |
| * [http://www.aoki.ecei.tohoku.ac.jp/arith/mg/algorithm.html#fsa_rcl Hardware algorithms for arithmetic modules], ARITH research group, Aoki lab., Tohoku University
| |
| * {{cite book |last=Katz |first=Randy |authorlink=Randy Katz |title=Contemporary Logic Design |publisher=The Benjamin/Cummings Publishing Company |year=1994 |isbn=0-8053-2703-7 |doi=10.1016/0026-2692(95)90052-7 |pages=249–256}}
| |
| | |
| {{Reflist}}
| |
| | |
| {{DEFAULTSORT:Carry Look-Ahead Adder}}
| |
| [[Category:Adders]]
| |