From: lkcl <lkcl@web>
Date: Sun, 8 May 2022 13:41:46 +0000 (+0100)
Subject: (no commit message)
X-Git-Tag: opf_rfc_ls005_v1~2308
X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=2074f64843260add3cf0a988c538ad77f98549bd;p=libreriscv.git

---

diff --git a/openpower/sv/SimpleV_rationale.mdwn b/openpower/sv/SimpleV_rationale.mdwn
index 36e20150b..ae8ab2398 100644
--- a/openpower/sv/SimpleV_rationale.mdwn
+++ b/openpower/sv/SimpleV_rationale.mdwn
@@ -848,7 +848,7 @@ main CPU.  In this way a large Sparse Matrix Multiply or Convolution
 may be achieved without having to pass unnecessary data through
 L1/L2/L3 Caches only to find, at the CPU, that it is zero.
 
-**Use-case: More powerful PEs in-memory**
+**Use-case: More powerful in-memory PEs**
 
 An obvious variant of the above is that, if there is inherently
 more parallelism in the data set, then the PEs get their own