## Reduced Power Dissipation Through Truncated Multiplication (1999)

Venue: | in IEEE Alessandro Volta Memorial Workshop on Low Power Design |

Citations: | 22 - 7 self |

### BibTeX

@INPROCEEDINGS{Schulte99reducedpower,

author = {Michael J. Schulte and James E. Stine and John G. Jansen},

title = {Reduced Power Dissipation Through Truncated Multiplication},

booktitle = {in IEEE Alessandro Volta Memorial Workshop on Low Power Design},

year = {1999},

pages = {61--69}

}

### OpenURL

### Abstract

Reducing the power dissipation of parallel multipliers is important in the design of digital signal processing systems. In many of these systems, the products of parallel multipliers are rounded to avoid growth in word size. The power dissipation and area of rounded parallel multipliers can be significantly reduced by a technique known as truncated multiplication. With this technique, the least significant columns of the multiplication matrix are not used. Instead, the carries generated by these columns are estimated. This estimate is added with the most significant columns to produce the rounded product. This paper presents the design and implementation of parallel truncated multipliers. Simulations indicate that truncated parallel multipliers dissipate between 29 and 40 percent less power than standard parallel multipliers for operand sizes of 16 and 32 bits. 1: Introduction High-speed parallel multipliers are fundamental building blocks in digital signal processing systems [1]. In...

### Citations

241 |
A suggestions for a fast Multipliers
- Wallace
- 1964
(Show Context)
Citation Context ..., and the desire for portability increase, so does the need for low-power parallel multipliers. Parallel multipliers are typically implemented as either array multipliers [3], [4] or tree multipliers =-=[5]-=- - [7]. For both types of parallel multipliers, Booth-encoding can be employed to reduce the number of partial products [8], [9]. Estimates given in [10] - [12] indicate that array multipliers dissipa... |

117 |
Some schemes for parallel multipliers
- Dadda
- 1965
(Show Context)
Citation Context ... partial product matrix to two rows, which are summed using a carry-propagate adder. Figure 3a shows the dot diagram of an 8 by 8 tree multiplier that uses Dadda's method of partial product reduction =-=[6]-=-. In this figure, each partial product is represented by a dot, the outputs of each full adder are represented by two dots connected by a plain diagonal line, and the outputs of a half adder are repre... |

41 |
Micheli Circuit and architecture trade-offs for high-speed multiplication
- Song, De
- 1991
(Show Context)
Citation Context ... be achieved by multiplier trees that use other methods for reducing the partial product, such as Wallace tree multipliers [5] or multipliers that use compressors or higher order counters [28], [29], =-=[30]-=-. Figure 3b shows the dot diagram of an 8 by 8 truncated Dadda multiplier, which uses the Constant Correction Truncated Multiplication method [24]. For this multiplier, n = 8 and k = 3, so the t = 5 l... |

35 |
Truncated Multiplication with Correction Constant,” VLSI Signal Processing, VI
- Schulte, Swartzlander
- 1993
(Show Context)
Citation Context ...roduct. Although this leads to additional error in the rounded product, various techniques have been developed to help limit this error. With the Constant Correction Truncated Multiplier presented in =-=[24]-=-, a constant is added to columns n \Gamma 1 to n \Gamma k of the multiplication matrix. The constant helps compensate for the error introduced by omitting the n \Gamma k least significant columns (cal... |

24 |
Parallel counters
- SWARTZLANDER
- 1973
(Show Context)
Citation Context ... savings can be achieved by multiplier trees that use other methods for reducing the partial product, such as Wallace tree multipliers [5] or multipliers that use compressors or higher order counters =-=[28]-=-, [29], [30]. Figure 3b shows the dot diagram of an 8 by 8 truncated Dadda multiplier, which uses the Constant Correction Truncated Multiplication method [24]. For this multiplier, n = 8 and k = 3, so... |

21 | Circuit techniques for cmos low-power high-performance multipliers - Abu-Khater, etc - 1996 |

19 | Area-efficient multipliers for digital signal processing applications - Kidambi, Guibaly, et al. - 1996 |

18 |
Parallel Reduced Area Multipliers
- Bickerstaff, Schulte, et al.
- 1995
(Show Context)
Citation Context ...nd the desire for portability increase, so does the need for low-power parallel multipliers. Parallel multipliers are typically implemented as either arraymultipliers [3], [4] or tree multipliers [5]-=-=[7]-=-. For both types of parallel multipliers, Booth-encoding can be employed to reduce the number of partial products [8], [9]. Estimates given in [10] - [12] indicate that array multipliers dissipate mor... |

17 |
Multiplier Policies for Digital Signal Processing
- Ma, Taylor
- 1990
(Show Context)
Citation Context ...less power than standard parallel multipliers for operand sizes of 16 and 32 bits. 1: Introduction High-speed parallel multipliers are fundamental building blocks in digital signal processing systems =-=[1]-=-. In many cases, parallel multipliers contribute significantly to the overall power dissipation of these systems [2]. As transistor counts, clock frequencies, and the desire for portability increase, ... |

17 |
Single-precision multiplier with reduced circuit complexity for signal processing applications
- Lim
- 1992
(Show Context)
Citation Context ...lel multipliers are used to produce the product. In many computer systems, the 2n-bit products produced by the parallel multipliers are rounded to n bits to avoid growth in word size. As presented in =-=[23]-=- - [26], truncated multiplication provides an efficient method for reducing the hardware requirements of rounded parallel multipliers. With truncated multiplication, only the n + k most significant co... |

16 |
Reduced area multipliers
- Bickerstaff, Schulte, et al.
- 1993
(Show Context)
Citation Context ...the desire for portability increase, so does the need for low-power parallel multipliers. Parallel multipliers are typically implemented as either array multipliers [3], [4] or tree multipliers [5] - =-=[7]-=-. For both types of parallel multipliers, Booth-encoding can be employed to reduce the number of partial products [8], [9]. Estimates given in [10] - [12] indicate that array multipliers dissipate mor... |

16 |
A.: A Generalized Multibit Recoding of Two’s Complement Binary Numbers and its Proof with Application in Multiplier Implementation
- Sam, Gupta
- 1990
(Show Context)
Citation Context ...ly implemented as either array multipliers [3], [4] or tree multipliers [5] - [7]. For both types of parallel multipliers, Booth-encoding can be employed to reduce the number of partial products [8], =-=[9]-=-. Estimates given in [10] - [12] indicate that array multipliers dissipate more power than tree multipliers and that Booth-encoded multipliers dissipate more power than multipliers that are not Booth-... |

15 |
Data-dependent truncated scheme for parallel multiplication
- King, Swartzlander
- 1998
(Show Context)
Citation Context ...tipliers are used to produce the product. In many computer systems, the 2n-bit products produced by the parallel multipliers are rounded to n bits to avoid growth in word size. As presented in [23] - =-=[26]-=-, truncated multiplication provides an efficient method for reducing the hardware requirements of rounded parallel multipliers. With truncated multiplication, only the n + k most significant columns o... |

14 |
A signed binary multiplication technique," Quarterly
- Booth
- 1951
(Show Context)
Citation Context ...pically implemented as either array multipliers [3], [4] or tree multipliers [5] - [7]. For both types of parallel multipliers, Booth-encoding can be employed to reduce the number of partial products =-=[8]-=-, [9]. Estimates given in [10] - [12] indicate that array multipliers dissipate more power than tree multipliers and that Booth-encoded multipliers dissipate more power than multipliers that are not B... |

14 |
Delay Balanced Multipliers for Low Power/Low Voltage
- Sakuta, Lee, et al.
- 1995
(Show Context)
Citation Context ...ncoded. Various techniques have been developed to reduce the power dissipation of parallel multipliers. Several of these techniques reduce power dissipation by eliminating spurious transitions [13] - =-=[15]-=-. Other research has focused on developing novel multiplier architectures and sign-extension techniques to reduce power dissipation and improve performance [16] - [19]. Another approach is to develop ... |

11 | Low power parallel multipliers - Angel, Swartzlander - 1996 |

10 |
A low power 16 by 16 multiplier using transition reduction circuitry
- Lemonds
- 1996
(Show Context)
Citation Context ...Booth-encoded. Various techniques have been developed to reduce the power dissipation of parallel multipliers. Several of these techniques reduce power dissipation by eliminating spurious transitions =-=[13]-=- - [15]. Other research has focused on developing novel multiplier architectures and sign-extension techniques to reduce power dissipation and improve performance [16] - [19]. Another approach is to d... |

9 |
Low power multiplication for FIR filters
- Nicol, Larsson
- 1997
(Show Context)
Citation Context ...el multipliers are fundamental building blocks in digital signal processing systems [1]. In many cases, parallel multipliers contribute significantly to the overall power dissipation of these systems =-=[2]-=-. As transistor counts, clock frequencies, and the desire for portability increase, so does the need for low-power parallel multipliers. Parallel multipliers are typically implemented as either array ... |

9 |
Power-delay characteristics of CMOS multipliers
- Callaway, Swartzlander
- 1997
(Show Context)
Citation Context ... array multipliers [3], [4] or tree multipliers [5] - [7]. For both types of parallel multipliers, Booth-encoding can be employed to reduce the number of partial products [8], [9]. Estimates given in =-=[10]-=- - [12] indicate that array multipliers dissipate more power than tree multipliers and that Booth-encoded multipliers dissipate more power than multipliers that are not Booth-encoded. Various techniqu... |

9 | Low-power multiplier design using delayed evaluation - Sobelman, Raatz - 1995 |

9 |
A fast and low power multiplier architecture
- ABU-SHAMA, MAAZ, et al.
- 1996
(Show Context)
Citation Context ...ting spurious transitions [13] - [15]. Other research has focused on developing novel multiplier architectures and sign-extension techniques to reduce power dissipation and improve performance [16] - =-=[19]-=-. Another approach is to develop low-power 3-2 counters and 4-2 compressors, which are key components in parallel multipliers [20] - [22]. Although each of these techniques helps reduce power dissipat... |

9 |
High-Speed Multiplier Design Using Multi-Input Counter and Compressor Circuits
- Mehta, Parmar, et al.
- 1991
(Show Context)
Citation Context ...gs can be achieved by multiplier trees that use other methods for reducing the partial product, such as Wallace tree multipliers [5] or multipliers that use compressors or higher order counters [28], =-=[29]-=-, [30]. Figure 3b shows the dot diagram of an 8 by 8 truncated Dadda multiplier, which uses the Constant Correction Truncated Multiplication method [24]. For this multiplier, n = 8 and k = 3, so the t... |

8 |
pipelined multiplieraccumulator using a high speed, low power static and dynamic full adder design
- Jou, Chen, et al.
(Show Context)
Citation Context ...ues to reduce power dissipation and improve performance [16] - [19]. Another approach is to develop low-power 3-2 counters and 4-2 compressors, which are key components in parallel multipliers [20] - =-=[22]-=-. Although each of these techniques helps reduce power dissipation, further reductions will be needed for future digital signal processing systems. This paper examines reductions in power dissipation ... |

6 | Exploring multiplier architecture and layout for low power - Meier, Rutenbar, et al. - 1996 |

6 | A theoretical approach to estimation of bounds on power consumption in digital multipliers
- Satyanarayana, Parhi
- 1997
(Show Context)
Citation Context ...multipliers [3], [4] or tree multipliers [5] - [7]. For both types of parallel multipliers, Booth-encoding can be employed to reduce the number of partial products [8], [9]. Estimates given in [10] - =-=[12]-=- indicate that array multipliers dissipate more power than tree multipliers and that Booth-encoded multipliers dissipate more power than multipliers that are not Booth-encoded. Various techniques have... |

6 |
Design of high-speed low-power 3-2 counter and 4-2 compressor for fast multipliers
- Hsiao, Jiang, et al.
- 1998
(Show Context)
Citation Context ...techniques to reduce power dissipation and improve performance [16] - [19]. Another approach is to develop low-power 3-2 counters and 4-2 compressors, which are key components in parallel multipliers =-=[20]-=- - [22]. Although each of these techniques helps reduce power dissipation, further reductions will be needed for future digital signal processing systems. This paper examines reductions in power dissi... |

2 | Elmasry, "Circuit Techniques for CMOS Low-Power HighPerformance Multipliers - Abu-Khater, Bellaouar, et al. - 1996 |

2 | Using truncated multipliers - Walters, Schulte - 2003 |

1 |
A 40 ns 17-bit Array Multiplier
- Peraris
- 1971
(Show Context)
Citation Context ...tor counts, clock frequencies, and the desire for portability increase, so does the need for low-power parallel multipliers. Parallel multipliers are typically implemented as either array multipliers =-=[3]-=-, [4] or tree multipliers [5] - [7]. For both types of parallel multipliers, Booth-encoding can be employed to reduce the number of partial products [8], [9]. Estimates given in [10] - [12] indicate t... |

1 |
O'Shaughnessey, "A Monolithic 16 by 16 Digital Multiplier
- McIver, Miller, et al.
- 1974
(Show Context)
Citation Context ...ounts, clock frequencies, and the desire for portability increase, so does the need for low-power parallel multipliers. Parallel multipliers are typically implemented as either array multipliers [3], =-=[4]-=- or tree multipliers [5] - [7]. For both types of parallel multipliers, Booth-encoding can be employed to reduce the number of partial products [8], [9]. Estimates given in [10] - [12] indicate that a... |

1 |
et al., "A High Speed and Low Power CMOS/SOS Multiplier-Accumulator
- Iwamura
- 1983
(Show Context)
Citation Context ...eliminating spurious transitions [13] - [15]. Other research has focused on developing novel multiplier architectures and sign-extension techniques to reduce power dissipation and improve performance =-=[16]-=- - [19]. Another approach is to develop low-power 3-2 counters and 4-2 compressors, which are key components in parallel multipliers [20] - [22]. Although each of these techniques helps reduce power d... |

1 | Low Power Digital Multipliers," in Application Specific Processors - Angel - 1997 |

1 |
O'Shaughnessey, \A Monolithic 16 by 16 Digital Multiplier
- McIver, Miller, et al.
- 1974
(Show Context)
Citation Context ...counts, clock frequencies, and the desire for portability increase, so does the need for low-power parallel multipliers. Parallel multipliers are typically implemented as either arraymultipliers [3], =-=[4]-=- or tree multipliers [5]-[7]. For both types of parallel multipliers, Booth-encoding can be employed to reduce the number of partial products [8], [9]. Estimates given in [10] - [12] indicate that arr... |

1 |
et al., \A High Speed and Low Power CMOS/SOS Multiplier-Accumulator
- Iwamura
- 1983
(Show Context)
Citation Context ...eliminating spurious transitions [13] - [15]. Other research has focused on developing novel multiplier architectures and sign-extension techniques to reduce power dissipation and improve performance =-=[16]-=- - [19]. Another approach is to develop low-power 3-2 counters and 4-2 compressors, which are key components in parallel multipliers [20] - [22]. Although each of these techniques helps reduce power d... |

1 | Area-E cient Multipliers for Digital Signal Processing Applications - Kidambi, El-Guibaly, et al. - 1996 |

1 |
Data-dependentTruncated Scheme for Parallel Multiplication
- King, Swartzlander
- 1998
(Show Context)
Citation Context ...tipliers are used to produce the product. In many computer systems, the 2n-bit products produced by the parallel multipliers are rounded to n bits to avoid growth in word size. As presented in [23] - =-=[26]-=-, truncated multiplication provides an e cient method for reducing the hardware requirements of rounded parallel multipliers. With truncated multiplication, only the n + k most signi cant columns of t... |

1 |
Circuit and Architecture Trade-o s for High-Speed Multiplication
- Song, Micheli
- 1991
(Show Context)
Citation Context ...n be achieved by multiplier trees that use other methods for reducing the partial product, such asWallace tree multipliers [5] or multipliers that use compressors or higher order counters [28], [29], =-=[30]-=-. Figure 3b shows the dot diagram of an 8 by 8 truncated Dadda multiplier, which uses the Constant Correction Truncated Multiplication method [24]. For this multiplier, n = 8 and k =3, so the t = 5 le... |