Pages that link to "Item:Q1639857"
From MaRDI portal
The following pages link to 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):
Displaying 7 items.
- 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 (Q531242) (← links)
- Four-moduli set (\(2, 2^{n}-1, 2^{n}+2^{n-1}-1, 2^{n+1}+2^{n}-1\)) simplifies the residue to binary converters based on CRT II. (Q1416365) (← links)
- Reverse converters for the moduli set \(\{2^n, 2^{n-1}-1,2^{n}-1, 2^{n+1}-1\}\) (\(n\) even) (Q2333101) (← links)
- Designing efficient two-level reverse converters for moduli set \(\{2^{2n+1}-1,2^{2n},2^{n}-1\}\) (Q2338341) (← links)
- An efficient design of residue to binary converter for four moduli set \((2^{n}-1,2^n + 1,2^{2n}-2,2^{2n+1}-3)\) based on New CRT II (Q2465982) (← 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)
- 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 (Q5349706) (← links)
