Efficient RNS to binary converters for the new 4-moduli set {2n, 2n+1-1, 2n-1, 2n-1-1}

Mohammad Esmaeildoust; Keivan Navi; MohammadReza Taheri; Amir Sabbagh Molahosseini; Siavash Khodambashi

doi:10.1587/elex.9.1

LETTER

Efficient RNS to binary converters for the new 4-moduli set {2ⁿ, 2ⁿ⁺¹-1, 2ⁿ-1, 2^n-1-1}

Mohammad Esmaeildoust, Keivan Navi, MohammadReza Taheri, Amir Sabbagh Molahosseini, Siavash Khodambashi

Author information

Keywords: computer arithmetic, residue number system (RNS), RNS to binary (reverse) converter, moduli sets

JOURNAL FREE ACCESS

2012 Volume 9 Issue 1 Pages 1-7

DOI https://doi.org/10.1587/elex.9.1

Details

Abstract

In this paper, we propose efficient designs of residue number system (RNS) to binary converter for the balanced moduli set {2ⁿ, 2ⁿ⁺¹-1, 2ⁿ-1, 2^n-1-1} where n has even values. This new moduli set is completely free from modulo-(2^k+1)-type which results in high-speed modulo arithmetic channels for RNS. Also, mixed-radix conversion (MRC) algorithm is used to achieve both an arithmetic-based and reduced-complexity two-level RNS to binary converter architectures. The proposed moduli set provides fast arithmetic operation with higher speed of the reverse converter comparing to other five moduli set which is found in literature.

Corresponding author

Register with J-STAGE for free!