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

DOI10.1109/TC.2007.1001MaRDI QIDQ4564146zbMATH OpenFDO

Authors Riyaz A. Patel, Mohammed Benaissa, S. Boussakta

Publication date 12 June 2018

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

Full work available at URL https://doi.org/10.1109/TC.2007.1001

Mathematics Subject Classification ID

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

Cited in

(4)

• 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\}\)
• Linear Approximations of Addition Modulo 2n-1
• Area-time efficient modulo 2/sup n/-1 adder design
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4564146)