[Libre-soc-bugs] [Bug 1155] O(n^2) multiplication REMAP mode(s)

[bugzilla-daemon at libre-soc.org]

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

--- Comment #20 from Jacob Lifshay <programmerjake at gmail.com> ---
(In reply to Jacob Lifshay from comment #19)
> we can take all the combinations that duplicate something already encodable
> in matrix mode and just declare them reserved, so at least 000 and 001, icr
> if matrix mode can produce a sequence like 000011112222333300001111... which
> would cover both 010 and 100 too.

if all 4 options with zero or one axis selected are redundant, then we can save
a bit and the encoding can be as follows:

00 x + y
01 x + z
10 y + z
11 x + y + z

basically we remove the bit for z and set it to 1 if x or y are set, otherwise
set z to 0 and x and y to 1.

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