NUMERAL SCALING METHODS IN MODULAR ARITHMETIC: REVIEW, DEVELOPMENT AND ESTIMATION OF THE ALGORITHMS COMPLEXITY

Abstract

The study describes two methods of numeral scaling in a modular number system: one which is based on the interval estimation and the other one which uses iterative algorithm of scaling number X by the coefficient K and includes both the stage of base system expansion and the scaling stage itself. The authors demonstrate the examples and results of algorithms operation provided by the programs developed via Python that simulate algorithms execution on a computer. Estimates of the algorithms complexity were defined in order to compare them and to detect the most appropriate ones.