GALOIS FIELDS ELEMENTS MULTISECTION MULTIPLIERS STRUCTURAL COMPLEXITY REDUCTION

  • Валерій Сергійович Глухов National University "Lviv Polytechnic"
  • Еліас Родріг Мітрі Lebanese International University

Abstract

The article discusses the approach to reducing the structural complexity of multi-multipliers binary
elements of Galois fields. The hardware complexity of multipliers allows for them to Field-Programmable Gate Array,
but due to the structural complexity of combinatorial make it impossible. The paper proposes a preliminary ordering
matrix using the agitator and its implementation of the same type of logical multiplication of matrices. As a
consequence, achieved by reducing the number of matrices, reducing their hardware and structural complexity due to
multiple use.

Author Biographies

Валерій Сергійович Глухов, National University "Lviv Polytechnic"
doctor of technical sciences, professor
Еліас Родріг Мітрі, Lebanese International University
Candidate of Technical Sciences, Instructor of the Department of Electrical Engineering and Electronic Engineering
Published
2019-03-10
How to Cite
Глухов, В., & Мітрі, Е. (2019). GALOIS FIELDS ELEMENTS MULTISECTION MULTIPLIERS STRUCTURAL COMPLEXITY REDUCTION. Electrotechnic and Computer Systems, (19(95), 222-226. Retrieved from https://eltecs.op.edu.ua/index.php/journal/article/view/1900
Section
Computer Systems, Networks and their Components