Multiplexer-based array multipliers

DOI10.1109/12.743408zbMath1392.68056OpenAlexW2114427352MaRDI QIDQ4571388

K. Z. Pekmestzi

Publication date: 9 July 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.743408

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Mathematical problems of computer architecture (68M07) Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items (3)

Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial ⋮ Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm ⋮ Low-complexity multiplexer-based normal basis multiplier over \(GF(2^m)\)

This page was built for publication: Multiplexer-based array multipliers