三模RNS中数比较的快速算法

2016 International Conference on Engineering and Telecommunication (EnT) Pub Date : 2016-11-01 DOI:10.1109/ENT.2016.014

N. Chervyakov, M. Babenko, Andrei Tchernykh, A. Nazarov, A. Garianina

{"title":"三模RNS中数比较的快速算法","authors":"N. Chervyakov, M. Babenko, Andrei Tchernykh, A. Nazarov, A. Garianina","doi":"10.1109/ENT.2016.014","DOIUrl":null,"url":null,"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 [9].","PeriodicalId":356690,"journal":{"name":"2016 International Conference on Engineering and Telecommunication (EnT)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"The Fast Algorithm for Number Comparing in Three-Modular RNS\",\"authors\":\"N. Chervyakov, M. Babenko, Andrei Tchernykh, A. Nazarov, A. Garianina\",\"doi\":\"10.1109/ENT.2016.014\",\"DOIUrl\":null,\"url\":null,\"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 [9].\",\"PeriodicalId\":356690,\"journal\":{\"name\":\"2016 International Conference on Engineering and Telecommunication (EnT)\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Engineering and Telecommunication (EnT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ENT.2016.014\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Engineering and Telecommunication (EnT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ENT.2016.014","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

本文利用工作[5]中的对角函数，给出了特殊形式(2n- 1,2n, 2n+1)剩数系统的并行数比较算法和工作[9]中的递推加倍方法。本文算法与工作算法相比，占用设备面积得分31%，时延得分18%[9]。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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 and 18% in time delay in comparing with algorithm from work [9].

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 International Conference on Engineering and Telecommunication (EnT)

自引率

0.00%

发文量