Please use this identifier to cite or link to this item:
Title: Comparison of modular numbers based on the chinese remainder theorem with fractional values
Authors: Chervyakov, N. I.
Червяков, Н. И.
Lyakhov, P. A.
Ляхов, П. А.
Babenko, M. G.
Бабенко, М. Г.
Lavrinenko, I. N.
Лавриненко, И. Н.
Lavrinenko, A. V.
Лавриненко, А. В.
Keywords: Approximate method;Chinese remainder theorem (CRT);Fractional values;Generalized positional notation;Modular arithmetic;Positional characteristic;Residue number system (RNS);Algorithms
Issue Date: 2015
Publisher: Springer New York LLC
Citation: Chervyakov, N.I., Molahosseini, A.S., Lyakhov, P.A., Babenko, M.G., Lavrinenko, I.N., Lavrinenko, A.V. Comparison of modular numbers based on the chinese remainder theorem with fractional values // Automatic Control and Computer Sciences. - 2015. - Volume 49. - Issue 6. - Pages 354-365
Series/Report no.: Automatic Control and Computer Sciences
Abstract: 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
Appears in Collections:Статьи, проиндексированные в SCOPUS, WOS

Files in This Item:
File Description SizeFormat 
scopusresults 653 .pdf
  Restricted Access
62.81 kBAdobe PDFView/Open
WoS 426 .pdf
  Restricted Access
467.62 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.