Proceedings of 2010 IEEE International Symposium on Circuits and Systems 2010
DOI: 10.1109/iscas.2010.5537062
|View full text |Cite
|
Sign up to set email alerts
|

An improved RNS reverse converter for the {2<sup>2n&#x002B;1</sup>&#x2212;1, 2<sup>n</sup>, 2<sup>n</sup>&#x2212;1} moduli set

Abstract: In this paper, we propose a novel high speed memoryless reverse converter for the moduli set {2 2n+1 − 1, 2 n , 2 n − 1}. First, we simplify the traditional Chinese Remainder Theorem in order to obtain a reverse converter that only requires arithmetic mod-(2 2n+1 − 1). Second, we further improve the resulting architecture to obtain a purely adder based reverse converter. The proposed converter has a critical path delay of (7n + 7) Full Adders (FA) while the best state of the art converter for this moduli set r… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(3 citation statements)
references
References 7 publications
0
3
0
Order By: Relevance
“…In terms of complexity, arithmetic operation in moduli 2 n +1 are more complex than moduli 2 n and 2 n -1. Therefore, 3n-bit dynamic range RNS moduli sets {2 n-1 -1, 2 n -1, 2 n } [34], {2 n -1, 2 n , 2 n+1 -1} [35] and {2 2n+1 -1, 2 n , 2 n-1 } [36] are reported by many researchers. The latest papers that consider reverse conversion using 3-moduli sets are [37][38][39][40].…”
Section: Introductionmentioning
confidence: 99%
“…In terms of complexity, arithmetic operation in moduli 2 n +1 are more complex than moduli 2 n and 2 n -1. Therefore, 3n-bit dynamic range RNS moduli sets {2 n-1 -1, 2 n -1, 2 n } [34], {2 n -1, 2 n , 2 n+1 -1} [35] and {2 2n+1 -1, 2 n , 2 n-1 } [36] are reported by many researchers. The latest papers that consider reverse conversion using 3-moduli sets are [37][38][39][40].…”
Section: Introductionmentioning
confidence: 99%
“…The area and delay overheads are up to 35.6% and 45.2%, respectively. Therefore, previous studies have proposed several (2 n þ 1)-free moduli sets, such as f2 2n ; 2 n À 1; 2 nþ1 À 1g, f2 2n ; 2 n À 1; 2 nÀ1 À 1g [9], f2 n ; 2 n À 1; 2 2nÀ1 À 1g [10], and f2 n À 1; 2 n ; 2 2nþ1 À 1g [11], but they are fixed and difficult to implement in addressing the DR over-ratio problem.…”
Section: Introductionmentioning
confidence: 99%
“…Its function blocks were designed on the basis of Eqs. (7), (11), and (12). First, the operand preparation unit (OPU 1) is a bit organizer that simply performs permutations by using Eqs.…”
Section: Introductionmentioning
confidence: 99%