High-radix modulo r/sup n/ - 1 multipliers and adders
Ioannis Kouretas, Vassilis Paliouras · 2003
In this paper a novel class of Residue Number System (RNS) arithmetic circuits is introduced. The novel circuits feature the radix-r representation of the involved residues, perform operations modulo r/sup n/ - 1, and utilize the end-around carry radix-r arithmetic. The area and time complexity of the proposed high-radix multiplier is compared to published results; the comparisons reveal that the proposed architecture can be several times more efficient in the area/spl times/time complexity sense.