Low-Power Multiplier Using Input Data Partition 


Vol. 30,  No. 11, pp. 1092-1097, Nov.  2005


PDF
  Abstract

In this paper, we propose a low-power Booth multiplication which reduces the switching activities of partial products during multiplication process. Radix-4 Booth algorithm has a characteristic that produces the Booth encoded products with zero when input data have sequentially equal values (0 or 1). Therefore, partial products have higher chances of being zero when an input with a smaller effective dynamic range of two multiplication inputs is used as a multiplier data instead of a multiplicand. The proposed multiplier divides a multiplication expression into several multiplication expressions with smaller bits than those of an original input data, and each multiplication is computed independently for the Booth encoding. Finally, the results of each multiplication are added. This means that the proposed multiplier has a higher chance to have zero encoded products so that we can implement a low power multiplier with the smaller switching activity. Implementation results show the proposed multiplier can save maximally about 20% power dissipation than a previous Booth multiplier.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Park, J. Kim, W. Cho, "Low-Power Multiplier Using Input Data Partition," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 11, pp. 1092-1097, 2005. DOI: .

[ACM Style]

Jongsu Park, Jinsang Kim, and Won-Kyung Cho. 2005. Low-Power Multiplier Using Input Data Partition. The Journal of Korean Institute of Communications and Information Sciences, 30, 11, (2005), 1092-1097. DOI: .

[KICS Style]

Jongsu Park, Jinsang Kim, Won-Kyung Cho, "Low-Power Multiplier Using Input Data Partition," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 11, pp. 1092-1097, 11. 2005.