Modulo Operation Free Reverse Conversion in the {2^(2n+1)-1,2^n,2^2n-1} Moduli Set

This paper proposes a fast Mixed Radix Conversion based reverse converter for the recently proposed moduli set . It shows that the computation of multiplicative inverses could be eliminated from the conversion process and presents a low complexity and modulo operation free implementation. Theoretical analysis shows that the proposed scheme outperforms all state of the art equivalent converters in terms of both area cost and delay. General Terms Residue Number System, Circuits and Systems, Computer Arithmetic, Computer Architecture, Digital Signal Processing.