2011
DOI: 10.1109/tvlsi.2010.2050608
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient FPGA Design of Residue-to-Binary Converter for the Moduli Set $\{2n+1,2n,2n-1\}$

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
7
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 15 publications
(7 citation statements)
references
References 9 publications
0
7
0
Order By: Relevance
“…The hardware requirement and conversion time for the various reverse converters described in [5,18,19,21] for the moduli set M1 along with the proposed reverse converters have been presented in table 1. Note that FA, HA, AND and w:1 MUX stand for a full adder, half adder, twoinput AND gate and w:1 multiplexer, respectively.…”
Section: Performance Evaluation and Comparisonmentioning
confidence: 99%
See 4 more Smart Citations
“…The hardware requirement and conversion time for the various reverse converters described in [5,18,19,21] for the moduli set M1 along with the proposed reverse converters have been presented in table 1. Note that FA, HA, AND and w:1 MUX stand for a full adder, half adder, twoinput AND gate and w:1 multiplexer, respectively.…”
Section: Performance Evaluation and Comparisonmentioning
confidence: 99%
“…In the converter D4 for M1 proposed by Wang et al [19] based on new CRT II technique, we need one 2k 9 k multiplier and one k 9 k multiplier, a few adders and a few comparators. The recent converter D5 for M1 due to Gbolagade et al [21] is based on the modification of CRT. It realizes modulo m 1 reduction using several MUXs and comparators and it needs one 2k 9 k multiplier and one k 9 k multiplier.…”
Section: Performance Evaluation and Comparisonmentioning
confidence: 99%
See 3 more Smart Citations