RNS sign detector based on Chinese remainder theorem II (CRT II)
From MaRDI portal
Publication:1879561
DOI10.1016/S0898-1221(03)90191-XzbMath1056.94019MaRDI QIDQ1879561
Publication date: 23 September 2004
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Number-theoretic algorithms; complexity (11Y16) Analytic circuit theory (94C05) Congruences; primitive roots; residue systems (11A07) Mathematical problems of computer architecture (68M07)
Cites Work
- Unnamed Item
- Residue-to-binary converters based on new Chinese remainder theorems
- Residue-to-binary number converters for three moduli sets
- Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding
- An efficient residue to binary converter design
- Fast conversion techniques for binary-residue number systems
- An RNS to binary converter in a three moduli set with common factors
- A new technique for fast number comparison in the residue number system
- A novel division algorithm for the residue number system
This page was built for publication: RNS sign detector based on Chinese remainder theorem II (CRT II)