An universal architecture for designing modulo (2ⁿ-2^p-1) multipliers

Abstract

In this express, we propose an extending method, which extends the residue set of modulus (2ⁿ-2^p-1) from [0,2ⁿ-2^p-1) to [0,2ⁿ-1]. The proposed extending method can simplify modulo (2ⁿ-2^p-1) operations and we can simply cope with the bits weighted by 2^n+k(k≥0). With the proposed extending method, we propose an universal architecture for designing high-efficient modulo (2ⁿ-2^p-1) multipliers on the condition n≥2p+1. Synthesized results demonstrate that the proposed modulo (2ⁿ-2^p-1) multipliers have a good performance.