[Libre-soc-bugs] [Bug 942] next things to work on -- bigint rsa mul algorithm for bigint presentation

[bugzilla-daemon at libre-soc.org]

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

--- Comment #8 from Luke Kenneth Casson Leighton <lkcl at lkcl.net> ---
(In reply to Jacob Lifshay from comment #7)

> no, i mean like the matrix equivalent of 1 / x.
> https://en.wikipedia.org/wiki/Invertible_matrix
> it happens as part of generating the assembly program for toom-cook so using
> svp64 isn't helpful there.

hey i remember doing those, urr 35 years ago so uhn not so helpful :)
i have vague recollections about calculating them 

https://stackoverflow.com/questions/32114054/matrix-inversion-without-numpy#51214047

that looks pretty reasonable, still using matrix remap schedules,
including the triple loop

                for k in range(2*n_Columns):
                    Matrix[j][k] = Matrix[j][k] - ratio * Matrix[i][k]

with matrix remap you *don't* have to set the same target regs as is
set in the example, you can use svremap to arbitrarily target any
operation and any regs *in* that operation.

the use of predication would be hairraising though.

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