Flexible galois field multiplier

Details Flexible galois field multiplier Flexible galois field multiplier

2006-11-07

2006-11-07

Malzahn, D. H. (Department: 2193)

Electrical computers: arithmetic processing and calculating

Electrical digital calculating computer

Particular function performed

Reexamination Certificate

active

07133889

ABSTRACT:
A flexible Galois Field multiplier is provided which implements multiplication of two elements within a finite field defined by a degree and generator polynomial. One preferred embodiment provides a method for multiplying two elements of a finite field. According to the method, two input operands are mapped into a composite finite field, an initial KOA processing is performed upon the two operands in order to prepare the two operands for a multiplication in the ground field, the multiplication in the ground field is performed through the use of a triangular basis multiplier, and final KOA3 processing and optional modulo reduction processing is performed to produce the result. This design allows rapid redefinition of the degree and generator polynomial used for the ground field and the extension field.

REFERENCES:
patent: 6049815 (2000-04-01), Lambert et al.
patent: 6389442 (2002-05-01), Yin et al.
patent: 2001/0056452 (2001-12-01), Kaliski et al.
Reed Solomon Decoder: TMS320C64x Implementation; Application Report, SPRA686, Dec. 2000.
Hasan, M.A. “An Architecture for a Universal Reed-Solomon Encoder using a Triangular Basis Multiplication Algorithm”, IEEE CCECE/CCGEI, 1993, pp. 255-258.
Hasan, M.A. et al. “Efficient Architectures for Computations Over Variable Dimensional Galois Fields”, IEEE Transactions on Circuits and Systems-I: Fundamental Theory and Applications, vol. 45, No. 11, Nov. 1998, pp. 1205-1211.
Wicker, S.B. et al. “Reed-Solomon Codes and Their Applications”, IEEE Press, pp. 68-70.
Furness, R. et al. “Multiplication Using the Triangular Basis Representation Over GF(2m)”, 1996 IEEE, pp. 788-792.
Furness, R. et al. “Generalised Triangular Basis Multipliers for the Design of Reed-Solomon Codecs”, 1997 IEEE, pp. 202-211.
Paar, C. “Efficient VLSI Architectures for Bit Parallel Computation in Galois Fields”, PhD Thesis, University of Essen, Jun. 1994, Chapter 5, pp. 42-58.
Paar, C. et al. “Efficient Multiplier Architectures for Galois Fields GF(24n)”, IEEE Transactions on Computers, vol. 47, No. 2, Feb. 1998, pp. 162-170.
Furness, R. et al. “GF(2m) Multiplication over the Triangular Basis for Design of Reed-Solomon Codes”, IEEE Proc.-Comput. Digit. Tech., vol. 145, No. 6, Nov. 1998, pp. 437-443.

Affiliated with

Also associated with

Rating

Flexible galois field multiplier does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Flexible galois field multiplier, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Flexible galois field multiplier will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3638925