From 01a7e93adf49de4cea18bfb6e3f2f39d8533033d Mon Sep 17 00:00:00 2001 From: lkcl Date: Sat, 19 Mar 2022 06:52:44 +0000 Subject: [PATCH] --- openpower/sv/bitmanip.mdwn | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/openpower/sv/bitmanip.mdwn b/openpower/sv/bitmanip.mdwn index 2c73eb108..1f63d8bf7 100644 --- a/openpower/sv/bitmanip.mdwn +++ b/openpower/sv/bitmanip.mdwn @@ -549,8 +549,9 @@ is followed by more accurate descriptions: * carry-less binary arithmetic. this is not actually a Galois Field, but is accidentally referred to as GF(2) - see below as to why. * modulo arithmetic with a Prime number, these are "proper" Galois Fields -* modulo arithmetic with two limits: a power-of-2 (2^N) and a second - "reducing" polynomial (similar to a prime number) +* carry-less binary arithmetic with two limits: modulo a power-of-2 (2^N) + and a second "reducing" polynomial (similar to a prime number), these + are said to be GF(2^N) arithmetic. further detailed and more precise explanations are provided below -- 2.30.2