S. A. Inyutin A method for Calculating the Positional Characteristics of a Modular Representation with Linear Complexity
S. A. Inyutin A method for Calculating the Positional Characteristics of a Modular Representation with Linear Complexity

A method has been developed for selecting base modules for generating modular number systems and modular arithmetic, in which the calculation of the positional characteristic of the modular representation of a numerical quantity, which is a nonlinear function of many variables, is performed with linear complexity from the number of bases of the modular number system when calculated in the range of a single base of the modular system. This significantly reduces the bit depth (hence the amount of hardware) of additional modular processor blocks. Modular algorithmics previously lacked methods for calculating positional characteristics for such parameters. All non-modular (not parallelizable in modular arithmetic) operations of a specialized processor with multiple processor elements (data streams) and a single instruction stream are based on the calculation of positional characteristics. For numerical quantities in modular data formats, the method allows them to be performed with minimal linear complexity. The article substantiates the formulation of the problem and the goal of fast calculation of positional features in modular data encoding. A new method is described and justified. The results of numerical modeling of the method and examples of modular number systems allowing its use are presented. The analysis is given the obtained of new results.


modular arithmetic, modular number system, modular data formats, linear calculation complexity, positional characteristic, nonlinear function of many variables.

DOI 10.14357/20718632240111 


1. Akushsky I.Ya., Yuditsky D.I. Machine arithmetic in residual classes. Sovetskoe radio; 1968. 440p. (In Russ.)
2. Amerbaev V.M. Theoretical foundations of machine arithmetic. Nauka; 1976. 320p. (In Russ.).
3. Inyutin S.A. Modular algorithmics of multi-bit computing. Moscow: Izdatel’stvo MAI; 2020. 160 p. (In Russ.).
4. Mandelbaum D. Further Results Decoding Arithmetic Residue Codes. // Transaction on Information Theory, 1998,vol. IT – 24, N 5. P. 36-41.
5. Amerbaev V. M., Stempkovsky A.L., Soloviev R.A. Principles of recursive modular computing // Informacionnye tekhnologii. 2013. No. 2. pp. 22-27. (In Russ.).
6. David A., Patterson J., Hennessy L. Computer Organization and Design (Second Edition). London: Morgan Kaufmann Publishers; 2009. ISBN 1-55860-428-6, pp. 715.
7. Inyutin S.A. Method of calculating the quantitative characteristics of a modular quantity. Informacionnye tekhnologii. 2016; 22(5): pp. 343-347. (In Russ.).
8. Chervyakov N.I. Modular arithmetic and its applications in infocommunication technologies. FizMatLit. 2016; 395 p. (In Russ.).
9. Munro I. The Computational Complexity of Algebraic and Numeric Problems. New-York: American Elsevier pub. Co; 1986. 174 p.
10. Inyutin S.A. Method of calculating the characteristics of the order ratio for parallel data formats // Informacionnye tekhnologii. 2017; 23(8): pp. 569-574. (In Russ.).

2024 / 01
2023 / 04
2023 / 03
2023 / 02

© ФИЦ ИУ РАН 2008-2018. Создание сайта "РосИнтернет технологии".