From 90328f21bc10b86cbec6a983a62cfbbe99248d74 Mon Sep 17 00:00:00 2001 From: lkcl Date: Sat, 19 Mar 2022 06:34:31 +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 f298a80f9..2e731402e 100644 --- a/openpower/sv/bitmanip.mdwn +++ b/openpower/sv/bitmanip.mdwn @@ -543,16 +543,16 @@ uint64_t gorc64(uint64_t RA, uint64_t RB) # Introductory Explanation for Carry-less and Galois Field arithmetic There are three completely separate types of Galois-Field-based -arithmetic that we implement which are not well explained even in introductory -literature. These are: +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, 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 (with characteristics similar to a prime number) + "reducing" polynomial (similar to a prime number) -further detailed explanations are provided below +further detailed and more precise explanations are provided below ## Polynomials with coefficients in `GF(2)` -- 2.30.2