2014 International Symposium on Integrated Circuits (ISIC) 2014
DOI: 10.1109/isicir.2014.7029510
|View full text |Cite
|
Sign up to set email alerts
|

An efficient residue-to-binary converter for the new moduli set {2<sup>n/2</sup> &#x00B1; 1, 2<sup>2n&#x002B;1</sup>,2<sup>n</sup> &#x002B; 1}

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2018
2018

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 14 publications
0
2
0
Order By: Relevance
“…Thus the number Y in this system is represented as Y = (y 1 , y 2 , y 3,…, y n ) ,0≤ y i < m i . [6] Given the moduli set {7,8,9}, the number 150 can be represented in RNS as: To avoid redundancy, the moduli set must be pair wise relatively prime. Thus gcd (m i ,m j ) =1 for i≠j, where gcd means the greatest common divisor of m i ,m j.…”
Section: Background Of Rnsmentioning
confidence: 99%
“…Thus the number Y in this system is represented as Y = (y 1 , y 2 , y 3,…, y n ) ,0≤ y i < m i . [6] Given the moduli set {7,8,9}, the number 150 can be represented in RNS as: To avoid redundancy, the moduli set must be pair wise relatively prime. Thus gcd (m i ,m j ) =1 for i≠j, where gcd means the greatest common divisor of m i ,m j.…”
Section: Background Of Rnsmentioning
confidence: 99%
“…This has resulted in the development of a number of error detection and error correction algorithms. The decoding of Redundant Residue Number System is commonly carried out using Chinese Remainder Theorem (CRT) [10][11][12] [13]. Implementation of CRT decoder at the receiver results in a computational complexity of order 0(n3), where n is the number of non redundant moduli [11].…”
Section: Redundant Residue Number Systemmentioning
confidence: 99%