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\}\)

DOI10.1007/S13369-014-0963-4zbMath1392.11096OpenAlexW2482475948MaRDI QIDQ1639857

R. Farshidi, Mohammad Reza Noorimehr, Mehdi Hosseinzadeh

Publication date: 13 June 2018

Published in: Arabian Journal for Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13369-014-0963-4

zbMATH Keywords

residue number systemcomputer arithmeticreverse converternew Chinese remainder theorem 1

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Congruences; primitive roots; residue systems (11A07)

Related Items (2)

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 ⋮ Designing efficient two-level reverse converters for moduli set \(\{2^{2n+1}-1,2^{2n},2^{n}-1\}\)

Cites Work

• Unnamed Item
• Unnamed Item
• Residue-to-binary converters based on new Chinese remainder theorems
• A high-speed residue-to-binary converter for three-moduli (2/sup k/, 2/sup k/-1, 2/sup k-1/-1) RNS and a scheme for its VLSI implementation
• A new efficient memoryless residue to binary converter
• Design of residue generators and multioperand adders modulo 3 built of multioutput threshold circuits
• Fast Modulo 2^{n} - (2^{n - 2} + 1) Addition: A New Class of Adder for RNS
• RNS-to-Binary Converters for Two Four-Moduli Sets <formula formulatype="inline"><tex>$\{2^{n}-1,2^{n},2^{n}+1,2^{{n}+1}-1\}$</tex></formula> and <formula formulatype="inline"><tex>$\{2^{n}-1,2^{n},2^{n}+1,2^{{n}+1}+1\}$</tex></formula>
• Adder based residue to binary number converters for (2/sup n/-1, 2/sup n/, 2/sup n/+1)

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