Modified Redundant Representation for Designing Arithmetic Circuits with Small Complexity
From MaRDI portal
Publication:5277654
DOI10.1109/TC.2011.29zbMath1365.94656MaRDI QIDQ5277654
Ferruh Özbudak, Sedat Akleylek
Publication date: 12 July 2017
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Related Items (2)
GF(2n) Redundant Representation Using Matrix Embedding for Irreducible Trinomials ⋮ On the arithmetic operations over finite fields of characteristic three with low complexity
This page was built for publication: Modified Redundant Representation for Designing Arithmetic Circuits with Small Complexity