Parallel programmable finite field GF (2/sup m/) multipliers

Block (cyclic) channel coding standards for third generation cellular networks require the implementation of high-performance burst-error detection and correction algorithms. Galois field (GF) arithmetic is commonly used in this architecture for encoding and decoding error codes, however, many architectures still do not support dedicated functional units. This paper presents the design of a generic parallel finite-field GF (2/sup m/) multiplier targeted at DSP and embedded processors. As opposed to previous research, this design has the ability to utilize different primitive polynomials as an input, thereby, being able to be programmable. Moreover, a design is presented that is a combined binary and finite-field GF (2/sup m/) multiplier. Area, delay, and power dissipation results are presented from several ASIC libraries.

[1]  Stephen B. Wicker,et al.  Reed-Solomon Codes and Their Applications , 1999 .

[2]  Michael J. Schulte,et al.  A combined 16-bit binary and dual Galois field multiplier , 2002, IEEE Workshop on Signal Processing Systems.

[3]  Edoardo D. Mastrovito,et al.  VLSI Designs for Multiplication over Finite Fields GF (2m) , 1988, AAECC.

[4]  James E. Stine,et al.  A standard cell library for student projects , 2003, Proceedings 2003 IEEE International Conference on Microelectronic Systems Education. MSE'03.

[5]  Christof Paar,et al.  Comparison of arithmetic architectures for Reed-Solomon decoders in reconfigurable hardware , 1997, Proceedings. The 5th Annual IEEE Symposium on Field-Programmable Custom Computing Machines Cat. No.97TB100186).

[6]  Keshab K. Parhi,et al.  Hardware/software codesign of finite field datapath for low-energy Reed-Solomon codecs , 2000, IEEE Trans. Very Large Scale Integr. Syst..

[7]  Tong Zhang,et al.  Systematic Design of Original and Modified Mastrovito Multipliers for General Irreducible Polynomials , 2001, IEEE Trans. Computers.