Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding
From MaRDI portal
Publication:3682389
DOI10.1109/TC.1985.1676602zbMATH Open0566.94011MaRDI QIDQ3682389FDOQ3682389
Authors: Thu van Vu 
Publication date: 1985
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Recommendations
- RNS sign detector based on Chinese remainder theorem II (CRT II)
- Comments on ``Residue-to-binary converters based on new Chinese remainder theorems.
- Efficient CRT-based residue-to-binary converter for the arbitrary moduli set
- Residue-to-binary converters based on new Chinese Remainder Theorems
- scientific article; zbMATH DE number 3861070
Cited In (13)
- Error analysis of approximate Chinese-remainder-theorem decoding
- AC-RRNS: anti-collusion secured data sharing scheme for cloud storage
- Positional characteristics for efficient number comparison over the homomorphic encryption
- Comments on ``Residue-to-binary converters based on new Chinese remainder theorems.
- RNS sign detector based on Chinese remainder theorem II (CRT II)
- Bits and relative order from residues, space efficiently
- Fast arithmetics using Chinese remaindering
- RNS architectures for the implementation of the `diagonal function'
- An efficient parity detection technique using the two-moduli set \(\{2^{h} - 1, 2^{h} + 1\}\)
- Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem
- A weight pre-assignment scheme for Chinese remainder theorem
- A fully parallel algorithm for residue to binary conversion
- An improved Chen's parity detection technique for the two-moduli set
This page was built for publication: Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3682389)
