From: lkcl <lkcl@web>
Date: Wed, 13 Apr 2022 09:14:46 +0000 (+0100)
Subject: (no commit message)
X-Git-Tag: opf_rfc_ls005_v1~2775
X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=f21a36c58b25ab41eba4f4be80e4a30663aa603b;p=libreriscv.git

---

diff --git a/openpower/sv/bitmanip/appendix.mdwn b/openpower/sv/bitmanip/appendix.mdwn
index fffd8c735..30c1ad5a8 100644
--- a/openpower/sv/bitmanip/appendix.mdwn
+++ b/openpower/sv/bitmanip/appendix.mdwn
@@ -1,5 +1,11 @@
 # big integer division
 
+links
+
+* <https://skanthak.homepage.t-online.de/division.html>
+* <https://news.ycombinator.com/item?id=26562819>
+* <https://gmplib.org/~tege/division-paper.pdf>
+
 the most efficient division algorithm is probably Knuth's Algorithm D (with modifications from the exercises section of his book) which is O(n^2) and uses 2N-by-N-bit div/rem
 
 an oversimplified version of the knuth algorithm d with 32-bit words is: