Low-complexity bit-parallel dual basis multipliers using the modified Booths algorithm
New bit-parallel dual basis multipliers using the modified Booths algorithm are presented. Due to the advantage of the modified Booths algorithm, two bits are processed in parallel for reduction of both space and time complexities. A multiplexer-based structure has been proposed for realization of the proposed multiplication algorithm. We have shown that our multiplier saves about 9% space complexity as compared to other existing multipliers if the generating polynomial is trinomial or all one polynomial. Furthermore, the proposed multiplier is faster than existing multipliers.
dual basis booths algorithm trinomials all one polynomial finite field multiplication polynomial basis equally spaced polynomial