Please use this identifier to cite or link to this item:
https://dspace.ncfu.ru/handle/20.500.12258/3687
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chervyakov, N. I. | - |
dc.contributor.author | Червяков, Н. И. | - |
dc.contributor.author | Lyakhov, P. A. | - |
dc.contributor.author | Ляхов, П. А. | - |
dc.contributor.author | Babenko, M. G. | - |
dc.contributor.author | Бабенко, М. Г. | - |
dc.contributor.author | Lavrinenko, I. N. | - |
dc.contributor.author | Лавриненко, И. Н. | - |
dc.contributor.author | Lavrinenko, A. V. | - |
dc.contributor.author | Лавриненко, А. В. | - |
dc.date.accessioned | 2018-12-17T08:34:05Z | - |
dc.date.available | 2018-12-17T08:34:05Z | - |
dc.date.issued | 2015 | - |
dc.identifier.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 | ru |
dc.identifier.uri | https://www.scopus.com/record/display.uri?eid=2-s2.0-84953243310&origin=resultslist&sort=plf-f&src=s&nlo=1&nlr=20&nls=afprfnm-t&affilName=north+caucasus+federal+university&sid=dc7f8c6f40c1112203ece798567bdeb2&sot=afnl&sdt=cl&cluster=scopubyr%2c%222015%22%2ct&sl=53&s=%28AF-ID%28%22North+Caucasus+Federal+University%22+60070541%29%29&relpos=6&citeCnt=1&searchTerm= | - |
dc.identifier.uri | http://hdl.handle.net/20.500.12258/3687 | - |
dc.description.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 | ru |
dc.language.iso | en | ru |
dc.publisher | Springer New York LLC | ru |
dc.relation.ispartofseries | Automatic Control and Computer Sciences | - |
dc.subject | Approximate method | ru |
dc.subject | Chinese remainder theorem (CRT) | ru |
dc.subject | Fractional values | ru |
dc.subject | Generalized positional notation | ru |
dc.subject | Modular arithmetic | ru |
dc.subject | Positional characteristic | ru |
dc.subject | Residue number system (RNS) | ru |
dc.subject | Algorithms | ru |
dc.title | Comparison of modular numbers based on the chinese remainder theorem with fractional values | ru |
dc.type | Статья | ru |
vkr.amount | Pages 354-365 | ru |
vkr.inst | Институт математики и естественных наук | - |
Appears in Collections: | Статьи, проиндексированные в SCOPUS, WOS |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
scopusresults 653 .pdf Restricted Access | 62.81 kB | Adobe PDF | View/Open | |
WoS 426 .pdf Restricted Access | 467.62 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.