Saltar ao contenido

The fast algorithm for number comparing in three-modular RNS

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...

Descrición completa

Gardado en:
Detalles Bibliográficos
Главные авторы: Chervyakov, N. I., Червяков, Н. И., Nazarov, A. S., Назаров, А. С., Babenko, M. G., Бабенко, М. Г., Garyanina, A. I., Гарянина, А. И.
Formato: Статья
Idioma:English
Publicado: Institute of Electrical and Electronics Engineers Inc. 2018
Темы:
Acceso en liña: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=
https://dspace.ncfu.ru/handle/20.500.12258/3073
Метки: Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
id ir-20.500.12258-3073
record_format dspace
spelling ir-20.500.12258-30732020-07-07T12:59:08Z The fast algorithm for number comparing in three-modular RNS Chervyakov, N. I. Червяков, Н. И. Nazarov, A. S. Назаров, А. С. Babenko, M. G. Бабенко, М. Г. Garyanina, A. I. Гарянина, А. И. Chinese remainder theorem (CRT) Diagonal function (DF) Residue number system (RNS) Numbering systems 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 2018-09-26T08:48:40Z 2018-09-26T08:48:40Z 2017 Статья 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 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 en Proceedings - 2016 International Conference on Engineering and Telecommunication, EnT 2016 application/pdf application/pdf Institute of Electrical and Electronics Engineers Inc.
institution СКФУ
collection Репозиторий
language English
topic Chinese remainder theorem (CRT)
Diagonal function (DF)
Residue number system (RNS)
Numbering systems
spellingShingle Chinese remainder theorem (CRT)
Diagonal function (DF)
Residue number system (RNS)
Numbering systems
Chervyakov, N. I.
Червяков, Н. И.
Nazarov, A. S.
Назаров, А. С.
Babenko, M. G.
Бабенко, М. Г.
Garyanina, A. I.
Гарянина, А. И.
The fast algorithm for number comparing in three-modular RNS
description 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
format Статья
author Chervyakov, N. I.
Червяков, Н. И.
Nazarov, A. S.
Назаров, А. С.
Babenko, M. G.
Бабенко, М. Г.
Garyanina, A. I.
Гарянина, А. И.
author_facet Chervyakov, N. I.
Червяков, Н. И.
Nazarov, A. S.
Назаров, А. С.
Babenko, M. G.
Бабенко, М. Г.
Garyanina, A. I.
Гарянина, А. И.
author_sort Chervyakov, N. I.
title The fast algorithm for number comparing in three-modular RNS
title_short The fast algorithm for number comparing in three-modular RNS
title_full The fast algorithm for number comparing in three-modular RNS
title_fullStr The fast algorithm for number comparing in three-modular RNS
title_full_unstemmed The fast algorithm for number comparing in three-modular RNS
title_sort fast algorithm for number comparing in three-modular rns
publisher Institute of Electrical and Electronics Engineers Inc.
publishDate 2018
url 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=
https://dspace.ncfu.ru/handle/20.500.12258/3073
work_keys_str_mv AT chervyakovni thefastalgorithmfornumbercomparinginthreemodularrns
AT červâkovni thefastalgorithmfornumbercomparinginthreemodularrns
AT nazarovas thefastalgorithmfornumbercomparinginthreemodularrns
AT nazarovas thefastalgorithmfornumbercomparinginthreemodularrns
AT babenkomg thefastalgorithmfornumbercomparinginthreemodularrns
AT babenkomg thefastalgorithmfornumbercomparinginthreemodularrns
AT garyaninaai thefastalgorithmfornumbercomparinginthreemodularrns
AT garâninaai thefastalgorithmfornumbercomparinginthreemodularrns
AT chervyakovni fastalgorithmfornumbercomparinginthreemodularrns
AT červâkovni fastalgorithmfornumbercomparinginthreemodularrns
AT nazarovas fastalgorithmfornumbercomparinginthreemodularrns
AT nazarovas fastalgorithmfornumbercomparinginthreemodularrns
AT babenkomg fastalgorithmfornumbercomparinginthreemodularrns
AT babenkomg fastalgorithmfornumbercomparinginthreemodularrns
AT garyaninaai fastalgorithmfornumbercomparinginthreemodularrns
AT garâninaai fastalgorithmfornumbercomparinginthreemodularrns
_version_ 1760601439197986816