Published26 Sep Abstract The core of every microprocessor and digital signal processor is its data path. The heart of data-path and addressing units in turn are arithmetic units which include adders. Parallel-prefix adders offer a highly efficient solution to the binary addition problem and are well suited for VLSI implementations. This paper involves the design and comparison of high-speed, parallel-prefix adders such as Kogge-Stone, Brent-Kung, Sklansky, and Kogge-Stone Ling adders. It is found that Kogge-Stone Ling adder performs much efficiently when compared to the other adders.

Author:Visida Dall
Language:English (Spanish)
Published (Last):11 June 2014
PDF File Size:15.51 Mb
ePub File Size:20.43 Mb
Price:Free* [*Free Regsitration Required]

Nikree A constant-coefficient multiplier is given as a part of MACs as follow. As a result, AMG supports such hardware algorithms for constant-coefficient multiplication, where the range of R is from -2 31 to 2 31 Each group generates two sets of sum bits and an outgoing carry. The fixed block size should be selected so that the time for the longest carry-propagation chain can be minimized. These hardware algorithms are also used to generate multipliers, constant-coefficient multipliers and multiply accumulators.

Overturned-stairs tree requires smaller number of wiring tracks compared with the Wallace tree and has lower overall delay compared with the balanced delay tree.

There are many possible choices for the multiplier structure for a specific coefficient R. A block carry look-ahead adder BCLA is based on the above idea. Figure 7 is the parallel prefix graph aeder a Brent-Kung adder. The main idea behind carry look-ahead addition is an attempt to generate all incoming carries in parallel and avoid waiting until the correct carry propagates from the stage FA of the adder where it has been generated.

This signal can be used to allow an incoming carry to skip all the stages within the block and generate a block-carry-out. You can further increase the number of product terms computed in a single cycle depending on your target applications. Each set includes k sum bits and an outgoing carry. Figure 22 shows a n-term multiply accumulator.

Table 1 shows hardware algorithms that can be selected for multi-operand adders in AMG, where the bit-level optimized design indicates that the matrix of partial product bits is reorganized to optimize the number of basic components. The adder structure is divided into blocks of consecutive stages with a simple ripple-carry scheme.

Figure 2 shows the parallel prefix graph of a bit RCLA, where the symbol solid circle indicates an extension of the fundamental carry operator described at Parallel prefix adders. Array is a straightforward way to accumulate partial products using a number of adders. Figure 3 shows the parallel prefix graph of a bit BCLA, where the symbol solid circle indicates carlxon extension carlsno the fundamental carry operator described at Parallel prefix adders. In other words, a carry is generated if both operand bits are 1, and an incoming carry is propagated if one of the operand bits is 1 and the other is 0.

Balanced delay tree requires the smallest number of wiring tracks but has the highest overall delay compared with the Wallace tree and the overturned-stairs tree. A carry-skip adder reduces the carry-propagation time by skipping over groups of consecutive adder stages.

A 7,3 counter tree is based on 7,3 counters. Therefore, let Gi and Pi denote the generation and propagation at the ith stage, we have: A multiply accumulator is generated by a combination of hardware algorithms for multipliers and constant-coefficient multipliers.

This reduces the ripple-carry delay through these blocks. A ripple-block carry look-ahead adder RCLA consists of N m-bit blocks arranged in such a way that carries within blocks are generated by carry look-ahead but carries between blocks are rippled.

Figure 12 shows an 8-bit carry-skip adder consisting of four fixed-size blocks, each of size 2. Hybrid Han-Carlson adder Figure 14 compares the delay information of true paths and that of false paths in the case of Gan 0. Figure 6 is the parallel prefix graph of a Kogge-Stone adder. A parallel prefix adder can be represented as a parallel prefix graph consisting of carry operator nodes. The RCLA design is obtained by using multiple levels of carry look-ahead.

This adder has a hybrid design combining stages from ader Brent-Kung and Kogge-Stone adder. Figure 19 shows an operand 4;2 compressor tree, where 4;2 indicates a carry-save adder having four multi-bit inputs and two multi-bit outputs.

Dadda tree is based on 3,2 counters. The complexity of multiplier structures significantly varies with the coefficient value R. TOP Related.


Design of High-Speed Adders for Efficient Digital Design Blocks

Enhancements[ edit ] Enhancements to the original implementation include increasing the radix and sparsity of the adder. The radix of the adder refers to how many results from the previous level of computation are used to generate the next one. Doing so increases the power and delay of each stage, but reduces the number of required stages. In the so-called sparse Kogge—Stone adder SKA the sparsity of the adder refers to how many carry bits are generated by the carry-tree.


Kogge–Stone adder







Related Articles