Skip to main content

Efficient Constant Coefficient Multiplication Using Advanced FPGA Architectures

  • Conference paper
  • First Online:
Field-Programmable Logic and Applications (FPL 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2147))

Included in the following conference series:

Abstract

Constant coefficient multiplication using look-up tables is a popular form of multiplication in FPGAs. The ample look-up table resources found within the FPGA match well to the architecture of a look-up table based multiplier. While this form of multiplication maps well to FPGAs, it isn’t particularly efficient. This paper presents an efficient variant of this multiplier using the advanced features of the Xilinx Virtex FPGA. Specifically, this approach combines the look-up and add operations required by this multiplier architecture.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ken Chapman, “Constant coefficient multipliers for the XC4000E,” Tech. Rep. XAPP 054, Xilinx Corporation, December 11 1996, Version 1.1.

    Google Scholar 

  2. Kenneth David Chapman, “Fast integer multipliers fit in FPGA’s,” EDN, pp. 79–80, May 12 1994.

    Google Scholar 

  3. Florent de Dinchin and Vincent Lefèvre, “Constant multipliers for FPGAs,” in Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, H.R. Arabnia, Ed. June 2000, vol. I, pp. 167–173, CSREA Press.

    Google Scholar 

  4. Tim Courtney, Richard Turner, and Roger Woods, “Multiplexer based reconfiguration for Virtex multipliers,” in Field-Programmable Logic and Applications. Proceedings of the 9th International Workshop, FPL 2000, 2000, pp. 749–758.

    Google Scholar 

  5. Xilinx Corporation, Virtex-II 1.5V Field-Programmable Gate Arrays, January 2001, DS031-2 (v1.3).

    Google Scholar 

  6. B. Hutchings, P. Bellows, J. Hawkins, S. Hemmert, B. Nelson, and M. Rytting, “A cad suite for high-performance fpga design,” in Proceedings of the IEEE Workshop on FPGAs for Custom Computing Machines, K. L. Pocek and J. M. Arnold, Eds., Napa, CA, April 1999, IEEE Computer Society, pp. 12–24, IEEE.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wirthlin, M.J., McMurtrey, B. (2001). Efficient Constant Coefficient Multiplication Using Advanced FPGA Architectures. In: Brebner, G., Woods, R. (eds) Field-Programmable Logic and Applications. FPL 2001. Lecture Notes in Computer Science, vol 2147. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44687-7_57

Download citation

  • DOI: https://doi.org/10.1007/3-540-44687-7_57

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42499-4

  • Online ISBN: 978-3-540-44687-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics