From: lkcl Date: Sat, 7 May 2022 11:45:12 +0000 (+0100) Subject: (no commit message) X-Git-Tag: opf_rfc_ls005_v1~2333 X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=b68bf309e6b52d77f5ac5ca322b969c663e77367;p=libreriscv.git --- diff --git a/openpower/sv/SimpleV_rationale.mdwn b/openpower/sv/SimpleV_rationale.mdwn index f64d893d2..0b01436de 100644 --- a/openpower/sv/SimpleV_rationale.mdwn +++ b/openpower/sv/SimpleV_rationale.mdwn @@ -426,7 +426,9 @@ index transformation system where the normally sequentially-linear element access may be "Re-Mapped" to limited but algorithmic-tailored commonly-used deterministic schedules, for example Matrix Multiply, DCT, or FFT. A full in-register-file 5x7 Matrix Multiply or a 3x4 or -2x6 may be performed in as little as 4 instructions, one of which +2x6 with optional *in-place* transpose, mirroring or rotation +on any source or destination Matrix +may be performed in as little as 4 instructions, one of which is to zero-initialise the accumulator Vector used to store the result. If addition to another Matrix is also required then it is only three instructions. Not only that, but because the "Schedule" is an abstract