Geodesic
Features of machine arithmetics of high-performance modular computing structures
Journal of the Belarusian State University. Mathematics and Informatics, Tome 2 (2023), pp. 94-101.

Voir la notice de l'article provenant de la source Math-Net.Ru

The procedures for generating a modular code for various variants of modular number systems are herein considered. The features of machine arithmetic of the basic integral characteristics of the modular code are noted. Proof of the theorem on minimally redundant modular coding is proposed as an effective way to reduce the time of computing the integral characteristics of a modular code. It is shown that the introduction of minimal redundancy into a modular code greatly simplifies the calculation of interval-index characteristics and related forms of representing integers when implementing a number of non-modular operations. We noted a certain decrease in the efficiency of minimally redundant modular number systems if the number of integral characteristics of the modular code, the sign of the number or digits of the polyadic code increases in the used applications. This circumstance does not reduce the expediency of using minimally redundant modular number systems in a wide range of applications of minimally redundant modular arithmetics, including digital signal processing, information security, information technology, etc.
Keywords: modular arithmetics; minimally redundant modular code; integral characteristics of minimally redundant modular code. 
@article{BGUMI_2023_2_a8,
     author = {A. F. Chernyavsky and E. I. Kozlova and A. A. Kolyada},
     title = {Features of machine arithmetics of high-performance modular computing structures},
     journal = {Journal of the Belarusian State University. Mathematics and Informatics},
     pages = {94--101},
     publisher = {mathdoc},
     volume = {2},
     year = {2023},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/BGUMI_2023_2_a8/}
}
TY  - JOUR
AU  - A. F. Chernyavsky
AU  - E. I. Kozlova
AU  - A. A. Kolyada
TI  - Features of machine arithmetics of high-performance modular computing structures
JO  - Journal of the Belarusian State University. Mathematics and Informatics
PY  - 2023
SP  - 94
EP  - 101
VL  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/BGUMI_2023_2_a8/
LA  - ru
ID  - BGUMI_2023_2_a8
ER  - 
%0 Journal Article
%A A. F. Chernyavsky
%A E. I. Kozlova
%A A. A. Kolyada
%T Features of machine arithmetics of high-performance modular computing structures
%J Journal of the Belarusian State University. Mathematics and Informatics
%D 2023
%P 94-101
%V 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/BGUMI_2023_2_a8/
%G ru
%F BGUMI_2023_2_a8
A. F. Chernyavsky; E. I. Kozlova; A. A. Kolyada. Features of machine arithmetics of high-performance modular computing structures. Journal of the Belarusian State University. Mathematics and Informatics, Tome 2 (2023), pp. 94-101. http://geodesic.mathdoc.fr/item/BGUMI_2023_2_a8/

[1] A. F. Chernyavskii, A. M. Aksenov, A. A. Kolyada, V. V. Revinskii, E. V. Shabinskaya, “Multiprotsessornaya realizatsiya algoritma Vinograda dlya DPF na osnove minimalno izbytochnoi modulyarnoi arifmetiki”, Informatika, 4 (2005), 78–86

[2] A. A. Kolyada, A. F. Chernyavskii, “Obschaya tekhnologiya vychisleniya integralnykh kharakteristik modulyarnogo koda”, Doklady Natsionalnoi akademii nauk Belarusi, 52(4) (2008), 38–44 | MR | Zbl

[3] A. F. Chernyavskii, A. A. Kolyada, “Metod i algoritm masshtabirovaniya v minimalno izbytochnoi modulyarnoi sisteme schisleniya”, Doklady Natsionalnoi akademii nauk Belarusi, 53(3) (2009), 29–37 | MR | Zbl

[4] A. F. Chernyavskii, A. A. Kolyada, “Umnozhenie po bolshim prostym modulyam na osnove minimalno izbytochnoi modulyarnoi skhemy Barretta”, Doklady Natsionalnoi akademii nauk Belarusi, 54(2) (2010), 40–53 | MR | Zbl

[5] A. A. Kolyada, A. F. Chernyavskii, “Integralno-kharakteristicheskaya baza modulyarnykh sistem schisleniya”, Informatika, 1 (2013), 106–119

[6] A. F. Chernyavskii, A. A. Kolyada, N. A. Kolyada, E. V. Shabinskaya, “Intervalno-indeksnaya tekhnologiya rasshireniya modulyarnogo koda”, Elektronika info, 6 (2010), 66–71

[7] A. F. Chernyavskii, A. A. Kolyada, N. A. Kolyada, E. V. Shabinskaya, “Umnozhenie po bolshim modulyam metodom Montgomeri s primeneniem minimalno izbytochnoi modulyarnoi arifmetiki”, Neirokompyutery. razrabotka, primenenie, 9 (2010), 3–8

[8] A. A. Kolyada, A. F. Chernyavskii, “Intervalno-indeksnyi metod chetnogo modulya dlya rascheta integralnykh kharakteristik koda neizbytochnoi MSS s simmetrichnym diapazonom”, Doklady Natsionalnoi akademii nauk Belarusi, 57(1) (2013), 38–45 | Zbl

[9] N. I. Chervyakov, A. A. Kolyada, P. A. Lyakhov, Modulyarnaya arifmetika i ee prilozheniya v infokommunikatsionnykh tekhnologiyakh, Fizmatlit, Moskva, 2017, 400 pp.