A unified radix-4 partial product generator for integers and binary polynomials

Modified Booth recoding is generally employed in sequential and parallel multipliers as it reduces the number of partial products by roughly one half. In this paper we introduce a unified radix-4 partial product generator (PPG) which can be used for two different types of operands: integers and binary polynomials. The generation of partial products in integer-mode is performed according to the modified Booth recoding technique. In polynomial-mode, on the other hand, the partial products are generated in the same way as this is done by a digit-serial polynomial-multiplier with a digit-size of d = 2. As a result we show that the unified radix-4 PPG uses essentially the same hardware for both types of operands. The proposed PPG allows one to design unified radix-4 multiplier architectures for finite fields GF(p) and GF(2^m).