An efficient 3-modulus residue to binary converter

An efficient algorithm, which converts the residue numbers, with moduli set {2^k+1,2^k,2^k-1} into an equivalent binary number, is presented; the algorithm improves on a previously published technique. A novel hardware implementation is also discussed. In comparison to the cited converter; the hardware savings are in excess of 66% and a reduction of 30% in the critical path is obtained