[Libre-soc-bugs] [Bug 784] Implement cl* instructions for carry-less operations

[bugzilla-daemon at libre-soc.org]

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

--- Comment #34 from Jacob Lifshay <programmerjake at gmail.com> ---
I found a fast algorithm for division of polynomials with finite-field
coefficients assuming we have fast multiplication:
https://people.csail.mit.edu/madhu/ST12/scribe/lect06.pdf

Found it here:
https://math.stackexchange.com/q/1475206/204761

this could let cldiv/clrem be expressed with a few clmul ops -- much faster
than iterating over each bit of the quotient serially.

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