Research hardware complexity of multipliers of extended Galois field GF(dm)
No Thumbnail Available
Date
2016
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Lviv Polytechnic Publishing House
Abstract
The paper analyzes the hardware costs of multipliers of extended Galois fields GF(dm). There are compared realised on modern FPGA Galois fields multipliers hardware cost to select Galois field GF(dm) with approximately the same number of elements and the lowest multiplier hardware complexity. Totally the hardware cost increases while basics of the field increase. Local minimums for odd d correspond to d = 2i-1 and the global minimum for analisys based on Guild cell with realization like single unit corresponds to the value d = 3 and based on Guild cell with its multiplier and adder separate realization – the value d=7.
Description
Keywords
Galois fields GF(dm), multiplier, modified Guild cell, LUT
Citation
Zholubak I. Research hardware complexity of multipliers of extended Galois field GF(dm) / Ivan Zholubak, Valeriy Hlukhov // Litteris et Artibus : proceedings of the 6th International youth science forum, November 24–26, 2016, Lviv, Ukraine / Lviv Polytechnic National University. – Lviv : Lviv Polytechnic Publishing House, 2016. – P. 107–108. – Bibliography: 6 titles.