Reverse converters for the moduli set \2ⁿ, 2ⁿ-1-1,2ⁿ-1, 2ⁿ+1-1\ (n even)
From MaRDI portal
Publication:2333101
Recommendations
- Reverse converters for a new moduli set \(\{2^{2n} - 1, 2^{n}, 2^{2n} + 1\}\)
- Design of reverse converters for a new flexible RNS five-moduli set \(\{ 2^k, 2^n-1, 2^n+1, 2^{n+1}-1, 2^{n-1}-1 \}\) (\(n\) even)
- 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
- New adder-based RNS-to-binary converters for the \(\{2^{n+1} + 1, 2^{n+1} - 1, 2^{n}\}\) moduli set
Cites work
- A Residue-to-Binary Converter for a New Five-Moduli Set
- Adder based residue to binary number converters for (2/sup n/-1, 2/sup n/, 2/sup n/+1)
- An efficient design of residue to binary converter for four moduli set \((2^{n}-1,2^n + 1,2^{2n}-2,2^{2n+1}-3)\) based on New CRT II
- 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
- An improved residue-to-binary converter
- Design of reverse converters for a new flexible RNS five-moduli set \(\{ 2^k, 2^n-1, 2^n+1, 2^{n+1}-1, 2^{n-1}-1 \}\) (\(n\) even)
- 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
- scientific article; zbMATH DE number 4061135 (Why is no real title available?)
- scientific article; zbMATH DE number 3269473 (Why is no real title available?)
- Residue number systems. Theory and implementation.
- Residue-to-binary converters based on new Chinese Remainder Theorems
- Reverse converters for a new moduli set \(\{2^{2n} - 1, 2^{n}, 2^{2n} + 1\}\)
- RNS Reverse Converters for Moduli Sets With Dynamic Ranges up to $(8n+1)$-bit
- 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\}$
Cited in
(12)- 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\}\)
- Designing efficient two-level reverse converters for moduli set \(\{2^{2n+1}-1,2^{2n},2^{n}-1\}\)
- Reverse conversion using core function, CRT and mixed radix conversion
- Design of reverse converters for a new flexible RNS five-moduli set \(\{ 2^k, 2^n-1, 2^n+1, 2^{n+1}-1, 2^{n-1}-1 \}\) (\(n\) even)
- Reverse converters for a new moduli set \(\{2^{2n} - 1, 2^{n}, 2^{2n} + 1\}\)
- Residue-to-binary number converters for three moduli sets
- On the optimal utilization of all available states in the \(2^{n}\) moduli set
- Moduli selection guidelines for efficient residue-to-decimal conversion
- 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
- 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
- CRTf-Based Reverse Converter for RNS with Low-Cost Modules $$\{{2}^{n},{2}^{n}-1,{2}^{n+1}-1\}$$
- New adder-based RNS-to-binary converters for the \(\{2^{n+1} + 1, 2^{n+1} - 1, 2^{n}\}\) moduli set
This page was built for publication: Reverse converters for the moduli set \(\{2^n, 2^{n-1}-1,2^{n}-1, 2^{n+1}-1\}\) (\(n\) even)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333101)
