JOURNAL ARTICLE

Bit-level pipelined digit serial GF(2/sup m/) multiplier

Abstract

A low latency digit serial multiplier for GF(2/sup m/) that can be pipelined to the bit-level is presented in this paper. Unlike existing structures, the new multiplier does not put any restriction on the type of generator polynomial used or the digit size. Furthermore, the latency of the new multiplier is significantly less than the latency of the existing bit-level pipelined digit-serial multiplier.

Keywords:
GF(2) Multiplier (economics) Arithmetic Computer science Numerical digit Parallel computing Latency (audio) Computer hardware Finite field Mathematics Discrete mathematics Telecommunications

Metrics

8
Cited By
1.86
FWCI (Field Weighted Citation Impact)
10
Refs
0.86
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Coding theory and cryptography
Physical Sciences →  Computer Science →  Artificial Intelligence
Numerical Methods and Algorithms
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Algorithms and Data Compression
Physical Sciences →  Computer Science →  Artificial Intelligence

Related Documents

JOURNAL ARTICLE

Bit-level pipelined digit-serial multiplier

A. AggounA.S. AshurM.K. Ibrahim

Journal:   International Journal of Electronics Year: 1993 Vol: 75 (6)Pages: 1209-1219
JOURNAL ARTICLE

Dual basis digit serial GF(2m) multiplier

M.K. IbrahimA. Aggoun

Journal:   International Journal of Electronics Year: 2002 Vol: 89 (7)Pages: 517-523
JOURNAL ARTICLE

A digit-serial multiplier for finite field GF(2/sup m/)

Chang‐Hoon KimChun Pyo HongSoonhak Kwon

Journal:   IEEE Transactions on Very Large Scale Integration (VLSI) Systems Year: 2005 Vol: 13 (4)Pages: 476-483
JOURNAL ARTICLE

A new bit-serial systolic multiplier over GF(2/sup m/)

Bing Bing Zhou

Journal:   IEEE Transactions on Computers Year: 1988 Vol: 37 (6)Pages: 749-751
© 2026 ScienceGate Book Chapters — All rights reserved.