Showing papers by "Ramdas Kumaresan published in 1989"
TL;DR: A technique to extend the base of a residue number system (RNS) based on the Chinese remainder theorem (CRT) and the use of a redundant modulus, is proposed and superiority of the technique, compared in terms of latency and hardware requirements to the traditional Szabo-Tanaka method is demonstrated.
Abstract: A technique to extend the base of a residue number system (RNS) based on the Chinese remainder theorem (CRT) and the use of a redundant modulus, is proposed. The technique obtains the residue(s) of a given number in the extended moduli without resorting to the traditional mixed-radix conversion (MRC) algorithm. The base extension can be achieved in log/sub 2/n table lookup cycles, where n is the number of moduli in the RNS. The superiority of the technique, compared in terms of latency and hardware requirements to the traditional Szabo-Tanaka method is demonstrated. >
168 citations
TL;DR: A fast and accurate magnitude scaling technique in the residue number system (RNS) is proposed, based on a judicious decomposition of the Chinese remainder theorem (CRT) and the use of a redundant channel which carries the odd-even information about the integer being scaled.
Abstract: A fast and accurate magnitude scaling technique in the residue number system (RNS) is proposed. This technique obtains the residues of the scaled integer, when scaled by a product of a subset of the moduli, in approximately log n cycles, where n is the total number of moduli in the RNS. The scaled integer has an error of at most unity. The technique is based on a judicious decomposition of the Chinese remainder theorem (CRT) and the use of a redundant channel which carries (at the least) the odd-even information about the integer being scaled. >
53 citations