[Libre-soc-isa] [Bug 817] Big Integer Math (sv.adde, sv.subfe, sv.madded, 128 by 64-bit -> 64-bit div/rem, maybe more...)

[bugzilla-daemon at libre-soc.org]

https://bugs.libre-soc.org/show_bug.cgi?id=817

Jacob Lifshay <programmerjake at gmail.com> changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
           See Also|                            |https://bugs.libre-soc.org/
                   |                            |show_bug.cgi?id=784

--- Comment #6 from Jacob Lifshay <programmerjake at gmail.com> ---
see also:
https://en.wikipedia.org/wiki/Methods_of_computing_square_roots#Goldschmidt%E2%80%99s_algorithm

another thing worth researching is: can goldschmidt's division algorithm be
modified to work for polynomials over gf(2) (carry-less division/remainder)?

-- 
You are receiving this mail because:
You are on the CC list for the bug.