Low-complexity systolic multiplier over GF(2m) using weakly dual basis

Chiou Yng Lee, Ya Cheng Lu, Erl Huei Lu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

This paper offers a new bit-parallel systolic multiplier for GF(2m) using the weakly dual basis. The multiplier is composed of two units - multiplication and transformation. The structure of the multiplication unit includes m2 cells, each cell is composed of one 2-input AND gate, one 2-input XOR gate and three/four 1-bit latches. The structure of the transformation unit is established by the 2-input XOR-tree. The latency of the multiplier only requires m+[log2m] clock cycles.

Original languageEnglish
Title of host publicationProceedings - APCCAS 2002
Subtitle of host publicationAsia-Pacific Conference on Circuits and Systems
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages367-372
Number of pages6
ISBN (Electronic)0780376900
DOIs
StatePublished - 2002
EventAsia-Pacific Conference on Circuits and Systems, APCCAS 2002 - Denpasar, Bali, Indonesia
Duration: 28 10 200231 10 2002

Publication series

NameIEEE Asia-Pacific Conference on Circuits and Systems, Proceedings, APCCAS
Volume1

Conference

ConferenceAsia-Pacific Conference on Circuits and Systems, APCCAS 2002
Country/TerritoryIndonesia
CityDenpasar, Bali
Period28/10/0231/10/02

Bibliographical note

Publisher Copyright:
© 2002 IEEE.

Keywords

  • Arithmetic
  • Circuits
  • Clocks
  • Computer architecture
  • Concurrent computing
  • Cryptography
  • Delay
  • Error correction codes
  • Galois fields
  • Polynomials

Fingerprint

Dive into the research topics of 'Low-complexity systolic multiplier over GF(2m) using weakly dual basis'. Together they form a unique fingerprint.

Cite this