From b4f56d225aacc4d9a6a5d3434cf43c4636bdab61 Mon Sep 17 00:00:00 2001 From: lkcl Date: Sat, 19 Mar 2022 11:27:35 +0000 Subject: [PATCH] --- openpower/sv/bitmanip.mdwn | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/openpower/sv/bitmanip.mdwn b/openpower/sv/bitmanip.mdwn index 1f63d8bf7..1fc3275d3 100644 --- a/openpower/sv/bitmanip.mdwn +++ b/openpower/sv/bitmanip.mdwn @@ -546,11 +546,11 @@ There are three completely separate types of Galois-Field-based arithmetic that we implement which are not well explained even in introductory literature. A slightly oversimplified explanation is followed by more accurate descriptions: -* carry-less binary arithmetic. this is not actually a Galois Field, +* `GF(2)` 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 -* 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 +* `GF(p)` modulo arithmetic with a Prime number, these are "proper" Galois Fields +* `GF(2^N)` 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