The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Neste artigo, os novos módulos do sistema de numeração de resíduos (RNS) definem {22n, 2n -1, 2n+1 -1} e {22n, 2n -1, 2n-1 -1} são introduzidos. Esses conjuntos de módulos têm faixa dinâmica de 4n bits e módulos bem formados que podem resultar em resíduos de alto desempenho para conversores binários, bem como em uma unidade aritmética RNS eficiente. A seguir, são apresentados conversores eficientes de resíduo para binário para os conjuntos de módulos propostos baseados no algoritmo de conversão de raiz mista (MRC). Os conversores são livres de ROM e são realizados usando somadores carry-save e somadores módulo. Comparação com o outro resíduo para conversores binários para 4nconjuntos de módulos de faixa dinâmica de -bit mostraram que os projetos apresentados são baseados em novos conjuntos de módulos {22n, 2n -1, 2n+1 -1} e {22n, 2n -1, 2n-1 -1} melhoram o atraso de conversão e resultam em economia de hardware. Além disso, os conjuntos de módulos propostos podem levar a conversores binários em resíduos eficientes e podem acelerar o processamento aritmético interno do RNS, em comparação com os outros 4nconjuntos de módulos de faixa dinâmica de -bit.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Amir Sabbagh MOLAHOSSEINI, Chitra DADKHAH, Keivan NAVI, Mohammad ESHGHI, "Efficient MRC-Based Residue to Binary Converters for the New Moduli Sets {22n, 2n -1, 2n+1 -1} and {22n, 2n -1, 2n-1 -1}" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 9, pp. 1628-1638, September 2009, doi: 10.1587/transinf.E92.D.1628.
Abstract: In this paper, the new residue number system (RNS) moduli sets {22n, 2n -1, 2n+1 -1} and {22n, 2n -1, 2n-1 -1} are introduced. These moduli sets have 4n-bit dynamic range and well-formed moduli which can result in high-performance residue to binary converters as well as efficient RNS arithmetic unit. Next, efficient residue to binary converters for the proposed moduli sets based on mixed-radix conversion (MRC) algorithm are presented. The converters are ROM-free and they are realized using carry-save adders and modulo adders. Comparison with the other residue to binary converters for 4n-bit dynamic range moduli sets shown that the presented designs based on new moduli sets {22n, 2n -1, 2n+1 -1} and {22n, 2n -1, 2n-1 -1} are improved the conversion delay and result in hardware savings. Also, the proposed moduli sets can lead to efficient binary to residue converters, and they can speed-up internal RNS arithmetic processing, compared with the other 4n-bit dynamic range moduli sets.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.1628/_p
Copiar
@ARTICLE{e92-d_9_1628,
author={Amir Sabbagh MOLAHOSSEINI, Chitra DADKHAH, Keivan NAVI, Mohammad ESHGHI, },
journal={IEICE TRANSACTIONS on Information},
title={Efficient MRC-Based Residue to Binary Converters for the New Moduli Sets {22n, 2n -1, 2n+1 -1} and {22n, 2n -1, 2n-1 -1}},
year={2009},
volume={E92-D},
number={9},
pages={1628-1638},
abstract={In this paper, the new residue number system (RNS) moduli sets {22n, 2n -1, 2n+1 -1} and {22n, 2n -1, 2n-1 -1} are introduced. These moduli sets have 4n-bit dynamic range and well-formed moduli which can result in high-performance residue to binary converters as well as efficient RNS arithmetic unit. Next, efficient residue to binary converters for the proposed moduli sets based on mixed-radix conversion (MRC) algorithm are presented. The converters are ROM-free and they are realized using carry-save adders and modulo adders. Comparison with the other residue to binary converters for 4n-bit dynamic range moduli sets shown that the presented designs based on new moduli sets {22n, 2n -1, 2n+1 -1} and {22n, 2n -1, 2n-1 -1} are improved the conversion delay and result in hardware savings. Also, the proposed moduli sets can lead to efficient binary to residue converters, and they can speed-up internal RNS arithmetic processing, compared with the other 4n-bit dynamic range moduli sets.},
keywords={},
doi={10.1587/transinf.E92.D.1628},
ISSN={1745-1361},
month={September},}
Copiar
TY - JOUR
TI - Efficient MRC-Based Residue to Binary Converters for the New Moduli Sets {22n, 2n -1, 2n+1 -1} and {22n, 2n -1, 2n-1 -1}
T2 - IEICE TRANSACTIONS on Information
SP - 1628
EP - 1638
AU - Amir Sabbagh MOLAHOSSEINI
AU - Chitra DADKHAH
AU - Keivan NAVI
AU - Mohammad ESHGHI
PY - 2009
DO - 10.1587/transinf.E92.D.1628
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E92-D
IS - 9
JA - IEICE TRANSACTIONS on Information
Y1 - September 2009
AB - In this paper, the new residue number system (RNS) moduli sets {22n, 2n -1, 2n+1 -1} and {22n, 2n -1, 2n-1 -1} are introduced. These moduli sets have 4n-bit dynamic range and well-formed moduli which can result in high-performance residue to binary converters as well as efficient RNS arithmetic unit. Next, efficient residue to binary converters for the proposed moduli sets based on mixed-radix conversion (MRC) algorithm are presented. The converters are ROM-free and they are realized using carry-save adders and modulo adders. Comparison with the other residue to binary converters for 4n-bit dynamic range moduli sets shown that the presented designs based on new moduli sets {22n, 2n -1, 2n+1 -1} and {22n, 2n -1, 2n-1 -1} are improved the conversion delay and result in hardware savings. Also, the proposed moduli sets can lead to efficient binary to residue converters, and they can speed-up internal RNS arithmetic processing, compared with the other 4n-bit dynamic range moduli sets.
ER -