Fast Modulo 2^{n} - (2^{n - 2} + 1) Addition: A New Class of Adder for RNS

DOI10.1109/TC.2007.1001zbMath1390.65190MaRDI QIDQ4564146

Riyaz A. Patel, S. Boussakta, Mohammed Benaissa

Publication date: 12 June 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items (2)

High speed residue to binary converter for the new four-moduli set \(\{2^{2n},2^n+1,2^{n/2}+1,2^{n/2}-1\}\) ⋮ Efficient reverse converters for 4-moduli sets \(\{2^{2n-1}-1, 2^n,2^n+1,2^n-1\}\) and \(\{2^{2n-1},2^{2n-1}-1, 2^n+1,2^n-1\}\) based on CRTs algorithm

This page was built for publication: Fast Modulo 2^{n} - (2^{n - 2} + 1) Addition: A New Class of Adder for RNS