Fast vector arithmetic over \(\mathbb{F}_3\) (Q2376835)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6180332
Language Label Description Also known as
default for all languages
No label defined
    English
    Fast vector arithmetic over \(\mathbb{F}_3\)
    scientific article; zbMATH DE number 6180332

      Statements

      Fast vector arithmetic over \(\mathbb{F}_3\) (English)
      0 references
      24 June 2013
      0 references
      The author discusses a new implementation of a fast vector arithmetic over the finite field \(\mathbb F_3\) based on inherent parallel 64-bit operations of modern CPUs. The vector operations are parallelized using a special trick, where every element of the field can be represented as a pair of bits. Moreover, the field operations can be emulated as combinations of standard machine instructions. Numerical tests show that the new implementation can be 10 times faster than the standard method using modular arithmetic on arrays of bytes.
      0 references
      fast vector arithmetic
      0 references
      \(GF(3)\)
      0 references
      64-bit operations
      0 references
      Hamming distance
      0 references
      dot product
      0 references
      numerical examples
      0 references
      parallel computation
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references