Residue number system
no vote
A reverse convertor moduli set {2n+1,2n,2n-1} is proposed in this paper. Chinese Remainder Theorem is simplified
to get a reverse converter that uses mod-{2n-1} operations. Here the burden of explicit usage of the moduli is discarded .These reverse convertors are used to find the multiplicative inverse of the RNS value. In order to restrict the range we makes use of radix-8 booth modified rns multiplier in the proposed converter and the best equivalent state of the art converters on cyclone2 FPGA. when compare to other convertors this architecture saves power ,area,delay and cost reduced