New adder-based RNS-to-binary converters for the \2ⁿ+1 + 1, 2ⁿ+1 - 1, 2ⁿ\ moduli set
DOI10.5402/2011/272768zbMATH Open1231.94021OpenAlexW3015988819WikidataQ58689157 ScholiaQ58689157MaRDI QIDQ642672FDOQ642672
Authors: Kazeem Alagbe Gbolagade
Publication date: 27 October 2011
Published in: ISRN Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5402/2011/272768
Recommendations
- scientific article
- Reverse converters for the moduli set \(\{2^n, 2^{n-1}-1,2^{n}-1, 2^{n+1}-1\}\) (\(n\) even)
- CRTf-Based Reverse Converter for RNS with Low-Cost Modules $$\{{2}^{n},{2}^{n}-1,{2}^{n+1}-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)
- Reverse converters for a new moduli set \(\{2^{2n} - 1, 2^{n}, 2^{2n} + 1\}\)
reverse convertersresidue number system (RNS)digital signal processing (DSP)binary conversionmoduli set
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Congruences; primitive roots; residue systems (11A07)
Cites Work
Cited In (11)
- Reverse converters for the moduli set \(\{2^n, 2^{n-1}-1,2^{n}-1, 2^{n+1}-1\}\) (\(n\) even)
- Designing efficient two-level reverse converters for moduli set \(\{2^{2n+1}-1,2^{2n},2^{n}-1\}\)
- 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\}\)
- Four-moduli set (\(2, 2^{n}-1, 2^{n}+2^{n-1}-1, 2^{n+1}+2^{n}-1\)) simplifies the residue to binary converters based on CRT II.
- A new high dynamic range moduli set with efficient reverse converter
- Design methods for binary to decimal converters using arithmetic decompositions
- Moduli selection guidelines for efficient residue-to-decimal conversion
- Reverse conversion using core function, CRT and mixed radix conversion
- CRTf-Based Reverse Converter for RNS with Low-Cost Modules $$\{{2}^{n},{2}^{n}-1,{2}^{n+1}-1\}$$
- Reference Points Based RNS Reverse Conversion for General Moduli Sets
- Novel RNS structures for the moduli set \((2^{n}-1, 2^{n}, 2^{n}+1)\) and their application to digital filter implementation
This page was built for publication: New adder-based RNS-to-binary converters for the \(\{2^{n+1} + 1, 2^{n+1} - 1, 2^{n}\}\) moduli set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q642672)