The least complex parallel Massey-Omura multiplier and its LCA and VLSI designs

Abstract

After reviewing the Massey-Omura multiplier, as an illustrative example it is shown that there are three polynomials which generate GF(2/sup 5/) in normal basis representation. The three multipliers based on these polynomials are considered and the polynomial which results in the least complex multiplier design is found. Then, based on this polynomial and the resultant design, LCA and VLSI implementation of the GF(2s/sup 5/) multiplier is considered and compared.<>