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

DOI10.1007/S00034-014-9798-1zbMath1342.68032OpenAlexW9875335MaRDI QIDQ531242

Mehdi Hosseinzadeh, Keivan Navi, Mohammad Reza Noorimehr

Publication date: 3 August 2016

Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00034-014-9798-1

zbMATH Keywords

computer arithmeticChinese remainder theorem (CRT)residue number system (RNS)reverse converter

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items (1)

Designing efficient two-level reverse converters for moduli set \(\{2^{2n+1}-1,2^{2n},2^{n}-1\}\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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\}\)
• Residue-to-binary converters based on new Chinese remainder theorems
• A new efficient memoryless residue to binary converter
• Fast Modulo 2^{n} - (2^{n - 2} + 1) Addition: A New Class of Adder for RNS
• A Residue-to-Binary Converter for a New Five-Moduli Set
• RNS-to-Binary Converters for Two Four-Moduli Sets <formula formulatype="inline"><tex>$\{2^{n}-1,2^{n},2^{n}+1,2^{{n}+1}-1\}$</tex></formula> and <formula formulatype="inline"><tex>$\{2^{n}-1,2^{n},2^{n}+1,2^{{n}+1}+1\}$</tex></formula>
• 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]
• Adder based residue to binary number converters for (2/sup n/-1, 2/sup n/, 2/sup n/+1)

This page was built for publication: 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