Publication | Closed Access
A modified Massey-Omura parallel multiplier for a class of finite fields
138
Citations
6
References
1993
Year
Finite FieldsEngineeringParallel Complexity TheoryAlgebraic ComplexityModified Parallel MultiplierComputer EngineeringMassey-omura Parallel MultiplierParallel ImplementationFinite FieldParallel ProcessingParallel ProgrammingParallel ComputingFinite Fields Gf
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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
| Year | Citations | |
|---|---|---|
Page 1
Page 1