ВЫЧИСЛЕНИЕ ИНТЕГРАЛЬНЫХ ХАРАКТЕРИСТИК МИНИМАЛЬНО ИЗБЫТОЧНОГО МОДУЛЯРНОГО КОДА

The article is devoted to a perspective of optimization of the integrated and characteristic base of modular arithmetics (MA). It is shown that at the minimum code redundancy, this problem is successfully solved for a class of non-modular operations which are realized by means of interval and index characteristics and the interval and modular form of integers. Proposed is a new expanded algorithm of calculation of integrated characteristics of the minimally reductant modular code allowing one to build MA configurations both over the ranges of non-negative numbers and over the symmetric ranges. With a length of the minimally redundant modular code from 8 to 64 figures, the synthesized algorithm is superior to the known analogs for calculations connected with interval and index characteristics in time-consuming by a factor of 6–34.4 and in table memory-consuming by a factor 3.5–31.5.