Algorithm for modulo (2 n +1) multiplication
Leonel A. Sousa · Electronics Letters · 2003
An algorithm for designing efficient modulo (2n+1) multipliers based on Booth recoding is proposed. With this algorithm, Wallace-tree adders can be used to design the fastest among all known modulo (2n+1) multipliers.