• Home
  • Search
  • Galois Field Instructions in the Sandblaster 2.0 Architectrue
  • Open Access IconOpen Access
  • Cite Icon2
  • https://doi.org/10.1155/2009/129698Copy DOI Icon

Galois Field Instructions in the Sandblaster 2.0 Architectrue

Show More
  • Abstract
  • PDF
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

This paper presents a novel approach to implementing multiplication of Galois Fields with . Elements of GF() can be represented as polynomials of degree less than N over GF(2). Operations are performed modulo an irreducible polynomial of degree n over GF(2). Our approach splits a Galois Field multiply into two operations, polynomial-multiply and polynomial-remainder over GF(2). We show how these two operations can be implemented using the same hardware. Further, we show that in many cases several polynomial-multiply operations can be combined before needing to a polynomial-remainder. The Sandblaster 2.0 is a SIMD architecture. It has SIMD variants of the poly-multiply and poly-remainder instructions. We use a Reed-Solomon encoder and decoder to demonstrate the performance of our approach. Our new approach achieves speedup of 11.5x compared to the standard SIMD processor of 8x.

Loading PDF

Similar Papers
  • Conference Article
  • Citations1

Design of Reed-Solomon Encoder for Error Detection in DRAM Cells

  • Jan 01, 2021
  • AIJR Proceedings
  • Prateek Asthana +3
  • Conference Article
  • Citations2

Implementation of the Berlekamp-Massey algorithm using a DSP

  • Dec 13, 2004
  • S Greenberg +2
  • Research Article
  • Citations24

Theory of factorial designs of the parallel flats type. I: the coefficient matrix

  • Mar 01, 1984
  • Journal of Statistical Planning and Inference
  • Jaya Srivastava +2
  • Research Article
  • Citations349

VLSI architectures for computing multiplications and inverses in GF(2m).

  • Aug 01, 1985
  • IEEE Transactions on Computers
  • Wang +5
  • Conference Article

An application of newton formula on the computation of finite field trace

  • Jul 01, 2014
  • Jiantao Wang +3
  • Book Chapter
  • Citations2

Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small Characteristic

  • Jan 01, 2003
  • Soonhak Kwon +2
  • Book Chapter
  • Citations10

Montgomery Multiplier and Squarer in GF(2m)

  • Jan 01, 2000
  • Huapeng Wu
  • Book Chapter

Finite Fields Exist and are Unique

  • Jan 01, 1987
  • Robert J Mceliece
  • Conference Article
  • Citations2

Run-time reconfiguration of communication in SIMD architectures

  • Jan 01, 2006
  • H Fatemi +4
  • Book Chapter
  • Citations2

Toward a Solution of the Reverse Engineering Problem Using FPGAs

  • Aug 29, 2006
  • Edgar Ferrer +2
  • Book Chapter
  • Citations4

Factorization of polynomials over finite fields

  • Dec 05, 2006
  • Magda Papič
  • PDF
  • Book Chapter

Irreducible Polynomials: Non-Binary Fields

  • May 18, 2022
  • Mani Shankar Prasad +1
  • Research Article
  • Citations6

The difference between permutation polynomials over finite fields

  • Jan 01, 1995
  • Proceedings of the American Mathematical Society
  • Stephen D Cohen +2
  • Conference Article
  • Citations13

A reconfigurable architecture for the FFT operator in a software radio context

  • Jul 05, 2006
  • A Al Ghouwayel +2
  • Research Article
  • Citations3

SbEC‐DbED codes derived from experiments on a computer for semiconductor memory systems

  • Jan 01, 1983
  • Electronics and Communications in Japan (Part I: Communications)
  • Hideo Itoh +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.