Designing efficient two-level reverse converters for moduli set \2²ⁿ+1-1,2²ⁿ,2ⁿ-1\

DOI10.1007/S00034-018-0756-1MaRDI QIDQ2338341zbMATH OpenOpenAlexFDO

Authors Navid SalehiTabrizi, Shiva Taghipour Eivazi

Publication date 21 November 2019

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

Full work available at URL https://doi.org/10.1007/s00034-018-0756-1

zbMATH Keywords

computer arithmeticmixed-radix conversionparallel computationresidue number systemVLSI architectures

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• 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
• Reverse converters for the moduli set \(\{2^n, 2^{n-1}-1,2^{n}-1, 2^{n+1}-1\}\) (\(n\) even)
• 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\}\)
• 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 residue to binary converter design
• 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
• 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\}\)
• scientific article; zbMATH DE number 3269473 (Why is no real title available?)
• Residue number systems. Theory and implementation.

Cited in

(7)

• 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)
• A new high dynamic range moduli set with efficient reverse converter
• Reverse converters for a new moduli set \(\{2^{2n} - 1, 2^{n}, 2^{2n} + 1\}\)
• Efficient reverse converter design for five moduli set \(\{2^n,2^{2n+1}-1,2^{n/2}-1,2^{n/2}+1,2^n+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
• 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

This page was built for publication: Designing efficient two-level reverse converters for moduli set \(\{2^{2n+1}-1,2^{2n},2^{n}-1\}\)

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