Home // International Journal On Advances in Software, volume 2, number 1, 2009 // View article

Examining Implementations of a Computationally Intensive Problem in GF(3)

Authors:
Joey C. Libby
Jonathan P. Lutes
Kenneth B. Kent

Keywords: Optimization; Handel-C; Galois Fields

Abstract:
Computing the irreducible and primitive polynomials under GF(3) is a computationally intensive task. A hardware implementation of this algorithm should prove to increase performance, reducing the time needed to perform the computation. Previous work explored the viability of a co-designed approach to this problem and this work continues addressing the problem by moving the entire algorithm into hardware. Handel-C was chosen as the hardware description language for this work due to its similarities with ANSI C used in the software implementation. A hardware design for the algorithm was developed and optimized using several different optimizations techniques before arriving at a final design.

Pages: 117 to 128

Copyright: Copyright (c) to authors, 2009. Used with permission.

Publication date: June 7, 2009

Published in: journal

ISSN: 1942-2628