A Suggestion for a fast residue multiplier for a family of moduli of the form (2n-(2p±1))

The family of moduli that has the form (2(n) - (2(p) +/- 1)) is considered in this paper. A suggestion for a fast residue multiplier for this family of moduli is introduced. The multiplication algorithm proposed in this paper generates (2n + p - 2) partial products; however, it compresses the magnitude of each partial product to be less than 2(n). Although it requires an additional integrated circuit area compared with the most recent published study, the new proposed modular multiplier has a logarithmic delay, which makes it faster than any other modular multiplier. Moreover, it is even faster than binary-based iterative array multipliers with a final CLA addition. The proposed modular multiplier is very suitable for medium and large dynamic ranges.