Journals / Çukurova Üniversitesi Mühendislik-Mimarlik Fakültesi Dergisi / 2014 / Cilt: 29 - Sayı: 1

Large Sequential Integer Squarers for FPGAs

FPGA'lar için Ardışık Büyük Tam Sayı Kare Alıcılar

Pages
157–164
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

The syntheses results show that compared to sequential large multipliers presented in the previous researches, Sequential Large Integer Squarers consume almost same resources and have up to 62% higher performance.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:This paper presents sequential large integer squarer designs for FPGAs.
📊
Key Findings & Data:The design can generate a full size or a single size product.
💡
Conclusion & Impact:The syntheses results show that compared to sequential large multipliers presented in the previous researches, Sequential Large Integer Squarers consume almost same resources and have up to 62% higher performance.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

This paper presents sequential large integer squarer designs for FPGAs. The design is pipelined and uses embedded multiplier blocks which exist in most modern FPGAs. More efficient use of embedded multipliers is provided with the decomposition method which we developed in the design. The design can generate a full size or a single size product. The syntheses results show that compared to sequential large multipliers presented in the previous researches, Sequential Large Integer Squarers consume almost same resources and have up to 62% higher performance.

Özet

Bu çalışmada FPGA'lar için ardışık büyük tam sayı kare alıcı tasarımı gösterilmiştir. Tasarım boru hatlı yapıdadır ve çoğu modern FPGA'larda bulunan gömülü çarpıcıları kullanmaktadır. Tasarımda, geliştirdiğimiz ayrıştırma yöntemi ile gömülü çarpıcıların daha verimli kullanılması sağlanmıştır. Tasarım yarım veya tam büyüklükte sonuç üretebilmektedir. Sentez sonuçları, Ardışık Büyük Tam Sayı Kare Alıcı uygulamalarının, önceki çalışmalarda gösterilen ardışık büyük çarpıcılarla yaklaşık aynı kaynak tüketimine sahip olmasına rağmen, %62'ye varan yüksek performans kazançları sergilediğini göstermiştir.

🔖

Cite This Article

ŞENTÜRK, A., GÖK, M. (2014). Large Sequential Integer Squarers for FPGAs. Çukurova Üniversitesi Mühendislik-Mimarlik Fakültesi Dergisi, Cilt: 29 - Sayı: 1, 157–164. https://ajindex.com/articles/350718

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (9)

  1. N. Koblitz, 1987. Elliptic Curve Cryptosystems, Mathematics of Computation, 48, s. 203-209
  2. R. L. Rivest, A. Shamir, and L. Adleman, 1978. "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems," Communications of the ACM, 21, s. 120-126
  3. V. S. Miller, 1986. Use of Elliptic Curves in Cryptography, in Advances in Cryptology-- CRYPTO'85 Proceedings, s. 417-426
  4. GMP. 2014. The GNU Multiple Precision Arithmetic Library, Version 6.0.
  5. T.-J. Chang, C.-L. Wu, D.-C. Lou, and C.-Y. Chen, 2009. A Low-Complexity LUT-Based Squaring Algorithm, Computers & Mathematics with Applications, 57, s. 1494- 1501
  6. S. Gao, N. Chabini, D. Al-Khalili, and P. Langlois, 2007. Optimised Realisations of Large Integer Multipliers and Squarers Using Embedded Blocks, IET Computers & Digital Techniques, 1, s. 9-16
  7. J. L. Athow and A. J. Al-Khalili, 2008. Implementation of Large-Integer Hardware Multiplier in Xilinx FPGA, in Electronics, Circuits and Systems, 2008. ICECS 2008. 15th IEEE International Conference on, s. 1300- 1303
  8. S. Xu, S. A. Fahmy, and I. V. McLoughlin, 2013. Efficient Large Integer Squarers on FPGA, in Field-Programmable Custom Computing Machines (FCCM), 2013 IEEE 21st Annual International Symposium on, s. 198-201
  9. A. Senturk and M. Gok, 2012. Pipelined Large Multiplier Designs on FPGAs, in Digital System Design (DSD), 2012 15th Euromicro Conference on, s. 809-814.