Multiplicative square root algorithms for FPGAs - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Multiplicative square root algorithms for FPGAs

(1, 2) , (1, 2) , (2, 1) , (1, 2)


Most current square root implementations for FPGAs use a digit recurrence algorithm which is well suited to their LUT structure. However, recent computing-oriented FPGAs include embedded multipliers and RAM blocks which can also be used to implement quadratic convergence algorithms, very high radix digit recurrences, or polynomial approximation algorithms. The cost of these solutions is evaluated and compared, and a complete implementation of a polynomial approach is presented within the open-source FloPoCo framework. It allows a much shorter latency and a higher frequency than the classical approach. The cost of IEEE-compliant correct rounding using such approximation algorithms is shown to be very high, and faithful (last-bit accurate) operators are advocated in this case.


Fichier principal
Vignette du fichier
2010-sqrt.pdf (290.83 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

ensl-00475779 , version 1 (22-04-2010)
ensl-00475779 , version 2 (01-11-2010)



Florent de Dinechin, Mioara Maria Joldes, Bogdan Pasca, Guillaume Revy. Multiplicative square root algorithms for FPGAs. International Conference on Field Programmable Logic and Applications, Aug 2010, Milano, Italy. pp.14, ⟨10.1109/FPL.2010.112⟩. ⟨ensl-00475779v2⟩
255 View
2948 Download



Gmail Facebook Twitter LinkedIn More