Comparison of modular numbers based on the chinese remainder theorem with fractional values

New algorithms for determining the sign of a modular number and comparing numbers in a residue number system (RNS) have been developed using the Chinese remainder theorem with fractional values. These algorithms are based on calculations of approximate values of fractional values determined by modul...

Full description

Saved in:
Bibliographic Details
Published in:Automatic control and computer sciences 2015-11, Vol.49 (6), p.354-365
Main Authors: Chervyakov, N. I., Molahosseini, A. S., Lyakhov, P. A., Babenko, M. G., Lavrinenko, I. N., Lavrinenko, A. V.
Format: Article
Language:English
Subjects:
Computer Science
Control Structures and Microprogramming
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:New algorithms for determining the sign of a modular number and comparing numbers in a residue number system (RNS) have been developed using the Chinese remainder theorem with fractional values. These algorithms are based on calculations of approximate values of fractional values determined by moduli of the system. Instrumental implementations of the new algorithms are proposed and examples of their applications are given. Modeling these developments on Xilinx Kintex 7 FPGA showed that the proposed methods of decrease computational complexity of determining signs and comparing numbers in the RNS compared to that in well-known architectures based on the Chinese remainder theorem with generalized positional notation.
ISSN:0146-4116
1558-108X
DOI:10.3103/S0146411615060048