Efficient Reverse Converter Designs for the New 4-Moduli Sets <formula formulatype="inline"><tex Notation="TeX">$\{2^{n} -1, 2^{n}, 2^{n} +1, 2^{2n + 1}-1\}$</tex></formula> and <formula formulatype="inline"> <tex Notation

DOI10.1109/TCSI.2009.2026681zbMath1468.68027MaRDI QIDQ5010990

Omid Kavehei, Keivan Navi, Somayeh Timarchi, Chitra Dadkhah, Amir Sabbagh Molahosseini

Publication date: 26 August 2021

Published in: IEEE Transactions on Circuits and Systems I: Regular Papers (Search for Journal in Brave)

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Mathematical problems of computer architecture (68M07) Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items

Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem ⋮ Reverse converters for the moduli set \(\{2^n, 2^{n-1}-1,2^{n}-1, 2^{n+1}-1\}\) (\(n\) even)

This page was built for publication: Efficient Reverse Converter Designs for the New 4-Moduli Sets <formula formulatype="inline"><tex Notation="TeX">$\{2^{n} -1, 2^{n}, 2^{n} +1, 2^{2n + 1}-1\}$</tex></formula> and <formula formulatype="inline"> <tex Notation