论文信息 - Systolic dual basis serial multiplier

Systolic dual basis serial multiplier

The paper presents a systolic serial dual basis multiplier for the Galois field GF(2/sup m/) which is based on the Berlekamp-like multiplication algorithm. It needs only one control signal and is easy to simplify for the field which is generated by the irreducible polynomial x/sup m/+x+1. The multiplier's architecture is highly regular, modular and easily expandable, hence it is suitable for implementation using VLSI technologies.

J. J. Wozniak

[1] Yves Robert,et al. Algorithmes et architectures systoliques , 1989 .

[2] Mohammed Benaissa,et al. GF(2^m) Multiplication and Division Over the Dual Basis , 1996, IEEE Trans. Computers.

[3] Mohammed Benaissa,et al. Bit-serial Berlekamp-like multipliers for GF(2m) , 1995 .

[4] Mohammed Benaissa,et al. A dual basis bit-serial systolic multiplier for GF(2m) , 1995, Integr..

[5] A. Poli,et al. New bit-serial systolic multiplier for GF(2/sup m/) using irreducible trinomials , 1991 .

[6] Elwyn R. Berlekamp,et al. Bit-serial Reed - Solomon encoders , 1982, IEEE Transactions on Information Theory.

[7] M. Benaissa,et al. Dual basis systolic multipliers for GF(2m) , 1997 .

[8] Patrice Quinton,et al. Systolic Gaussian Elimination over GF(p) with Partial Pivoting , 1989, IEEE Trans. Computers.

[9] R. McEliece. Finite Fields for Computer Scientists and Engineers , 1986 .

[10] Harald Niederreiter,et al. Introduction to finite fields and their applications: List of Symbols , 1986 .