Efficient Reconfigurable Implementation of Canonical and Normal Basis Multipliers Over Galois Fields GF(2 m ) Generated by AOPs
- 75 Downloads
Galois fields GF(2 m ) are used in modern communication systems such as computer networks, satellite links, or compact disks, and they play an important role in a wide number of technical applications. They use arithmetic operations in the Galois field, where the multiplication is the most important and one of the most complex operations. Efficient multiplier architectures are therefore specially important. In this paper, a new method for multiplication in the canonical and normal basis over GF(2 m ) generated by an AOP (all-one-polynomial), which we have named the transpositional method, is presented. This new approach is based on the grouping and sharing of subexpressions. The theoretical space and time complexities of the bit-parallel canonical and normal basis multipliers constructed using our approach are equal to the smallest ones found in the literature for similar methods, but the practical implementation over reconfigurable hardware using our method reduces the area requirements of the multipliers.
Keywords:Galois field GF(2m) canonical basis normal basis bit-parallel multiplier reconfigurable hardware
Unable to display preview. Download preview PDF.
- 1.R. Lidl and H. Niederreiter, Finite Fields, Reading, MA: Addison-Wesley, 1983.Google Scholar
- 2.I. Stewart, Galois Theory, 2nd edition. Chapman & Hall Mathematics, 1989.Google Scholar
- 3.A.J. Menezes, Applications of Finite Fields, Kluwer Academic, 1993.Google Scholar
- 4.C. Paar, Efficient VLSI Architectures for Bit-Parallel Computation in Galois Fields, PhD thesis, Institute for Experimental Mathematics, University of Essen, Essen, Germany, June 1994.Google Scholar
- 6.E.D. Mastrovito, “VLSI Architectures for Multiplication over Finite Fields GF(2m),” in Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, 6th Int'l Conf., AAECC-6, New York: Springer-Verlag, Rome, Italy, 1988, pp. 297–309.Google Scholar
- 7.J. Omura and J. Massey, “Computational Method and Apparatus for Finite Field Arithmetic,” U.S. Patent Number 4,587, 627, 1986.Google Scholar
- 16.W.-J. Woan, “Hankel Matrices and Lattice Paths,” Integer Sequences J., vol. 4, no. (01.1.2), 2001.Google Scholar
- 17.J.L. Imaña and J.M. Sánchez, “A New Reconfigurable-Oriented Method for Canonical Basis Multiplication over a Class of Finite Fields GF(2m),” in Field Programmable Logic and Applications. Proceedings of the 13th International Conference, FPL 2003, Lecture Notes in Computer Science, Springer-Verlag, Sept. 2003, pp. 1127–1130.Google Scholar
- 18.C.C. Kao and Y.T. Lai, “A Routability Driven Technology Mapping Algorithm for LUT Based FPGA Designs,” IEICE Trans. Fundamentals, vol. E84-A, no. 11, 2001, pp. 2690–2696.Google Scholar
- 19.J.L. Imaña and J.M. Sánchez, “Normal Basis Multipliers Construction over a Class of Finite Fields GF(2m),” in Design of Circuits and Integrated Systems. Proceedings of the XVIII Conference, Nov. 2003, pp. 659–663.Google Scholar