THE HIGH-SPEED ALGORITHM OF DIVISION OF MODULAR NUMBERS BASED ON CHINESE REMINDER THEOREM WITH FRACTIONS

THE HIGH-SPEED ALGORITHM OF DIVISION OF MODULAR NUMBERS BASED ON CHINESE REMINDER THEOREM WITH FRACTIONS

The paper about a new algorithm for division the numbers represented in the residue number system. This algorithm is based on a new Chinese Reminder Theorem with fractional numbers, which made it possible to significantly accelerate the operations. The paper gives the detailed description of the alg...

Full description

Saved in:
Bibliographic Details
Main Authors: Nikolay Ivanovich Chervyakov, Pavel Alekseevich Lyakhov, Irina Nikolaevna Lavrinenko, Maxim Anatolievich Deryabin
Format: Article
Language:Russian
Published: North-Caucasus Federal University 2022-10-01
Series:Современная наука и инновации
Subjects:
алгоритм
система остаточных классов
модулярная арифметика
деление
algorithm
residue number system
modular arithmetic
division
Online Access:https://msi.elpub.ru/jour/article/view/633
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://msi.elpub.ru/jour/article/view/633

Similar Items