Fast vector arithmetic over F₃
From MaRDI portal
Publication:2376835
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.
Recommendations
- Fast three-valued abstract bit-vector arithmetic
- Efficient computing of some vector operations over \(\mathrm{GF}(3)\) and \(\mathrm{GF}(4)\)
- scientific article; zbMATH DE number 4058734
- Software Implementation of Arithmetic in
- scientific article; zbMATH DE number 3940617
- Fast matrix multiplication and its algebraic neighbourhood
- Faster and lower memory scalar multiplication on supersingular curves in characteristic three
- Fast evaluation of vector splines in three dimensions
- Fast arithmetic for triangular sets: from theory to practice
- Fast arithmetic for triangular sets: from theory to practice
Cited in
(5)- Optimizing matrix operations in \(\mathbb Z_2\) by word packing
- Fast three-valued abstract bit-vector arithmetic
- Efficient computing of some vector operations over \(\mathrm{GF}(3)\) and \(\mathrm{GF}(4)\)
- Algorithm 1059: LinCodeWeightInv -- library for computing the weight distribution of linear codes over finite fields
- About methods of vector addition over finite fields using extended vector registers
This page was built for publication: Fast vector arithmetic over \(\mathbb{F}_3\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376835)
