A study of the residue-to-binary converters for the three-moduli sets
From MaRDI portal
Publication:5349624
DOI10.1109/TCSI.2002.808191zbMath1368.68035MaRDI QIDQ5349624
Wei Wang, M. N. S. Swamy, Yuke Wang, M. Omair Ahmad
Publication date: 25 August 2017
Published in: IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications (Search for Journal in Brave)
Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Mathematical problems of computer architecture (68M07)
Related Items (5)
Algorithmic acceleration of B/FV-like somewhat homomorphic encryption for compute-enabled RAM ⋮ New adder-based RNS-to-binary converters for the \(\{2^{n+1} + 1, 2^{n+1} - 1, 2^{n}\}\) moduli set ⋮ Hierarchical residue number systems with small moduli and simple converters ⋮ An efficient RNS parity checker for moduli set \(\{2^n - 1, 2^n + 1, 2^{2n} + 1\}\) and its applications ⋮ An iterative modular multiplication algorithm in RNS
This page was built for publication: A study of the residue-to-binary converters for the three-moduli sets