SIGMA: a VLSI systolic array implementation of a Galois field GF(2/sup m/) based multiplication and division algorithm
- 1 March 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 1 (1) , 22-30
- https://doi.org/10.1109/92.219904
Abstract
Finite or Galois fields are used in numerous applications like error correcting codes, digital signal processing and cryptography. The design of efficient methods for Galois field arithmetic such as multiplication and division is critical for these applications. A new algorithm based on a pattern matching technique for computing multiplication and division in GF(2/sup m/) is presented. An efficient systolic architecture is described for implementing the algorithm which can produce a new result every clock cycle and the multiplication and division operations can be interleaved. The architecture has been implemented using 2- mu m CMOS technology. The chip yields a computational rate of 33.3 million multiplications/divisions per second.Keywords
This publication has 11 references indexed in Scilit:
- A VLSI design for computing exponentiations in GF(2/sup m/) and its application to generate pseudorandom number sequencesIEEE Transactions on Computers, 1990
- A new algorithm for multiplication in finite fieldsIEEE Transactions on Computers, 1989
- A VLSI architecture for fast inversion in GF(2/sup m/)IEEE Transactions on Computers, 1989
- AT/sup 2/-optimal Galois field multiplier for VLSIIEEE Transactions on Computers, 1989
- A Construction Method of High-Speed Decoders Using ROM's for Bose–Chaudhuri–Hocquenghem and Reed–Solomon CodesIEEE Transactions on Computers, 1987
- A Fast VLSI Multiplier for GF(2m)IEEE Journal on Selected Areas in Communications, 1986
- VLSI Architectures for Computing Multiplications and Inverses in GF(2m)IEEE Transactions on Computers, 1985
- Systolic Multipliers for Finite Fields GF(2m)IEEE Transactions on Computers, 1984
- A Cellular-Array Multiplier for GF(2m)IEEE Transactions on Computers, 1971
- Computation with finite fieldsInformation and Control, 1963