Abstract
Galois-field multiplication algorithms and their systolic realizations are proposed. Parallel and serial architectures as well as their VLSI implementations are presented. They are based on the standard-basis representation of the Galois-field elements. Our algorithms allow the two operands to enter the systolic arrays in the same order. Only one control signal for the serial systolic array is required as compared to two in the previous design. Our multipliers are more regular and modular, requiring simple control signal, and compact in terms of silicon area; they are well suited to VLSI implementation. Expansion to higher order Galois fields are easier to realize than other multipliers. High throughput rates are achieved due to their systolic array architectures.
Similar content being viewed by others
References
E.R. Berlekamp, “Bit-Serial Reed-Solsmon Encoders,”IEEE Trans. on Inform., Vol. IT-28, pp. 869–874, 1982.
B. Benjauthrit and I.S. Reed, “Galois switching functions and their applications,”IEEE Trans. Computers, Vol. C-25, pp. 78–86, 1976.
T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,”IEEE Trans. Information Theory, Vol. 31, pp. 469–472, 1985.
T.C. Bartee and D.I. Schneider, “Computation with finite fields,”Inform. Contr., Vol. 6, pp. 79–98, 1963.
B.A. Laws and C.K. Rushforth, “A cellular-array multiplier for GF(2m),”IEEE Trans. Computers, Vol. C-20, pp. 1573–1578, 1971.
C.S. Yeh, I.S. Reed, and T.K. Truong, “Systolic Multipliers for Finite Fields GF(2m),”IEEE Trans. Computers, Vol. C-33, pp. 357–360, 1984.
C.C. Wang, T.K. Truong, H.M. Shao, L.J. Deutsch, J.K. Omura, and I.S. Reed, “VLSI Architectures for Computing Multiplications and Inverses GF(2m),”IEEE Trans. Computers, Vol. C-34, pp. 709–717, 1985.
P.A. Scott, S.E. Tavares, and L.E. Peppard, “A Fast VLSI Multiplier for GF(2m),”IEEE J. Selected Areas in Communications, Vol. 4, pp. 62–65, 1986.
B.B. Zhou, “A New Bit-Serial Systolic Multiplier Over GF(2m),”IEEE Trans. Computers, Vol. 37, pp. 749–751, 1988.
I.S. Hsu, T.K. Truong, L.J. Deutsch, and I.S. Reed, “A comparison of VLSI architecture of finite field multipliers using dual, normal or standard bases,”IEEE Trans. Computers, Vol. 37, pp. 735–739, 1988.
S. Bandyopadhyay and A. Sengupta, “Algorithm for Multiplication in Galois Field for Implementation Using Systolic Arrays,”IEE Proc. Pt. E, Vol. 135, pp. 336–339, 1988.
A. Pincin, “A new algorithm for multiplication in finite fields,”IEEE Trans. Computers, Vol. C-38, pp. 1045–1049, 1989.
M. Fürer and K. Mehlhorn, “AT2-optimal Galois multiplier for VLSI,”IEEE Trans. Computers, Vol. 38, pp. 1333–1336, 1989.
G.L. Feng, “A VLSI architecture for fast inversion in GF(2m),”IEEE Trans. Computers, Vol. C-25, pp. 1383–1386, 1989.
H.-T. Kung, “Why systolic architectures,”IEEE Computer, pp. 37–45, Jan. 1982.
R.N. Mayo, M.H. Arnold, W.S. Scott, D. Stark, and G.T. Hamachi, “1990 DECWRL/Livermore Magic release,” DECWRL Research Report 90/7, DEC Western Research Laboratory, Palo Alto, Sept. 1990.
Author information
Authors and Affiliations
Additional information
This work was supported in part by the National Science Council, R.O.C., under Contracts NSC80-0404-E007-02 and NSC80-0404-E007-33.
Rights and permissions
About this article
Cite this article
Wu, CW., Chang, MK. Bit-level systolic arrays for finite-field multiplications. Journal of VLSI Signal Processing 10, 85–92 (1995). https://doi.org/10.1007/BF02407028
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02407028