FPGA Implementation of Floating-Point Significand Multiplier
Artem Didenko, Irina Zeleneva
III International Scientific and Practical Conference Theoretical and Applied Aspects of Device Development on Microcontrollers and FPGAs (MC&FPGA), Kharkiv, Ukraine, 2021, pp. 13-14.
Abstract
Development of high-performance computational devices needs fast methods of operations with numbers which are presented in floating-point format. One of the most common approaches to build a significand multiplier is using a Wallace CSA-adder tree structure which shows good performance in adding partial sums. Significand multiplier was implemented in FPGA as a part of floating-point multiplier which works with single precision numbers in IEEE-754 standard.
Keywords: multiplier, floating-point number, carry-save adder, FPGA.
Full Text: PDF
References
- Leong, P. Recent Trends in FPGA Architectures and Applications / P.H.W. Leong // 4th IEEE International Symposium on Electronic Design, Test and Applications (delta 2008), Hong Kong, 23-25 January 2008: proceedings. – Los Alamitos: IEEE, 2008. – pp.137–141.
- Asano, S. Performance comparison of FPGA, GPU and CPU in image processing / S. Asano, T. Maruyama, Y. Yamaguchi // 2009 International Conference on Field Programmable Logic and Applications, Prague, 31 August – 2 September 2009 : proceedings. – Los Alamitos: IEEE, 2009. – P.126 –131.
- Bečvář M. Fixed-Point Arithmetic in FPGA / M. Bečvář, P. Štukjunger // Acta Polytechnica Vol. 45 No. 2/2005. – pp. 67–72.
- Parhami, B. Computer Arithmetic: Algorithms and Hardware Designs, 2nd edition / B. Parhami. – New York : Oxford University Press, 2010. – 672 p.
- Koren, I. Computer Arithmetic Algorithms 2nd Edition / I. Koren. – Natick : A K Peters/CRC Press, 2001. – 296 p.