The Community for Technology Leaders
Green Image
<p>A Massey-Omura parallel multiplier of finite fields GF(2/sup m/) contains m identical blocks whose inputs are cyclically shifted versions of one another. It is shown that for fields GF(2/sup m/) generated by irreducible all one polynomials, a portion of the block is independent of the input cyclic shift; hence, the multiplier contains redundancy. By removing the redundancy, a modified parallel multiplier is presented which is modular and has a lower circuit complexity.</p>
Massey-Omura parallel multiplier; finite fields; cyclically shifted versions; polynomials; input cyclic shift; redundancy; lower circuit complexity; digital arithmetic; multiplying circuits; polynomials.

V. Bhargava, M. Wang and M. Hasan, "A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields," in IEEE Transactions on Computers, vol. 42, no. , pp. 1278-1280, 1993.
82 ms
(Ver 3.3 (11022016))