By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Conway, Thomas ; Electron. & Comput. Eng. Dept., Univ. of Limerick, Ireland

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(pm) 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(pm). The circuits for GF(pm) addition and multiplication with p≠2, achieve a lower power-delay product than designs based on GF(2m). Also, the architecture for GF(pm) inversion can be efficiently implemented when m=2 or m=3.

Published in:

Circuits and Systems I: Regular Papers, IEEE Transactions on  (Volume:51 ,  Issue: 4 )