新RNS-To-Binary转换器Three-Moduli设置$ \ {2 ^ {n + 1} 1 \ 2 ^ {n} 1 \ 2 ^ {n + k} \} $

2019 IEEE International Conference on Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER) Pub Date : 2019-08-01 DOI:10.1109/DISCOVER47552.2019.9007938

P. S. Phalguna, D. Kamat, P. A. Ananda Mohan

{"title":"新RNS-To-Binary转换器Three-Moduli设置$ \\ {2 ^ {n + 1} 1 \\ 2 ^ {n} 1 \\ 2 ^ {n + k} \\} $","authors":"P. S. Phalguna, D. Kamat, P. A. Ananda Mohan","doi":"10.1109/DISCOVER47552.2019.9007938","DOIUrl":null,"url":null,"abstract":"This paper presents three reverse converters one using Mixed Radix Conversion (MRC) and other two based on Chinese Remainder Theorem (CRT) for three-moduli set $\\{2^{n+1}-1,\\ 2^{n}-1,\\ 2^{n+k}\\}$ which is an extension of a previously investigated three-moduli set $\\{2^{n+1}-1,\\ 2^{n},\\ 2^{n}-1\\}$. The proposed converters are compared with reverse converters for three-moduli sets reported in literature regarding hardware requirement and conversion time for obtaining desired dynamic range.","PeriodicalId":274260,"journal":{"name":"2019 IEEE International Conference on Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER)","volume":"186 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New RNS-To-Binary Converters for Three-Moduli Set $\\\\{2^{n+1}-1,\\\\ 2^{n}-1,\\\\ 2^{n+k}\\\\}$\",\"authors\":\"P. S. Phalguna, D. Kamat, P. A. Ananda Mohan\",\"doi\":\"10.1109/DISCOVER47552.2019.9007938\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents three reverse converters one using Mixed Radix Conversion (MRC) and other two based on Chinese Remainder Theorem (CRT) for three-moduli set $\\\\{2^{n+1}-1,\\\\ 2^{n}-1,\\\\ 2^{n+k}\\\\}$ which is an extension of a previously investigated three-moduli set $\\\\{2^{n+1}-1,\\\\ 2^{n},\\\\ 2^{n}-1\\\\}$. The proposed converters are compared with reverse converters for three-moduli sets reported in literature regarding hardware requirement and conversion time for obtaining desired dynamic range.\",\"PeriodicalId\":274260,\"journal\":{\"name\":\"2019 IEEE International Conference on Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER)\",\"volume\":\"186 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE International Conference on Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DISCOVER47552.2019.9007938\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Conference on Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DISCOVER47552.2019.9007938","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文给出了三模集合$\{2^{n+1}-1，\ 2^{n}-1，\ 2^{n+k}\}$的三模集合$\{2^{n+1}-1，\ 2^{n}，\ 2^{n}-1\}$的三个反向转换器，其中一个使用混合基数转换(MRC)，另外两个基于中国剩余定理(CRT)。将所提出的变换器与文献中报道的三模组逆变变换器在硬件要求和获得所需动态范围的转换时间方面进行了比较。

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

查看原文本刊更多论文

New RNS-To-Binary Converters for Three-Moduli Set $\{2^{n+1}-1,\ 2^{n}-1,\ 2^{n+k}\}$

This paper presents three reverse converters one using Mixed Radix Conversion (MRC) and other two based on Chinese Remainder Theorem (CRT) for three-moduli set $\{2^{n+1}-1,\ 2^{n}-1,\ 2^{n+k}\}$ which is an extension of a previously investigated three-moduli set $\{2^{n+1}-1,\ 2^{n},\ 2^{n}-1\}$. The proposed converters are compared with reverse converters for three-moduli sets reported in literature regarding hardware requirement and conversion time for obtaining desired dynamic range.

求助全文

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

来源期刊

2019 IEEE International Conference on Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER)

自引率

0.00%

发文量