Skip to main content

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 222))

  • 1636 Accesses

Abstract

Matrix multiplication requires a large number of operations, demanding for high performance computing. In order to complete the matrix multiplication in one clock cycle, a designer can utilize multiple multipliers. However, this approach is inefficient in terms of hardware area and power consumption. Therefore, it is important to find out the way to complete the multiplication that is fast and uses hardware resources properly. In this paper, we introduce the way to reduce the number of multipliers and provide the hardware overhead and performance of matrix multiplication on FPGA.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

References

  1. Strassen V (1969) Gaussian elimination is not optimal. Numer Math 13:354–356

    Article  MathSciNet  MATH  Google Scholar 

  2. Choi J (1997) A fast scalable universal matrix multiplication algorithm on distributed-memory concurrent computers. In: Proceedings of the 11th international symposium on parallel processing

    Google Scholar 

  3. Bensaali F, Amira A, Bouridane A (2005) Accelerating matrix product on reconfigurable hardware for image processing applications, circuits, devices and systems. In: IEEE Proceedings 3 June 2005

    Google Scholar 

  4. Lin CY (2011) A model for matrix multiplication performance on FPGAs. In: 21st international conference on field programmable logic and applications

    Google Scholar 

  5. Al-Qadi Z, Aqel M (2009) Performance analysis of parallel matrix multiplication algorithms used in image processing. World Appl Sci J

    Google Scholar 

Download references

Acknowledgments

This study was supported by Seoul National University of Science and Technology, Korea.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Seung Eun Lee .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer India

About this paper

Cite this paper

Lee, J.S., Kim, S.D., Jeong, Y.S., Lee, S.E. (2013). Hardware Overhead vs. Performance of Matrix Multiplication on FPGA. In: S, M., Kumar, S. (eds) Proceedings of the Fourth International Conference on Signal and Image Processing 2012 (ICSIP 2012). Lecture Notes in Electrical Engineering, vol 222. Springer, India. https://doi.org/10.1007/978-81-322-1000-9_28

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-1000-9_28

  • Published:

  • Publisher Name: Springer, India

  • Print ISBN: 978-81-322-0999-7

  • Online ISBN: 978-81-322-1000-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics