A High-Speed Division Algorithm for Modular Numbers Based on the Chinese Remainder Theorem with Fractions and Its Hardware Implementation

A High-Speed Division Algorithm for Modular Numbers Based on the Chinese Remainder Theorem with Fractions and Its Hardware Implementation

In this paper, a new simplified iterative division algorithm for modular numbers that is optimized on the basis of the Chinese remainder theorem (CRT) with fractions is developed. It requires less computational resources than the CRT with integers and mixed radix number systems (MRNS). The main idea...

Full description

Bibliographic Details
Main Authors: Nikolai Chervyakov, Pavel Lyakhov, Mikhail Babenko, Anton Nazarov, Maxim Deryabin, Irina Lavrinenko, Anton Lavrinenko
Format: Article
Language:English
Published: MDPI AG 2019-02-01
Series:Electronics
Subjects:
division algorithm
residue number system
modular arithmetic
Online Access:https://www.mdpi.com/2079-9292/8/3/261

Internet

https://www.mdpi.com/2079-9292/8/3/261

Similar Items