Galois field arithmetic over GF(pm) for high-speed/low-power error-control applications

This paper presents a very large-scale integration implementation of Galois field arithmetic for high-speed error-control coding applications that is based on the field GF(p^m) with m a small integer such as 2 or 3 and p a prime of sufficient value to generate the required field size. In this case, the Galois field arithmetic operations of addition, multiplication, and inversion are based on architectures using blocks that perform integer arithmetic modulo p. These integer arithmetic operations modulo p have previously been implemented with low delay power products through the use of one hot coding and barrel shifters circuits based on transistor arrays. In this paper, the same one hot coding and barrel shifters circuits are used to construct circuits that implement addition, multiplication, and inversion over GF(p^m). The circuits for GF(p^m) addition and multiplication with p≠2, achieve a lower power-delay product than designs based on GF(2^m). Also, the architecture for GF(p^m) inversion can be efficiently implemented when m=2 or m=3.