Adder based residue to binary number converters for (2/sup n/-1, 2/sup n/, 2/sup n/+1)

DOI10.1109/TSP.2002.1011216MaRDI QIDQ5353633zbMATH OpenOpenAlexFDO

Authors Yuke Wang, Xiaoyu Song, Mostapha Aboulhamid, Hong Shen

Publication date 8 September 2017

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2002.1011216

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Cited in

(8)

• 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
• Hierarchical residue number systems with small moduli and simple converters
• 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

This page was built for publication: Adder based residue to binary number converters for (2/sup n/-1, 2/sup n/, 2/sup n/+1)

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