A modified Massey-Omura parallel multiplier for a class of finite fields

TitleA modified Massey-Omura parallel multiplier for a class of finite fields
Publication TypeJournal Article
Year of Publication1993
AuthorsHasan, M. A., M. Z. Wang, and V. K. Bhargava
JournalComputers, IEEE Transactions on
Volume42
Pagination1278 -1280
Date Publishedoct.
ISSN0018-9340
Keywordscyclically shifted versions, digital arithmetic, finite fields, input cyclic shift, lower circuit complexity, Massey-Omura parallel multiplier, multiplying circuits, polynomials, redundancy
Abstract

A Massey-Omura parallel multiplier of finite fields GF(2m ) contains m identical blocks whose inputs are cyclically shifted versions of one another. It is shown that for fields GF(2m) 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

URLhttp://dx.doi.org/10.1109/12.257715
DOI10.1109/12.257715

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2021 The University of British Columbia