Bit-Parallel Systolic Multipliers for GF(2m) Fields Defined by All-One and Equally Spaced Polynomials
Issue No. 05 - May (2001 vol. 50)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.926154
<p><b>Abstract</b>—Two operations, the cyclic shifting and the inner product, are defined by the properties of irreducible all one polynomials. An effective algorithm is proposed for computing multiplications over a class of fields <tmath>$GF(2^m)$</tmath> using the two operations. Then, two low-complexity bit-parallel systolic multipliers are presented based on the algorithm. The first multiplier is composed of <tmath>$(m+1)^2$</tmath> identical cells, each consisting of one 2-input <it>AND</it> gate, one 2-input XOR gate, and three 1-bit latches. The other multiplier comprises of <tmath>$(m+1)^2$</tmath> identical cells and <it>mXOR</it> gates. Each cell consists of one 2-input <it>AND</it> gate, one 2-input <it>XOR</it> gate, and four 1-bit latches. Each multiplier exhibits very low latency and propagation delay and is thus very fast. Moreover, the architectures of the two multipliers can be applied in computing multiplications over the class of fields <tmath>$GF(2^m)$</tmath> in which the elements are represented with the root of an irreducible equally spaced polynomial of degree m.</p>
Bit-parallel systolic multiplier, finite field, AOP, ESP.
E. Lu, J. Lee and C. Lee, "Bit-Parallel Systolic Multipliers for GF(2m) Fields Defined by All-One and Equally Spaced Polynomials," in IEEE Transactions on Computers, vol. 50, no. , pp. 385-393, 2001.