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

DOI10.1109/TCSI.2009.2026681MaRDI QIDQ5010990zbMATH OpenFDO

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

Publication date 26 August 2021

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

Full work available at URL https://doi.org/10.1109/TCSI.2009.2026681

Mathematics Subject Classification ID

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

Cited in

(3)

• Reverse converters for the moduli set \(\{2^n, 2^{n-1}-1,2^{n}-1, 2^{n+1}-1\}\) (\(n\) even)
• Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem
• An efficient reverse converter for the 4-moduli set [2/sup n/ - 1, 2/sup n, 2/sup n + 1, 2/sup 2n/ + 1] based on the new chinese remainder theorem

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

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