Skip to main content
SpringerLink
Log in

Sequential Large Multipliers on FPGAs

  • Published:
Journal of Signal Processing Systems Aims and scope Submit manuscript

Abstract

Large operands are used in modern cryptography, signal processing and multimedia applications. Multiplication is one of the most used operations in these applications. The multiplication of the large operands is performed by a large multiplier hardware to achieve high speed. These circuits can be designed by using embedded arithmetic blocks offered by the state of the art FPGAs. In this paper, sequential large multiplier designs that can be mapped on these platforms are presented. Three design algorithms are proposed which differ depending on the use of the FPGA resources. 64-bit to 2048-bit multiplier implementations for these algorithms are modeled and synthesized. Compared to a fully combinational 256-bit multiplier the proposed 256-bit multiplier uses 15 times less resources and has 1.94 times more delay.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10

Similar content being viewed by others

References

  • Athow, J.L., & Al-Khalili, A.J. (2008). Implementation of large-integer hardware multiplier in Xilinx FPGA. 15th IEEE international conference on electronics, circuits and systems, ICECS 2008 (pp. 1300–1303).

  • Barker, E., Barker, W., Burr, W., Polk, W., Smid, M. (2007). NIST SP800-57: Recommendation for key management Part 1: General(Revised), http://csrc.nist.gov/publications/nistpubs/800-57/sp800-57-Part1-revised2∖_Mar08-2007.pdf, NIST.

  • de Dinechin, F., & Pasca, B. (2009). Large multipliers with fewer DSP blocks (pp. 250–255). FPL.

  • Gao, S., Al-Khalili, D., Chabini, N., Langlois, P. (2010). FPGA-based efficient design approaches for large size twos complement squarers. Journal of Signal Processing Systems, 58, 3–15.

  • Gao, S., Al-Khalili, D., Chabini, N., Langlois, J.M.P. (2012). Asymmetric large size multipliers with optimised FPGA resource utilisation. IET Computers & Digital Techniques, 6, 372– 383.

  • GNU (2012). The GNU multiple precision arithmetic library. http://www.gmplib.org.

  • Gök, M., & Özbilen, M. M. (2008). Multi-functional floating-point MAF designs with dot product support. Microelectronics Journal, 39, 30–43.

  • Jaiswal, M.K., & Cheung, R.C. (2012). Area-efficient architectures for large integer and quadruple-precision floating point multipliers. 2012 IEEE 20th annual international symposium on field-programmable custom computing machines (FCCM) (pp. 25–28).

  • Karatsuba, A., & Ofman, Y. (1963). Multiplication of multidigit numbers on automata. Soviet Physics Doklady, 7, 595.

  • Lapsley, P., Bier, J., Lee, E.A., Shoham, A. (1996). DSP processor fundamentals: Architectures and features. Wiley-IEEE Press.

  • Lee, B. R., & Burgess, N. (2003). Improved small multiplier based multiplication. Squaring and Division, FCCM, 91.

  • ManishKumar, J., & Cheung, R.C.C. (2013). VLSI implementation of double-precision floating-point multiplier using karatsuba technique. Circuits, Systems, and Signal Processing, 32, 15– 27.

  • Menezes, A. J., Vanstone, S. A., Van Oorschot, P. C. (1996). Handbook of applied cryptography. Boca Raton: CRC Press, Inc.

  • National Institute of Standards and Technology (U.S.) (2009). Digital Signature Standard (DSS) [electronic resource], http://nla.gov.au/nla.cat-vn4930176.

  • Nedjah, N., & Mourelle, L.M. (2003). Fast less recursive hardware for large number multiplication using Karatsuba-Ofmans Algorithm. Lecture Notes in Computer Science, 2869, 43–50.

  • Nvidia (2008). CUDA, programming guide. http://www.nvidia.com.

  • Oksuzoglu, E., & Savas, E. (2008). Parametric, secure and compact implementation of RSA on FPGA. International conference on reconfigurable computing and FPGAs, ReConFig ’08. (pp. 391–396). Cancun, Mexico.

  • Patterson, D. A., & Hennessy, J. L. (2013). Computer organization and design: The hardware/software interface. Newness.

  • Quan, G., Davis, J.P., Devarkal, S., Buell, D.A. (2005). High-level synthesis for large bit-width multipliers on FPGAs: a case study. Proceedings of the 3rd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis (pp. 213–218). ACM.

  • Senturk, A., & Gok, M. (2012). Pipelined large multiplier designs on FPGAs. Proceedings of the 15th EUROMICRO conference on digital system design (DSD). Cesme, Izmir, Turkey.

  • Srinath, S., & Compton, K. (2010). Automatic generation of high-performance multipliers for FPGAs with asymmetric multiplier blocks. Proceedings of the 18th annual ACM/SIGDA international symposium on field programmable gate arrays (pp. 51–58). New York, USA: ACM.

Download references

Author information

Authors and Affiliations

  1. The Department of Computer Engineering, Cukurova University, Adana, Turkey

    Ali Senturk

  2. The Department of Electrical and Electronics Engineering, Cukurova University, Adana, Turkey

    Mustafa Gok

Authors
  1. Ali Senturk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mustafa Gok
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ali Senturk.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Senturk, A., Gok, M. Sequential Large Multipliers on FPGAs. J Sign Process Syst 81, 137–152 (2015). https://doi.org/10.1007/s11265-014-0912-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11265-014-0912-1

Keywords

Search

Navigation