Residue-to-Binary converters for the seven moduli set {2n-5-1, 2n-3-1, 2n-2+1, 2n-1-1, 2n-1+1, 2n, 2n+1} for n even

Madhavi Latha; Rashmi Rachh; P. V. Ananda Mohan

doi:10.1109/primeasia47521.2019.8950721

ScienceGate Book Chapters

JOURNAL ARTICLE

Residue-to-Binary converters for the seven moduli set {2^n-⁵-1, 2^n-³-1, 2^n-²+1, 2^n-¹-1, 2^n-¹+1, 2n, 2ⁿ+1} for n even

Madhavi Latha Rashmi Rachh P. V. Ananda Mohan

Year: 2019 Pages: 37-40

DOI: 10.1109/primeasia47521.2019.8950721

Get Full-Text PDF Get Analytical Report

Abstract

In this paper, a Residue-to-Binary converter for the seven moduli set {2 ^n- ⁵ -1, 2 ^n- ³ -1, 2 ^n- ² +1, 2 ^n- ¹ -1, 2 ^n-1 +1, 2 ⁿ , 2 ⁿ +1} for n even is presented. This moduli set is derived from a previously described 8 moduli set which has two moduli with one common factor, by deleting one of these moduli. The converter consider two subsets of the moduli and derive the corresponding binary number in those sets and then combine the results in a second level using Mixed Radix Conversion. The proposed converter is compared with the converter for the original 8 moduli set regarding hardware requirement and conversion time for realizing same Dynamic range.

Keywords:

Physics

Metrics

Cited By

0.31

FWCI (Field Weighted Citation Impact)

Refs

0.68

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Coding theory and cryptography

Physical Sciences → Computer Science → Artificial Intelligence

Cryptography and Residue Arithmetic

Physical Sciences → Computer Science → Information Systems

Finite Group Theory Research

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Residue-to-Binary converters for the seven moduli set {2^n-⁵-1, 2^n-³-1, 2^n-²+1, 2^n-¹-1, 2^n-¹+1, 2n, 2ⁿ+1} for n even

Abstract

Metrics

Citation History

Topics

Related Documents

A MEMORYLESS REVERSE CONVERTER FOR THE 4-MODULI SUPERSET {2ⁿ - 1, 2ⁿ, 2ⁿ + 1, 2^{n + 1} - 1}

Reverse Converters for the Moduli Set {2ⁿ⁺¹−3, 2ⁿ−1, 2ⁿ⁻¹−1}

RNS-to-Binary Converters for a Three-Moduli Set {2ⁿ⁻¹ − 1, 2ⁿ − 1, 2ⁿ⁺^k}

An efficient residue-to-binary converter for the moduli set {2ⁿ⁻¹−1, 2^n+k, 2ⁿ−1}

RESIDUE-WEIGHTED NUMBER CONVERSION FOR MODULI SET {2ⁿ-1, 2ⁿ + 1, 2²ⁿ + 1, 2ⁿ} USING SIGNED-DIGIT NUMBER

Residue-to-Binary converters for the seven moduli set {2n-5-1, 2n-3-1, 2n-2+1, 2n-1-1, 2n-1+1, 2n, 2n+1} for n even

Abstract

Metrics

Citation History

Topics

Related Documents

A MEMORYLESS REVERSE CONVERTER FOR THE 4-MODULI SUPERSET {2n - 1, 2n, 2n + 1, 2n + 1 - 1}

Reverse Converters for the Moduli Set {2n+1−3, 2n−1, 2n−1−1}

RNS-to-Binary Converters for a Three-Moduli Set {2n−1 − 1, 2n − 1, 2n+k}

An efficient residue-to-binary converter for the moduli set {2n−1−1, 2n+k, 2n−1}

RESIDUE-WEIGHTED NUMBER CONVERSION FOR MODULI SET {2n-1, 2n + 1, 22n + 1, 2n} USING SIGNED-DIGIT NUMBER

Residue-to-Binary converters for the seven moduli set {2^n-⁵-1, 2^n-³-1, 2^n-²+1, 2^n-¹-1, 2^n-¹+1, 2n, 2ⁿ+1} for n even

A MEMORYLESS REVERSE CONVERTER FOR THE 4-MODULI SUPERSET {2ⁿ - 1, 2ⁿ, 2ⁿ + 1, 2^{n + 1} - 1}

Reverse Converters for the Moduli Set {2ⁿ⁺¹−3, 2ⁿ−1, 2ⁿ⁻¹−1}

RNS-to-Binary Converters for a Three-Moduli Set {2ⁿ⁻¹ − 1, 2ⁿ − 1, 2ⁿ⁺^k}

An efficient residue-to-binary converter for the moduli set {2ⁿ⁻¹−1, 2^n+k, 2ⁿ−1}

RESIDUE-WEIGHTED NUMBER CONVERSION FOR MODULI SET {2ⁿ-1, 2ⁿ + 1, 2²ⁿ + 1, 2ⁿ} USING SIGNED-DIGIT NUMBER