Residue-to-binary converters based on new Chinese remainder theorems
From MaRDI portal
Publication:2732942
DOI10.1109/82.826745zbMath0979.68002OpenAlexW2143420045MaRDI QIDQ2732942
Publication date: 4 September 2001
Published in: IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/82.826745
Related Items (15)
RNS sign detector based on Chinese remainder theorem II (CRT II) ⋮ 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 conversion using core function, CRT and mixed radix conversion ⋮ Design of reverse converters for a new flexible RNS five-moduli set \(\{ 2^k, 2^n-1, 2^n+1, 2^{n+1}-1, 2^{n-1}-1 \}\) (\(n\) even) ⋮ A new high dynamic range moduli set with efficient reverse converter ⋮ 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. ⋮ Positional characteristics for efficient number comparison over the homomorphic encryption ⋮ AC-RRNS: anti-collusion secured data sharing scheme for cloud storage ⋮ A general method for to decompose modular multiplicative inverse operators over Group of units ⋮ 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 ⋮ 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 ⋮ Further results on the distinctness of modulo 2 reductions of primitive sequences over \(\mathbb{Z}/(2^{32}-1)\) ⋮ Efficient CRT-based residue-to-binary converter for the arbitrary moduli set ⋮ Reverse converters for the moduli set \(\{2^n, 2^{n-1}-1,2^{n}-1, 2^{n+1}-1\}\) (\(n\) even)
This page was built for publication: Residue-to-binary converters based on new Chinese remainder theorems
