A high-speed residue-to-binary converter for three-moduli (2ᵏ, 2ᵏ -1, 2ᵏ-1 -1) RNS and a scheme for its VLSI implementation
From MaRDI portal
Publication:2732968
Recommendations
Cited in
(12)- 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\}\)
- An improved residue-to-binary converter
- Novel high-radix residue number system architectures
- Hierarchical residue number systems with small moduli and simple converters
- An efficient residue to binary converter design
- Fast base extension using a redundant modulus in RNS
- Design of residue generators and multioperand adders modulo 3 built of multioutput threshold circuits
- An Overflow-Free Residue Multiplier
- Efficient CRT-based residue-to-binary converter for the arbitrary moduli set
- A VLSI structure forX(modm) operation
- Novel RNS structures for the moduli set \((2^{n}-1, 2^{n}, 2^{n}+1)\) and their application to digital filter implementation
- An efficient RNS parity checker for moduli set \(\{2^n - 1, 2^n + 1, 2^{2n} + 1\}\) and its applications
This page was built for publication: A high-speed residue-to-binary converter for three-moduli \((2^k, 2^k -1, 2^{k-1} -1)\) RNS and a scheme for its VLSI implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2732968)