Modulo-free architecture for binary to residue transformation with respect to {2m-1, 2m, 2m+1} moduli set

A binary to residue converter architecture based on the {2^m -1, 2^m, 2^m+1} moduli set is presented. This is achieved by deriving a formula to compute the residue of an integer with respect to the modulus 2^m+1. By replacing the end-around carry propagate stage with a simple multiplexer, the delay is reduced to O(m) adder delays. The proposed architecture is free of module adders