Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding

DOI10.1109/TC.1985.1676602zbMath0566.94011MaRDI QIDQ3682389

Thu van Vu

Publication date: 1985

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

zbMATH Keywords

fractional representationresidue number systemsquotient-remainder representationresidue decoding

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Decoding (94B35)

Related Items (9)

Bits and relative order from residues, space efficiently ⋮ RNS sign detector based on Chinese remainder theorem II (CRT II) ⋮ RNS architectures for the implementation of the `diagonal function' ⋮ Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem ⋮ Positional characteristics for efficient number comparison over the homomorphic encryption ⋮ AC-RRNS: anti-collusion secured data sharing scheme for cloud storage ⋮ An improved Chen's parity detection technique for the two-moduli set ⋮ An efficient parity detection technique using the two-moduli set \(\{2^{h} - 1, 2^{h} + 1\}\) ⋮ A fully parallel algorithm for residue to binary conversion

This page was built for publication: Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding