Пропуск в контексте
The fast algorithm for number comparing in three-modular RNS

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

全面介绍

Сохранить в:
书目详细资料
Главные авторы: Chervyakov, N. I., Червяков, Н. И., Nazarov, A. S., Назаров, А. С., Babenko, M. G., Бабенко, М. Г., Garyanina, A. I., Гарянина, А. И.
格式: Статья
语言:English
出版: Institute of Electrical and Electronics Engineers Inc. 2018
主题:
Chinese remainder theorem (CRT)
Diagonal function (DF)
Residue number system (RNS)
Numbering systems
在线阅读: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
标签: 添加标签
没有标签, 成为第一个标记此记录!
实物特征
总结: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

相似书籍