Skip to main content

Power Optimization of Parallel Multipliers in Systems with Variable Word-Length

  • Conference paper
  • 1391 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5349))

Abstract

Parallel multipliers can be optimized using the intrinsic arithmetic equivalencies in their reduction-tree. In this paper, we propose a method to reduce the dynamic power consumption in parallel multipliers, operating within systems with effective word-length variation. Word-length variation induces a certain pattern of spatiotemporal correlations. The proposed method is capable to take such correlations into account resulting better solutions. The experimental results show about 16-21% reduction in the average number of transitions compared to random parallel multipliers.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baugh, C.R., Wooley, B.A.: A two’s complement parallel array multiplication algorithm. IEEE Trans. Computers C-22, 1045–1047 (1973)

    Article  MATH  Google Scholar 

  2. Bickerstaff, K.C., Schulte, M.J., Swartzlander Jr., E.E.: Reduced area multipliers. In: Proc. Intr. Conf. on App.-Specific Array Processors, pp. 478–489 (1993)

    Google Scholar 

  3. Chittamuru, J., Burleson, W., Euh, J.: Dynamic wordlength variation for low-power 3D graphics texture mapping. In: IEEE Workshop on Signal Processing Systems, pp. 251–256 (2003)

    Google Scholar 

  4. Ercegovac, M.D., Lang, T.: Digital Arithmetic. Morgan Kaufmann Publ., San Francisco (2004)

    Google Scholar 

  5. Ercolani, S., Favalli, M., Damiani, M., Olivo, P., Riccó, B.: Estimate of signal probability in combinational logic networks. In: Proc. 1st European Test Conf., pp. 132–138 (1989)

    Google Scholar 

  6. Hatamian, M., Cash, G.L.: A 70-MHz 8-bit x 8 bit parallel pipelined multiplier in 2.5-μm CMOS. IEEE J. Solid-State Circ. SC-21(4), 505–513 (1986)

    Article  Google Scholar 

  7. Khoo, K.-Y., Yu, Z., Willson, A.N.: Bit-level arithmetic optimization for carry-save additions. In: Proc. IEEE/ACM Intr. Conf. on Computer-Aided Design, pp. 14–19 (1999)

    Google Scholar 

  8. Landman, P.E., Rabaey, J.M.: Architectural power analysis: the dual bit type method. IEEE Trans. Very Large Scale Integr. Syst. 3(2), 173–187 (1995)

    Article  Google Scholar 

  9. Ling, W., Savaria, Y.: Variable-precision multiplier for equalizer with adaptive modulation. In: Proc. 47th Midwest Symp. Circuits and Syst., pp. I–553–I–556 (2004)

    Google Scholar 

  10. Muroyama, K.T.M., Yamaguchi, S., Yasuura, H.: A design method for a low power equalization circuit by adaptive bitwidth control. In: IEEE Intr. Symp. Communications and Information Technology, pp. 704–709 (2004)

    Google Scholar 

  11. Oklobdzija, V., Villeger, D., Liu, S.: A method for speed optimized partial product reduction and generation of fast parallel multipliers using an algorithmic approach. IEEE Trans. Computers 45(3), 294–306 (1996)

    Article  MATH  Google Scholar 

  12. Parhami, B.: Computer Arithmetic - Algorithms and Hardware Design. Oxford University Press, New York (2000)

    Google Scholar 

  13. Potkonjak, M., Rabaey, J.M.: Optimizing resource utilization using transformations. In: Proc. IEEE/ACM Intr. Conf. on Comp.-Aided Design, pp. 88–91 (1991)

    Google Scholar 

  14. Proakis, J., Manolakis, D.G.: Digital Signal Processing, Principles, Algorithms, and Aplications, 3rd edn. Prentice Hall, New Jersey (1996)

    Google Scholar 

  15. Ramprasad, S., Shanbhag, N.R., Hajj, I.N.: Analytical estimation of transition activity from word-level signal statistics. In: Proc. Design Automation Conf., pp. 582–587 (1997)

    Google Scholar 

  16. Tahmasbi Oskuii, S., Kjeldsberg, P.G., Aas, E.J.: Probabilistic gate-level power estimation using a novel waveform set method. In: Proc. 17th Great Lakes Symp. on VLSI, pp. 37–42 (March 2007)

    Google Scholar 

  17. Tahmasbi Oskuii, S., Kjeldsberg, P.G., Gustafsson, O.: Power optimized partial product reduction interconnect ordering in parallel multipliers. In: Proc. 25th IEEE Norchip Conf., Aalborg, Denmark (November 2007)

    Google Scholar 

  18. Yoshizawa, S., Miyanaga, Y.: Tunable wordlength architecture for a low power wireless OFDM demodulator. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E89-A(10), 2866–2873 (2006)

    Article  Google Scholar 

  19. Yu, Z., Wasserman, L., Willson, A.: A painless way to reduce power dissipation by over 18% in Booth-encoded carry-save array multipliers for DSP. In: Proc. IEEE Workshop Signal Processing Syst., pp. 571–580 (October 2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Oskuii, S.T., Kjeldsberg, P.G., Lundheim, L., Havashki, A. (2009). Power Optimization of Parallel Multipliers in Systems with Variable Word-Length. In: Svensson, L., Monteiro, J. (eds) Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation. PATMOS 2008. Lecture Notes in Computer Science, vol 5349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-95948-9_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-95948-9_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-95947-2

  • Online ISBN: 978-3-540-95948-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics