Abstract
We present optimized algorithm for vector addition over finite prime fields using the extended vector registers of modern central processing units (CPU) and the corresponding extended Intel instruction sets SSE, AVX and AVX512. The presented algorithm is based on representation of the elements of the fields using unsigned 8-bit packed integer, thus allowing for computations over prime fields with up to 127 elements. The efficiency of the presented method is demonstrated in an algorithm for calculating the weight distribution of a linear code over the finite field which is known to be an NP-complete problem. An optimized approach for computing the weight of a vector is also given. The experimental results show faster execution times compared to the corresponding algorithms in the Magma and GUAVA package for GAP packages for finite fields larger than 3.
The research of the first author is partially supported by the Bulgarian National Science Fund under Contract No KP-06-H62/2/13.12.2022. The work of the second author is partially supported by the Bulgarian Ministry of Education and Science, grant no. DO1-325/01.12.2023 for NCHDC. The authors acknowledge also the access to the e-infrastructure provided by the Grant No. D01-325/01.12.2023 “National Centre for High Performance and Distributed Computing” of the Ministry of Education and Science of Bulgaria.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Intel64 and IA-32 Architectures Optimization Reference Manual. https://www.intel.com/content/www/us/en/developer/articles/technical/intel-sdm.html. Accessed 21 Feb 2023
Pashinska-Gadzheva, M., Bouyukliev, I.:LinCodeWeightInv: Library for Computing the Weight Distribution of Linear Codes Over Finite Fields, in preparation
Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system I: the user language. J. Symbolic Comput. 24, 235–265 (1997)
GAP package GUAVA. https://www.gap-system.org/Packages/guava.html. Accessed 21 Feb 2023
Lidl, R., Niederreiter, H.: Finite Fields, 2nd edn. Cambridge University Press, Cambridge (1997)
Bouyukliev, I., Bakoev, V.: A method for efficiently computing the number of codewords of fixed weights in linear codes. Discret. Appl. Math. 156, 2986–3004 (2008)
Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.: On the inherent intractability of certain coding problems. IEEE Trans. Inform. Theory 24, 384–386 (1978)
Coolsaet, K.: Fast vector arithmetic over F3. Bull. Belg. Math. Soc. Simon Stevin 20, 329–344 (2013)
Bouyukliev, I., Bakoev, V.: Efficient computing of some vector operations over GF(3) and GF(4). Serdica J. Comput. 2(2), 101–108 (2008)
Gottschlag, M., Brantsch, P., Bellosa F.: Automatic core specialization for AVX-512 applications. In: Proceedings of the 13th ACM International Systems and Storage Conference (SYSTOR 2020), pp. 25–35. Association for Computing Machinery (2020)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Pashinska-Gadzheva, M., Bouyukliev, I. (2024). About Methods of Vector Addition over Finite Fields Using Extended Vector Registers. In: Lirkov, I., Margenov, S. (eds) Large-Scale Scientific Computations. LSSC 2023. Lecture Notes in Computer Science, vol 13952. Springer, Cham. https://doi.org/10.1007/978-3-031-56208-2_44
Download citation
DOI: https://doi.org/10.1007/978-3-031-56208-2_44
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-56207-5
Online ISBN: 978-3-031-56208-2
eBook Packages: Computer ScienceComputer Science (R0)