The following pages link to (Q3534151):
Displaying 14 items.
- New adder-based RNS-to-binary converters for the \(\{2^{n+1} + 1, 2^{n+1} - 1, 2^{n}\}\) moduli set (Q642672) (← links)
- Novel RNS structures for the moduli set \((2^{n}-1, 2^{n}, 2^{n}+1)\) and their application to digital filter implementation (Q672212) (← links)
- An efficient algorithm and parallel implementations for binary and residue number systems (Q689112) (← links)
- An efficient RNS parity checker for moduli set \(\{2^n - 1, 2^n + 1, 2^{2n} + 1\}\) and its applications (Q954477) (← links)
- Mod \(m\) arithmetic in binary systems (Q1183492) (← links)
- Floating-point numbers in residue number systems (Q1192180) (← links)
- A fully parallel algorithm for residue to binary conversion (Q1321825) (← links)
- 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\}\) (Q1639857) (← links)
- A new high dynamic range moduli set with efficient reverse converter (Q2426888) (← links)
- Comments on ``The digit parallel method for fast RNS to weighted number system conversion for specific moduli \((2^k -1, 2^k, 2^k +1)\)'' (Q2732956) (← links)
- Novel high-radix residue number system architectures (Q2732958) (← links)
- 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 (Q2732968) (← links)
- Residue-to-binary number converters for three moduli sets (Q2733037) (← links)
- Methodology for basic selection in recursive residue number system (Q2809174) (← links)
