A Generalization of a Fast RNS Conversion for a New 4-Modulus Base

A Generalization of a Fast RNS Conversion for a New 4-Modulus Base

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 publi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on circuits and systems. II, Express briefs Express briefs, 2009-01, Vol.56 (1), p.46-50
Hauptverfasser: Didier, L.-S., Rivaille, P.-Y.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithm design and analysis
Algorithms
Architecture
Arithmetic
Circuits
Computer applications
Computer Science
Concurrent computing
Conversion
Cryptography
Delay
Digital signal processing
Field programmable gate arrays
FPGA design
Logic
moduli sets
Proving
Residue number systems
residue number systems (RNS)
residue-to-binary converter
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1549-7747
1558-3791
DOI:10.1109/TCSII.2008.2010157