A generalization of a fast RNS conversion for a new 4-modulus base

Authors:
Laurent-Stéphane Didier;Pierre-Yves Rivaille
Affiliations:
Laboratoire d'Informatique de Paris 6, Université Pierre et Marie Curie, Paris, France;Laboratoire d'Informatique de Paris 6, Université Pierre et Marie Curie, Paris, France
Venue:
IEEE Transactions on Circuits and Systems II: Express Briefs
Year:
2009

Citing 8
Cited 0

Residue number system arithmetic: modern applications in digital signal processing

Residue number system arithmetic: modern applications in digital signal processing
An efficient algorithm and parallel implementations for binary and residue number systems

Journal of Symbolic Computation
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Sequential Circuit Design Using Synthesis and Optimization

ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
A Full RNS Implementation of RSA

IEEE Transactions on Computers
Some Optimizations of Hardware Multiplication by Constant Matrices

IEEE Transactions on Computers
An efficient design of residue to binary converter for four moduli set (2n-1,2n+1,22n-2,22n+1-3) based on new CRT II

Information Sciences: an International Journal
Residue Arithmetic A Tutorial with Examples

Computer

Quantified Score

Hi-index	0.00

Visualization

Abstract

A generalization of a new generic 4-modulus base for residue number systems (RNS) is presented in this paper. An efficient RNS to binary conversion algorithm and a hierarchical architecture for these bases are also described. The key features of our conversion architecture compared to previous published architectures of the same output range are a larger moduli set selection and savings on the critical delay, area and power. The FPGA implementation and the detailed proof supporting it are also discussed.