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)

DOI10.1007/S00034-017-0530-9zbMath1373.94680OpenAlexW2599411701WikidataQ59603624 ScholiaQ59603624MaRDI QIDQ2411718

Piotr Patronik, Stanisław J. Piestrak

Publication date: 25 October 2017

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

Full work available at URL: https://doi.org/10.1007/s00034-017-0530-9

zbMATH Keywords

computer arithmeticresidue number system (RNS)reverse converterdigital signal processing (DSP)

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Miscellaneous applications of number theory (11Z05)

Related Items (1)

Reverse converters for the moduli set \(\{2^n, 2^{n-1}-1,2^{n}-1, 2^{n+1}-1\}\) (\(n\) even)

Cites Work

• Digital signal processing with field programmable gate arrays. With CD-ROM.
• Reverse converters for a new moduli set \(\{2^{2n} - 1, 2^{n}, 2^{2n} + 1\}\)
• An improved residue-to-binary converter
• Residue-to-binary converters based on new Chinese remainder theorems
• Residue Number Systems
• Design of residue generators and multioperand adders modulo 3 built of multioutput threshold circuits
• Fast Parallel-Prefix Architectures for Modulo 2n-1 Addition with a Single Representation of Zero
• A Residue-to-Binary Converter for a New Five-Moduli Set
• Area-Power Efficient Modulo $2^{n}-1$ and Modulo $2^{n}+1$ Multipliers for $\{2^{n}-1, 2^{n}, 2^{n}+1\}$ Based RNS
• 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]

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