1. Introduction

2. Basic model outline

3. Final processing stage

4. Low-power adder

5. Comparison with Kogge–Stone adder
    Advantages  Disadvantages 

6. References

7. Further reading

8. External links

The Brent–Kung adder (BKA or BK), proposed in 1982, is an advanced binary adder design, having a gate level depth of .

Introduction

The Brent–Kung adder is a parallel prefix adder (PPA) form of carry-lookahead adder (CLA). Proposed by Richard Peirce Brent and Hsiang Te Kung in 1982 it introduced higher regularity to the adder structure and has less wiring congestion leading to better performance and less necessary chip area to implement compared to the Kogge–Stone adder (KSA). It is also much quicker than ripple-carry adders (RCA).

Ripple-carry adders were the initial multi-bit adders which were developed in the early days and got their name from the ripple effect which the carry made while being propagated from right to left. The time taken for addition was directly proportional to the length of the bit being added. This is reverse in Brent–Kung adders where the carry is calculated in parallel thus reducing the addition time drastically. Further work has been done on Brent–Kung adders and other parallel adders to reduce the power consumption and chip area as well as to increase the speed thus making them suitable for low-power designs.

A Brent–Kung adder is a parallel adder made in a regular layout with an aim of minimizing the chip area and ease manufacturing. The addition of n-bit number can be performed in time with a chip size of area thus making it a good-choice adder with constraints on area and maximizing the performance. Its symmetry and regular build structure reduces costs of production effectively and enable it to be used in pipeline architectures. In parallel adders the critical path is decided by computation of the carry from least significant bit (LSB) adder to the most significant bit (MSB) adder, therefore efforts are in reducing the critical path for the carry to reach the MSB.

Basic model outline

In general, most of the adders use carry-in and the corresponding bits of two numbers (A and B) to get the corresponding sum bit and carry-out - with ripple carry adders taking time for carry to reach MSB.

• Considering that A = a_n a_n-1 … a₁ and B = b_n b_n-1 … b₁ both be n-bit binary numbers.

• With sum being S = s_n+1 s_n … s₁ and carry generated in each stage C = c_n … c₀ will be carry-in to next stages.

• For RCA, c₀ = 0, and i the sum bit and carry bit generated are c_i = g_i ∨ (a_i ∧ c_i-1) ∨ (b_i ∧ c_i-1),
  s_i = a_i ⊕ b_i ⊕ c_i-1 for i = 1, 2, … n
  s_n+1 = c_n respectively.
• It is possible to transform the above ripple carry into carry-lookahead (CLA) by defining the carry bit i as c₀ = 0,
  c_i = (a_i ∧ b_i) ∨ (p_i ∧ c_i-1) where
  g_i = a_i ∧ b_i and p_i = a_i ⊕ b_i for i = 1, 2, … n. p and g are known as carry propagate and carry generate. This corresponds to the fact that the carry c_i is either generated by a_i and b_i or propagated from the previous carry c_i-1.

Brent and Kung further transformed the carry generation and propagation by defining an operator o as
(a₁, b₁) o (a₂, b₂) = (a₁ ∨ (b₁ ∧ a₂), b₁ ∧ b₂).

• They also defined a function (G_i, P_i) = (g₁, p₁) for i = 1;
  otherwise (gi, pi) o (Gi-1, Pi-1) for i = 2, 3, … n. It can be derived that G_i in the function is equivalent to c_i. Also (G_n, P_n) can be non-recursively written as = (g_n, p_n) o (g_n-1, p_n-1) o … o (g₁, p₁).

Taking advantage of the associativity of operator o (G_n, P_n) can be computed in a tree-like manner.

The design of the white nodes is obvious as they are just buffering the g_i's and p_i's, and the black nodes are performing operation defined by operator o, which is similar to a one bit adder.

• This tree-like propagation of carry reduces its critical path to that of tree height. As the carry tree height can be maximum of , the critical path of the Brent–Kung parallel adder is also , which is better than the normal adder performance of . The tree-based layout also reduces the chip area and redundant wiring required in general CLA-based adders.

Final processing stage

Using the carry propagation and generation transformation for working out addition and carry used by Brent and Kung, the performance of the adder increases considerably and also leads to an increase in regularity. The final sum can be calculated as follows: si = pi ⊕ ci-1

Low-power adder

The increase in performance in Brent–Kung adders is attributed to its tree structure of carry propagation which also leads to lower power consumption as the carry signal now has to travel through fewer stages, leading to less switching of transistors. Also, the decrease in amount of wiring and fan-out also contributes largely to its lower power consumption than CLA adders. A Brent–Kung adder can also be used in a pipeline manner which can further reduce the power consumption by reducing the depth of combinatorial logic and glitches stabilization. The graph shows a low-power Brent–Kung adder.^[3]

Comparison with Kogge–Stone adder

Advantages

Due to this type of adder requiring fewer modules to implement than the Kogge–Stone adder, the Brent–Kung adder is much simpler to build. It also contains far fewer connections to other modules, which also contributes to its simplicity.^[4]

Disadvantages

One major disadvantage of this adder is fan-out. Fan-out may split and weaken the current propagating through the adder.^[4]

References

• Year 1502
• Year 1503
• Year 1504
• Year 1505
• Year 1506
• Year 1507
• Year 1508
• Year 1509
• Year 151
• Year 1510
• Year 1511
• Year 1512
• Year 1513
• Year 1514
• Year 1515
• Year 1516
• Year 1517
• Year 1518
• Year 1519
• Year 152
• Year 1520
• Year 1521
• Year 1522
• Year 1523
• Year 1524