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

From MaRDI portal
Revision as of 08:02, 14 February 2024 by RedirectionBot (talk | contribs) (‎Removed claims)
scientific article
Language Label Description Also known as
English
Fast vector arithmetic over \(\mathbb{F}_3\)
scientific article

    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

    Identifiers

    0 references
    0 references
    0 references
    0 references