Ringed bit-parallel systolic multipliers over a class of fields GF(2m)

This paper presents ringed bit-parallel systolic multipliers for computing AB+C over a class of finite fields GF(2m), in which all elements are represented using a root of an all-one polynomial or an equally spaced polynomial. Compared to other related multipliers, the proposed multipliers reveal properties of lower hardware complexity, lower latency and free of global connection. Furthermore, we proposed a general rule to plan the multipliers. This rule makes the planning easy.