Skip to Main content Skip to Navigation

Sequential Multiplier with Sub-linear Gate Complexity

Anwar Hasan 1 Christophe Negre 2
1 ECE - Department of Electrical and Computer Engineering [Waterloo]
2 DALI - Digits, Architectures et Logiciels Informatiques
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, UPVD - Université de Perpignan Via Domitia
Abstract : In this article, we present a new sequential multiplier for extended binary finite fields. Like its existing counterparts, the proposed multiplier has a linear complexity in flip-flop or temporary storage requirements, but a sub-linear complexity in gate counts. For the underlying polynomial multiplication, the proposed field multiplier relies on the Horner scheme.
Keywords : sub-linear gate complexity Binary polynomial multiplication sequential multiplier Horner scheme sub-linear gate complexity.
Document type :
Reports
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download
https://hal.inria.fr/hal-00712085
Contributor : Christophe Negre <>
Submitted on : Tuesday, June 26, 2012 - 1:50:03 PM
Last modification on : Thursday, May 24, 2018 - 3:59:23 PM
Document(s) archivé(s) le : Thursday, September 27, 2012 - 2:40:28 AM

File

Vignette du document
sub-linv16.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00712085, version 1

Collections

CNRS | UNIV-PERP | DALI | LIRMM | LARA | MIPS | UNIV-MONTPELLIER

Citation

Anwar Hasan, Christophe Negre. Sequential Multiplier with Sub-linear Gate Complexity. [Research Report] 2012, pp.12. ⟨hal-00712085⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

302

Files downloads

591

 

Contact                    Legal Notice                    Personal Data