Please use this identifier to cite or link to this item: https://dspace.ncfu.ru/handle/20.500.12258/3073
Title: The fast algorithm for number comparing in three-modular RNS
Authors: Chervyakov, N. I.
Червяков, Н. И.
Nazarov, A. S.
Назаров, А. С.
Babenko, M. G.
Бабенко, М. Г.
Garyanina, A. I.
Гарянина, А. И.
Keywords: Chinese remainder theorem (CRT);Diagonal function (DF);Residue number system (RNS);Numbering systems
Issue Date: 2017
Publisher: Institute of Electrical and Electronics Engineers Inc.
Citation: Chervyakov, N., Nazarov, A., Babenko, M., Garianina, A., Tchernykh, A. The fast algorithm for number comparing in three-modular RNS // Proceedings - 2016 International Conference on Engineering and Telecommunication, EnT, 2016. - 2017. - Номер статьи 7810748. - Pages 26-28
Series/Report no.: Proceedings - 2016 International Conference on Engineering and Telecommunication, EnT 2016
Abstract: In paper the parallel algorithm of number comparing in residue number system of the special form (2n-1, 2n, 2n+1) based on use of diagonal functions from work [5] and a method of the recursive doubling from work [9] is offered. The offered algorithm allows scoring 31% in area of the occupied device and 18% in time delay in comparing with algorithm from work
URI: https://www.scopus.com/record/display.uri?eid=2-s2.0-85013067862&origin=resultslist&sort=plf-f&src=s&st1=The+fast+algorithm+for+number+comparing+in+three-modular+RNS+&st2=&sid=1e6b4da66134cf4ee4c8c57f3c37bcb1&sot=b&sdt=b&sl=76&s=TITLE-ABS-KEY%28The+fast+algorithm+for+number+comparing+in+three-modular+RNS+%29&relpos=0&citeCnt=1&searchTerm=
http://hdl.handle.net/20.500.12258/3073
Appears in Collections:Статьи, проиндексированные в SCOPUS, WOS

Files in This Item:
File Description SizeFormat 
scopusresults 361 .pdf
  Restricted Access
61.95 kBAdobe PDFView/Open
WoS 183 .pdf
  Restricted Access
107.75 kBAdobe PDFView/Open


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