New adder-based RNS-to-binary converters for the \2ⁿ+1 + 1, 2ⁿ+1 - 1, 2ⁿ\ moduli set
Summary: We investigate a Residue Number System (RNS) for binary conversion, which is an important issue concerning the utilization of RNS numbers in Digital Signal Processing (DSP) applications. We propose two new reverse converters for the moduli set \(\{2^{n+1} + 1, 2^{n+1} - 1, 2^{n}\}\). First, we simplify the Chinese Remainder Theorem (CRT) to obtain a reverse converter that uses mod-\((2^{n+1} - 1)\) operations instead of mod-\((2^{n+1} + 1)(2^{n+1} - 1)\) operations required by other state-of-the-art equivalent converters. Next, we further reduce the hardware complexity by making the resulting reverse converter architecture adder-based. Two hybrid Cost-Efficient (CE) and Speed-Efficient (SE) reverse converters are proposed. These two hybrid converters are obtained by combining the best state-of-the-art converter with the newly introduced area-delay efficient scheme. The proposed hybrid CE converter outperforms the best state-of-the-art CE converter in terms of delay with similar area cost. Additionally, the proposed hybrid SE converter requires less area cost with smaller delay when compared to the best state-of-the-art equivalent SE converter.
- scientific article; zbMATH DE number 5360581
- 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\}\)
- A study of the residue-to-binary converters for the three-moduli sets
- Adder based residue to binary number converters for (2/sup n/-1, 2/sup n/, 2/sup n/+1)
- scientific article; zbMATH DE number 5360581 (Why is no real title available?)
- scientific article; zbMATH DE number 3269473 (Why is no real title available?)
- 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.
- 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\}\)
- 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\}\)
- Reverse conversion using core function, CRT and mixed radix conversion
- A new high dynamic range moduli set with efficient reverse converter
- Moduli selection guidelines for efficient residue-to-decimal conversion
- Design methods for binary to decimal converters using arithmetic decompositions
- 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)
