A Handel-C Implementation of a Computationally Intensive Problem in GF(3)

Author

Libby, Joey C. ; Lutes, Jonathan P. ; Kent, Kenneth B.

Author_Institution

Fac. of Comput. Sci., Univ. of New Brunswick, Fredericton, NB

fYear

2008

fDate

Sept. 29 2008-Oct. 4 2008

Firstpage

36

Lastpage

41

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.

Keywords

Galois fields; hardware description languages; hardware-software codesign; software engineering; ANSI C; GF(3); Handel-C implementation; computationally intensive problem; hardware description language; irreducible polynomials; primitive polynomials; software implementation; Communication system control; Computer science; Field programmable gate arrays; Galois fields; Hardware design languages; Parallel processing; Polynomials; Runtime; Software algorithms; Software systems;

fLanguage

English

Publisher

ieee

Conference_Titel

Advances in Electronics and Micro-electronics, 2008. ENICS '08. International Conference on

Conference_Location

Valencia

Print_ISBN

978-0-7695-3370-4

Electronic_ISBN

978-0-7695-3370-4

Type

conf

DOI

10.1109/ENICS.2008.18

Filename

4641232